gs in such a “simple” lambda-calculus (or equivalently by Turing machines). While most introductions provide long lists of encodings of things such as booleans, numbers, arithmetic operations, (etc.), we will <em>not</em>. The thing is, such encodings are in general not practical, and most often yield very slow computations.</p>
<p>Before dwelving into the main subject, reasoning with a lambda-calculus, we have to introduce (or remind of) two important features: <em>alpha-conversion</em> and <em>beta-re