Simply Typed Lambda Calculus with First-Class Environments
Simply Typed Lambda Calculus with First-Class Environments
复制标题
具有一流环境的简单类型 Lambda 演算
DOI：
10.2977/prims/1195164948
复制
发表时间：
1994
影响因子：
1.2
通讯作者：
S. Nishizaki
中科院分区：
文献类型：
--
作者：
S. Nishizaki
我们提出了一个lambda计算X^nv，其中可能会根据 /i^t的语法来处理该计算的一流环境。合并术语和替代的术语之一是由ACR-Calculus的弱减少。最初用于提供ACR-CALCULUS的汇合，我们通过将其降低到简单的标准记录钙的强范围，我们提出了一种类型的推理算法。 。
We propose a lambda calculus X^nv where it is possible to handle first-class environments. This calculus is based on the idea of explicit substitution, that is; /la-calculus. Syntax of /i^t, is obtained by merging the class of terms and the one of substitutions. Reduction is made from the weak reduction of Acr-calculus. Its type system also originates in the one of Aer-calculus. Confluence of /L^r is proved by Hardin's interpretation method which is originally used for proving confluence of Acr-calculus. We proved strong normalizability of A^t, by reducing it to strong normalizability of a simply typed record calculus. Finally, we propose a type inference algorithm which produced a principal typing for each typable term. §
DOI：
10.1007/978-1-4612-0317-9
发表时间：
1993
期刊：
--
影响因子：
--
作者：
P. Curien
通讯作者：
P. Curien