Parallel reductions in λ-calculus
Journal of Symbolic Computation
Handbook of logic in computer science (vol. 2)
From λσ to λν: a journey through calculi of explicit substitutions
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Theory of Objects
Typed lambda-calculi with explicit substitutions may not terminate
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A Lambda-Calculus `a la de Bruijn with Explicit Substitutions
PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
Explicit Substitutions with de Bruijn's Levels
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalization
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Nomalisation
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Explicit Substitutions for Objects and Functions
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Journal of Functional Programming
Hi-index | 0.00 |
We propose a calculus of explicit substitutions with de Bruijn indices for implementing objects and functions which is confluent and preserves strong normalization. We start from Abadi and Cardelli's ς-calculus [1] for the object calculus and from the λυ-calculus [20] for the functional calculus. The de Bruijn setting poses problems when encoding the λυ-calculus within the ς-calculus following the style proposed in [1]. We introduce fields as a primitive construct in the target calculus in order to deal with these difficulties. The solution obtained greatly simplifies the one proposed in [17] in a named variable setting. We also eliminate the conditional rules present in the latter calculus obtaining in this way a full non-conditional first order system.