An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus

被引:10
作者
Mazza, Damiano [1 ]
机构
[1] Univ Paris 13, CNRS, Lab Informat Paris Nord, UMR 7030, F-93430 Villetaneuse, France
来源
2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS) | 2012年
关键词
Computation theory; topology; lambda-calculus; infinitary rewriting; LINEAR LOGIC;
D O I
10.1109/LICS.2012.57
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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).
引用
收藏
页码:471 / 480
页数:10
相关论文
共 23 条
[1]  
Abramsky S, 2000, INFORM COMPUT, V163, P409, DOI [10.1006/inco.2000.2930, 10.1006/inco2000.2930]
[2]  
Accattoli B, 2010, LECT NOTES COMPUT SC, V6247, P381, DOI 10.1007/978-3-642-15205-4_30
[3]  
[Anonymous], LAMBDA CALCULUS
[4]  
[Anonymous], 1972, INDAGATIONES MATHEMA, DOI DOI 10.1016/1385-7258(72)90034-0
[5]  
ARNOLD A, 1980, FUNDAMENTA INFORMATI, V3, P445
[6]  
Asperti A., 1998, OPTIMAL IMPLEMENTATI
[7]   Ludics with repetitions (Exponentials, Interactive types and Completeness) [J].
Basaldella, Michele ;
Faggian, Claudia .
24TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2009, :375-+
[8]  
Boudol G., 1993, 2025 INRIA SOPH ANT
[9]  
Chen Y., 1990, LNCS, V516, P115
[10]   FUNDAMENTAL PROPERTIES OF INFINITE-TREES [J].
COURCELLE, B .
THEORETICAL COMPUTER SCIENCE, 1983, 25 (02) :95-169