f <code>v</code> of <code>A</code>)</p>
</li>
</ul>
<p>This is the <em>PaT</em> (or maybe more accurately <em>PaT-PaT</em>) interpretation of a (typed) lambda-calculus, and it is at the heart of LaTTe.</p>
<p>To provide a slightly more advanced example of the interest and use of the <em>PaT</em> interpretation, we will consider once more the pairing function.</p>
<p>In Clojure it was defined as follows:</p>
<pre><code class="language-clojure">(fn [x] (fn [y] (fn [z] ((z x) y))))
</code></pre>
<p>We can give