jure">(def p1 ((pair "hello") 42))
(fst p1)
;=&gt; "hello"
(snd p1)
;=&gt; 42
</code></pre>
<p>Note that in Clojure we could define <code>pair</code> more conveniently as <code>(fn [x y] (fn [z] ((z x) y)))</code> such that the construction of a pair would be simpler, e.g. <code>(pair "hello" 42)</code>. However, it is simpler, at least conceptually, to only consider single-argument functions.</p>
<p>The Church thesis is that everything (at least numerically) computable can be expressed with similar encodin