# More on Lists #
+<a id=comprehensions></a>
## Comprehensions ##
We know you are already familiar with the following kind of notation for designating sets:
To get the latter, you'd need to apply `join` twice.
+
+<a id=tails></a>
## Tails ##
For the Lambda Calculus, we've proposed to encode lists in terms of higher-order functions that perform right-folds on (what we intuitively regard as) the real list. Thus, the list we'd write in Kapulet or Haskell as:
and the result will be `\f z. f b (f c z)`, our encoding of `[b, c]`.
+
+<a id=v2-lists></a>