Check out my first novel, midnight's simulacra!
Programming Language Theory: Difference between revisions
From dankwiki
(→Prolog) |
|||
| Line 19: | Line 19: | ||
The ''omega'' combinator is divergent. It can be reduced, but has no normal form: | The ''omega'' combinator is divergent. It can be reduced, but has no normal form: | ||
* <tt>omega ≡ (λx. x x) (λx. x x)</tt> | * <tt>omega ≡ (λx. x x) (λx. x x)</tt> | ||
A combinator which is in normal form, but not reduced to a value, is said to be ''stuck''. One of the major | A combinator which is in normal form, but not reduced to a value, is said to be ''stuck''. One of the major objectives of static [[Programming_Language_Theory#Typing|typing systems]] is to detect possible "stuck" reductions. | ||
====Fixed-Point Combinators==== | ====Fixed-Point Combinators==== | ||
