Programming Language Theory: Difference between revisions
No edit summary |
No edit summary |
||
| Line 11: | Line 11: | ||
* <tt>n ≡ λf. λx . f<sup>n</sup>x</tt> | * <tt>n ≡ λf. λx . f<sup>n</sup>x</tt> | ||
* <tt>plus ≡ λm. λn. λf. λx. m f (n f x)</tt> (from f<sup>(m + n)</sup>(x) = f<sup>m</sup>(f<sup>n</sup>(x))) | * <tt>plus ≡ λm. λn. λf. λx. m f (n f x)</tt> (from f<sup>(m + n)</sup>(x) = f<sup>m</sup>(f<sup>n</sup>(x))) | ||
* <tt>succ ≡ λn.λf.λx. f (n f x)</tt> | * <tt>succ ≡ λn. λf. λx. f (n f x)</tt> (β-equivalent to <tt>(plus 1)</tt> for a defined <tt>1</tt>) | ||
Common syntactic sugar: | Common syntactic sugar: | ||
* Left-associative application as implicit parentheses | * Left-associative application as implicit parentheses | ||