Typing and computational properties of lambda expressions
Theoretical Computer Science
A type-inference approach to reduction properties and semantics of polymorphic expressions (summary)
Logical foundations of functional programming
Complete restrictions of the intersection type discipline
Theoretical Computer Science
Handbook of logic in computer science (vol. 2)
Lambda-calculus, types and models
Lambda-calculus, types and models
From λσ to λν: a journey through calculi of explicit substitutions
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Confluence properties of weak and strong calculi of explicit substitutions
Journal of the ACM (JACM)
Foundations of programming languages
Foundations of programming languages
Explicit substitution on the edge of strong normalization
Theoretical Computer Science
Perpetual reductions in &lgr;-calculus
Information and Computation
Domains and lambda-calculi
Proving termination with multiset orderings
Communications of the ACM
Typed lambda-calculi with explicit substitutions may not terminate
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Une Extension de la Theorie des Types en lambda-Calcul
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
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
Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution
PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
A Factorisation Theorem in Rewriting Theory
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Perpetuality in a named lambda calculus with explicit substitutions
Mathematical Structures in Computer Science
The λse-calculus does not preserve strong normalisation
Journal of Functional Programming
Journal of Functional Programming
Intersection types for explicit substitutions
Information and Computation
Resource operators for λ-calculus
Information and Computation
Higher-order semantic labelling for inductive datatype systems
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Simple proofs of characterizing strong normalization for explicit substitution calculi
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Hi-index | 0.00 |
This paper is part of a general programme of treating explicit substitutions as the primary λ-calculi from the point of view of foundations as well as applications. We work in a composition-free calculus of explicit substitutions and an augmented calculus obtained by adding explicit garbage-collection, and explore the relationship between intersection-types and reduction.We show that the terms that normalise by leftmost reduction and the terms that normalise by head reduction can each be characterised as the terms typable in a certain system. The relationship between typability and strong normalisation is subtly different from the classical case: we show that typable terms are strongly normalising but give a counterexample to the converse. Our notions of leftmost and head reduction are non-deterministic, and our normalisation theorems apply to any computations obeying these strategies. In this way we refine and strengthen the classical normalisation theorems. The proofs require some new techniques in the presence of reductions involving explicit substitutions. Indeed, our proofs do not rely on results from classical λ-calculus, which in our view is subordinate to the calculus of explicit substitution.