(fun x -> ((fun x -> x) 2) 3)
- and there's no more change of state going on here than there is in <code>&exists;x. (F x and &exists;x (not (F x)))</code>.
+ and there's no more change of state going on here than there is in:
+
+ <pre>
+ <code>∃x. (F x and ∃x (not (F x)))</code>
+ </pre>
Some more comparisons between Scheme and OCaml