0 the practice of describing numbers, expressions, etc. in terms of the numbers, expressions, etc. that come before them in a series: --
Since we want to be able to define recursive expressions of any type, there is no specific type construct associated with recursion.
Section 8 discusses the semantics of recursion, and section 9 discusses refinement laws and presents a small example.
I am not entirely convinced, though, that the objective to eliminate recursion is fully successful.
However, implementations of lazy functional languages generally express recursion by a back-pointer in the function graph.
In general, if we allow functional result type in a safe recursion then we can define exponentiation.
As another illustration of action constructs, we consider how countable nondeterminism can be approximated by means of binary choice and recursion.
In section 3.2, we transform dc2 to linear recursion.
In this way, semantically, the linear recursion can be reduced to recursion with ground result type and substitution of parameters.
