=&gt; A A))
</code></pre>
<p>Note that it is in fact the same type that is reconstructed by Ocaml for the expression <code>fun x -&gt; x</code>.</p>
<p>As a computational statement, the expression above reads:</p>
<blockquote>
<p>for an arbitrary type <code>A</code>, get a function that takes an <code>A</code> and yields an <code>A</code>.</p>
</blockquote>
<p>As a logical statement, the alternative but equivalement reading is:</p>
<blockquote>
<p>for an arbitrary proposition <code>A</code>, it is true that