and the initial `(\x. x x)` is just what we earlier called the <code>ω</code> combinator (lower-case omega, not the non-terminating <code>Ω</code>). So the self-application of `H` can be written:
-<pre><code>ω (\h \lst. (isempty lst) zero (add one ((h h) (extract-tail lst))))</code></pre>
+<pre><code>ω (\h \lst. (isempty lst) zero (add one ((h h) (extract-tail lst))))
+</code></pre>
+
and this will indeed implement the recursive function we couldn't earlier figure out how to define.