Programming Language Theory: Difference between revisions
No edit summary |
|||
| Line 5: | Line 5: | ||
* Applicative state transition system (<tt>ast</tt>): <tt>ffp</tt> plus mutable state and coarse-grained operations thereupon | * Applicative state transition system (<tt>ast</tt>): <tt>ffp</tt> plus mutable state and coarse-grained operations thereupon | ||
===Combinatory Logic=== | ===Combinatory Logic=== | ||
===The Y (Fixed-Point) Combinator==== | |||
===Untyped λ-calculus=== | ===Untyped λ-calculus=== | ||
Two operators (function ''definition'' and ''application'') upon one operand type (λ-expression). | Two operators (function ''definition'' and ''application'') upon one operand type (λ-expression). | ||