st/lama_byterun
1
0
Fork 0
mirror of https://github.com/ProgramSnail/Lama.git synced 2025-12-25 08:08:47 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Added pattern-matching in lectures

Browse source
This commit is contained in:
Dmitry Boulytchev 2019-11-19 03:24:17 +03:00
parent dad4c35a80
commit d89cd76cd9
11 changed files with 247 additions and 27 deletions
Download patch file Download diff file Expand all files Collapse all files

4
doc/02.tex
View file

@ -48,7 +48,7 @@ With the relation ``$\Rightarrow$'' defined we can abbreviate the ``surface'' se
\setarrow{\xRightarrow}
\[
\forall S\in\mathscr S,\,\forall \iota\in\mathbb Z^*\;:\;\sembr{S}_{\mathscr S} \iota = o \Leftrightarrow \trans{\inbr{\bot, i, \epsilon}}{S}{\inbr{\_, \_, o}}
\forall S\in\mathscr S,\,\forall \iota\in\mathbb Z^*\;:\;\sembr{S}_{\mathscr S} \iota = o \Leftrightarrow \trans{\inbr{\Lambda, i, \epsilon}}{S}{\inbr{\_, \_, o}}
\]
@ -102,7 +102,7 @@ now we have one axiom and six inference rules (one per instruction).
As for the statement, with the aid of the relation ``$\Rightarrow$'' we can define the surface semantics of stack machine:
\[
\forall p\in\mathscr P,\,\forall i\in\mathbb Z^*\;:\;\sembr{p}_{SM}\;i=o\Leftrightarrow\trans{\inbr{\epsilon, \inbr{\bot, i, \epsilon}}}{p}{\inbr{\_, \inbr{\_, \_, o}}}
\forall p\in\mathscr P,\,\forall i\in\mathbb Z^*\;:\;\sembr{p}_{SM}\;i=o\Leftrightarrow\trans{\inbr{\epsilon, \inbr{\Lambda, i, \epsilon}}}{p}{\inbr{\_, \inbr{\_, \_, o}}}
\]
\begin{figure}[t]