0 a part of an animal's body, sticking out from the base of the back, or something similar in shape or position: --
1 someone who follows another person to discover where that person goes, what they do, etc. --
2 the side of a coin that does not have a picture of someone's head on it --
3 a tailcoat --
4 someone's bottom: --
5 a phrase that is placed at the end of a sentence and refers to something mentioned in the sentence --
With or without these restrictions, programs may have general recursion, tail recursion, or primitive recursion, yielding six combinations.
The result follows by property (a) of tail and by property (b) of cs6 (see points (4) and (5) at the beginning of this subsection).
The definition of f is called tail-recursive-think of ' ' as a conditional.
We omitted the transformations that eliminate tail recursion from the derivation of this program.
The initial specification may contain abstractions, such as higher-order functions or non-tail recursions, which have no direct interpretation as a circuit.
Of course recursion may result in run-time overhead, but the authors emphasize how to avoid this by using tail recursion.
The same behaviour occurs with the unoptimized discipline, probably because of the loss of tail-recursion elimination.
The problem is not, however, inherent in the f oldr function because f oldr is not tail-strict.
