Theoretical Computer Science
Perpetual reductions in &lgr;-calculus
Information and Computation
Higher order unification via explicit substitutions
Information and Computation
Typed lambda-calculi with explicit substitutions may not terminate
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Explicit Substitutions and Programming Languages
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
A New Formula for the Execution of Categorial Combinators
Proceedings of the 8th International Conference on Automated Deduction
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Uniform Normalisation beyond Orthogonality
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Proof nets and explicit substitutions
Mathematical Structures in Computer Science
Perpetuality in a named lambda calculus with explicit substitutions
Mathematical Structures in Computer Science
A λ-calculus with explicit weakening and explicit substitution
Mathematical Structures in Computer Science
Intersection types for explicit substitutions
Information and Computation
Resource operators for λ-calculus
Information and Computation
Local Bigraphs and Confluence: Two Conjectures
Electronic Notes in Theoretical Computer Science (ENTCS)
Perpetuality for Full and Safe Composition (in a Constructive Setting)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Efficient reductions with director strings
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
The theory of calculi with explicit substitutions revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Perpetuality for Full and Safe Composition (in a Constructive Setting)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A prismoid framework for languages with resources
Theoretical Computer Science
| Hi-index | 0.00 |
We study perpetuality in calculi with explicit substitutions having full composition. A simple perpetual strategy is used to define strongly normalising terms inductively. This gives a simple argument to show preservation of β-strong normalisation as well as strong normalisation for typed terms. Particularly, the strong normalisation proof is based on implicit substitution rather than explicit substitution, so that it turns out to be modular w.r.t. the well-known proofs for typed lambda-calculus. All the proofs we develop are constructive.