Theoretical Computer Science
Rewrite, rewrite, rewrite, rewrite, rewrite, …
Selected papers of the 16th international colloquium on Automata, languages, and programming
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
Information and Computation
Infinite Terms and Infinite Rewritings
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
Linear types and non-size-increasing polynomial time computation
Information and Computation - Special issue: ICC '99
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
An Explicit Formula for the Free Exponential Modality of Linear Logic
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Semantic Techniques in Quantum Computation
Semantic Techniques in Quantum Computation
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
| Hi-index | 0.00 |
It is well known that the real numbers arise from the metric completion of the rational numbers, with the metric induced by the usual absolute value. We seek a computational version of this phenomenon, with the idea that the role of the rationals should be played by the affine lambda-calculus, whose dynamics is finitary; the full lambda-calculus should then appear as a suitable metric completion of the affine lambda-calculus. This paper proposes a technical realization of this idea: an affine lambda-calculus is introduced, based on a fragment of intuitionistic multiplicative linear logic; the calculus is endowed with a notion of distance making the set of terms an incomplete metric space; the completion of this space is shown to yield an infinitary affine lambda-calculus, whose quotient under a suitable partial equivalence relation is exactly the full (non-affine) lambda-calculus. We also show how this construction brings interesting insights on some standard rewriting properties of the lambda-calculus (finite developments, confluence, standardization, head normalization and solvability).