Church encoding: Difference between revisions

Revision as of 15:47, 25 October 2005

Revision as of 15:52, 25 October 2005

Line 110:

Formal definition in [[lambda calculus]]:

: <tt>true := &#955lambda;ab.a</tt>

: <tt>false := &#955lambda;ab.b</tt>

Functions of boolean arithmetic can be derived for Church booleans:

AND: <m> <ntt>And := &#955lambda;''mnab''.''m''(''nab'')''b''</tt>

OR: <m> <ntt>Or := &#955lambda;''mnab''.''ma''(''nab'')</tt>

NOT: <mtt>Not := &#955lambda;''mab''.''mba''</tt>

==See also==