-[[!toc]]
-
-##More on evaluation strategies##
-
-Here are notes on [evaluation order] that make the choice of which
-lambda to reduce next the selection of a route through a network of
-links.
-
-
##Computing the length of a list##
How could we compute the length of a list? Without worrying yet about what lambda-calculus implementation we're using for the list, the basic idea would be to define this recursively:
that is similar, but expressed in terms of non-well-founded sets
rather than recursive functions.
-##However...##
-
-You should be cautious about feeling too comfortable with
+HOWEVER, you should be cautious about feeling too comfortable with
these results. Thinking again of the truth-teller paradox, yes,
<code>Ω</code> is *a* fixed point for `I`, and perhaps it has
some a privileged status among all the fixed points for `I`, being the