l forms are reached, then these must be alpha-convertible. Show two distinct strategies for <code>(snd ((pair "hello") 42))</code>.</p>
</li>
<li>
<p>but in e.g. the untyped lambda-calculus, there are terms with no normal forms.</p>
</li>
<li>
<p>and with some strategies, some normal forms cannot be reached</p>
</li>
<li>
<p>strong normalization is weak normalization + all terms have a normal form</p>
</li>
</ul>
<p>The second important property is the <strong>decidability and uniqueness of typing</strong>.