Explicit substitutions-Reference-Cited by-同舟云学术

Explicit substitutions

Published:1991-10 Issue:4 Volume:1 Page:375-416
ISSN:0956-7968
Container-title:Journal of Functional Programming
language:en
Short-container-title:J. Funct. Prog.

Author:

Abadi M.,Cardelli L.,Curien P.-L.,Lévy J.-J.

Abstract

AbstractThe λσ-calculus is a refinement of the λ-calculus where substitutions are manipulated explicitly. The λσ-calculus provides a setting for studying the theory of substitutions, with pleasant mathematical properties. It is also a useful bridge between the classical λ-calculus and concrete implementations.

Publisher

Cambridge University Press (CUP)

Subject

Software

Reference18 articles.

1. Comptes Rendus de l'Académie des Sciences de Paris, t. 312, Série I, pp. 471–76.

2. Curien P.-L. and Ríos A. 1991. Un Résultat de Complétude pour les Substitutions Explicites.

3. Hardin T. and Lévy J.-J. 1989. A confluent calculus of substitutions. In France–Japan Artificial Intelligence and Computer Science Symposium, Izu, Japan, December.

4. Curien P.-L. , Hardin T. and Ríos A. 1991 b. Normalisation forte des substitutions (draft).

Cited by 310 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Eight Rules for Implication Elimination;Outstanding Contributions to Logic;2024

2. Comments on the Contributions;Outstanding Contributions to Logic;2024

3. Syntax Monads for the Working Formal Metatheorist;Electronic Proceedings in Theoretical Computer Science;2023-12-14

4. Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic;Logical Methods in Computer Science;2023-12-14

5. Karl Popper on Deduction;Synthese Library;2023-12-13