Linearity and recursion in a typed lambda-calculus
chapter
posted on 2023-06-08, 06:50authored byIan Mackie
We show that the full PCF language can be encoded in L_rec, a syntactically linear ?-calculus extended with numbers, pairs, and an unbounded recursor that preserves the syntactic linearity of the calculus. We give call-by-name and call-by-value evaluation strategies and discuss implementation techniques for L_rec, exploiting its linearity.