Programming Language Theory: Difference between revisions
| 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==== | ====The Y (Fixed-Point) Combinator==== | ||
===Untyped λ-calculus=== | ===Untyped λ-calculus=== | ||