Another circular program - the list 'nums' is defined in terms of itself. 'F' adds the first two numbers on its input 'L' to form the first element of its output, which in turn becomes part of the input. So, nums is the infinite list of Fibonacci numbers. Note that 'first' and F are quite ordinary functions and could be applied to many other lists.

There are more λ-calculus examples here.