- Record: found
- Abstract: found
- Article: found
Linear Recursion
Preprint
2010-01-19
Read this article at
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
We show that the full PCF language can be encoded in Lrec, a linear lambda-calculus extended with numbers, pairs and an unbounded recursor that preserves the syntactic linearity of the calculus. Thus, Lrec is a Turing complete extension of the linear lambda-calculus. We discuss evaluation strategies and implementation techniques for Lrec, exploiting the linearity of the system.
Related collections
Most cited references28
- Record: found
- Abstract: not found
- Article: not found
LCF considered as a programming language
G.D. Plotkin (1977)
- Record: found
- Abstract: not found
- Article: not found
The differential lambda-calculus
Thomas Ehrhard, Laurent Regnier (2003)