Programming Language Theory: Difference between revisions
| Line 87: | Line 87: | ||
* <tt>test ≡ λa. λb. λc. a b c</tt> (using <tt>true</tt>/<tt>false</tt> for a, <tt>test</tt> reduces to <tt>b</tt> on <tt>true</tt>, and <tt>c</tt> on <tt>false</tt>) | * <tt>test ≡ λa. λb. λc. a b c</tt> (using <tt>true</tt>/<tt>false</tt> for a, <tt>test</tt> reduces to <tt>b</tt> on <tt>true</tt>, and <tt>c</tt> on <tt>false</tt>) | ||
* <tt>not ≡ λt. t false true</tt> (β-equivalent to <tt>test(A, false, true)</tt>) | * <tt>not ≡ λt. t false true</tt> (β-equivalent to <tt>test(A, false, true)</tt>) | ||
* <tt>iszro ≡ λm. m (λx. false) true</tt> | |||
====Pairs==== | ====Pairs==== | ||