<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Lambda calculus - Page 34 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Lambda_calculus&amp;p=33">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Lambda_calculus&amp;p=35">3.Next</a>
</p>
<p>and  returns the second.</p>

<p>
: <br/>
: <br/>
: </p>

<p>A linked list can  either be NIL, representing the empty list, or a  of an element (so-called head) and a smaller list (tail). The predicate  returns  for the value , and  for a non-empty list:</p>

<p>
: <br/>
: </p>

<p>Alternatively, with , the construct  obviates the need for an explicit NULL test:</p>

<p>
: <br/>
: </p>

<p>As an example of the use of pairs, the shift-and-increment function that maps  to  can be defined as<br/>
: <br/>
: which  allows us to give perhaps the most</p><p>
<a accesskey="1" href="page.php?w=Lambda_calculus&amp;p=33">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Lambda_calculus&amp;p=35">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
