Halt and catch fire: Difference between revisions
Content added Content deleted
imported>Tromp |
imported>Tromp |
||
Line 102: | Line 102: | ||
=={{header|Binary Lambda Calculus}}== |
=={{header|Binary Lambda Calculus}}== |
||
BLC forces normal programs to start with a closed lambda term, by mapping free variables to the divergent Omega = <code>(\x.x x)(\x.x x)</code>, the lambda calculus equivalent of an infinite loop. That makes the following BLC program the smallest to catch fire: |
BLC forces normal programs to start with a closed lambda term, by mapping free variables to the divergent Omega = <code>(\x.x x)(\x.x x)</code>, the lambda calculus equivalent of an infinite loop. That makes the following 2-bit BLC program the smallest to catch fire: |
||
<syntaxhighlight>10</syntaxhighlight> |
<syntaxhighlight>10</syntaxhighlight> |