need</em> (the one implemented in Haskell). We will not explain these (there are far better sources), but we have to remember two things:</p>
<ul>
<li>
<p>beta-reduction is at the heart of the lambda-calculus semantics</p>
</li>
<li>
<p>a strategy to find the first redex to reduce must be established</p>
</li>
</ul>
<p>And we have now everything at hand to explain the lambda-calculus driving LaTTe.</p>
<h2><a href="#lambda-for-reasoning" id="lambda-for-reasoning"></a>Lambda for reasoning</h2>
<p>The lambda-