Marco/ThProg-Merkzettel
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

fixed algorithmus w

Browse Source
This commit is contained in:
Alexander Schroth 2018-10-08 19:19:25 +02:00
parent 6c81f43387
commit 8caf669989
2 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
merkzettel.pdf
View File

Binary file not shown.

2
merkzettel.tex
View File

@ -139,7 +139,7 @@ Wir definieren $A \subseteq \mathbb{N}$ und für jede $n$-stellige Operation $f$
\begin{itemize} \begin{itemize}
\item Menge $PT$ von Typgleichungen \item Menge $PT$ von Typgleichungen
\begin{align*} \begin{align*}
PT(\Gamma;x;\alpha) &= \lbrace a\pteq b \vert x:\beta \in \Gamma\rbrace\\ PT(\Gamma;x;\alpha) &= \lbrace \alpha \pteq \beta ~\vert~ x:\beta \in \Gamma\rbrace\\
PT(\Gamma; \lambda x.t; \alpha) &= PT((\Gamma;x:a);t;b) \cup \lbrace a\rightarrow b \pteq \alpha \rbrace\ \text{mit $a,b$ frisch}\\ PT(\Gamma; \lambda x.t; \alpha) &= PT((\Gamma;x:a);t;b) \cup \lbrace a\rightarrow b \pteq \alpha \rbrace\ \text{mit $a,b$ frisch}\\
PT(\Gamma;ts;\alpha) &= PT(\Gamma; t; a\rightarrow \alpha ) \cup PT(\Gamma;s;a)\ \text{mit $a$ frisch} PT(\Gamma;ts;\alpha) &= PT(\Gamma; t; a\rightarrow \alpha ) \cup PT(\Gamma;s;a)\ \text{mit $a$ frisch}
\end{align*} \end{align*}