uirements when considering the formalization of logic.</p>
<p>First, let’s remind that the syntactic equality of lambda-terms is governed by <em>alpha-conversion</em>, and the semantics are driven by <em>beta-reduction</em>.</p>
<p>The first important property of the calculus is what is called <strong>strong normalization</strong>.</p>
<p>TODO :</p>
<ul>
<li>
<p>a term is said in <em>normal form</em> iff there is not any redex.</p>
</li>
<li>
<p>weak normalization means that if from a given term two norma