 others). It is (hence) named the <em>Curry-Howard correspondance</em> between:</p>
<ul>
<li>
<p>types and terms of a lambda-calculus on the one, computational, side</p>
</li>
<li>
<p>propositions and proofs on the other, logical, side</p>
</li>
</ul>
<p>When we gave a logical reading for lambda-terms in the previous sections, we used:</p>
<ul>
<li>
<p><em>Propositions-as-Types</em> (e.g. suppose an arbitrary proposition <code>A</code>)</p>
</li>
<li>
<p><em>Proofs-as-Terms</em> (e.g. suppose we have a proo