LAMBDA Recursion

LAMBDA recursion allows the user to apply lambda terms recursively using anonymous recursion.

LET(
	func, LAMBDA(func, <variables>, <expression>),
	func(func, <variables>)
)

LAMBDA(func, func(func, <variables>))(LAMBDA(func, <variables>, <expression>))

Either syntax is valid; however, LET is typically easier to work with and read. In computer science terms, LET enables named function recursion.

Recursive formulae should have a base case. Iterative formulae, not to be confused with iterative calculation, can be implemented using tail recursion. This is the most common use for LAMBDA recursion. Other forms of recursion, such as multiple recursion, are not as common due to calculation limits.