+[[!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:
##Fixed-point Combinators Are a Bit Intoxicating##
-
+
There's a tendency for people to say "Y-combinator" to refer to fixed-point combinators generally. We'll probably fall into that usage ourselves. Speaking correctly, though, the Y-combinator is only one of many fixed-point combinators.
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
The chameleon nature of (3), by the way (a description that is equally
good at describing any object), makes it particularly well suited as a
-gloss on pronouns such as *it*. In the system of [Jacobson 1999](http://www.zas.gwz-berlin.de/mitarb/homepage/sauerland/jacobson99.pdf)
+gloss on pronouns such as *it*. In the system of
+[Jacobson 1999](http://www.springerlink.com/content/j706674r4w217jj5/),
pronouns denote (you guessed it!) identity functions...
Ultimately, in the context of this course, these paradoxes are more