duction</em>.</p>
<h3><a href="#alpha-conversion" id="alpha-conversion"></a>Alpha-conversion</h3>
<p>First, the syntax of the lambda-calculus relies on a (in fact) non-trivial notion of equality named <em>alpha-equivalence</em>. Under some “non-conflicting” conditions (this is the non-trivial part), renaming a bound variable should not change the syntactic nature of a lambda-term.</p>
<p>For example, both the following terms:</p>
<pre><code class="language-clojure">(fn [x] x)
(fn [y] y)
</code></pre>
<p