A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
Handbook of theoretical computer science (vol. B)
Handbook of logic in computer science (vol. 2)
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Functional back-ends within the lambda-sigma calculus
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Term rewriting and all that
Descendants and origins in term rewriting
Information and Computation - Special issue on RTA-98
Strong Normalization of Substitutions
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Typed lambda-calculi with explicit substitutions may not terminate
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
A de Bruijn Notation for Higher-Order Rewriting
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Optimal Normalization in Orthogonal Term Rewriting Systems
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
A λ-calculus with explicit weakening and explicit substitution
Mathematical Structures in Computer Science
A normalisation result for higher-order calculi with explicit substitutions
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
| Hi-index | 0.00 |
Explicit substitutions (ES) were introduced as a bridge between the theory of rewrite systems with binders and substitution, such as the λ-calculus, and their implementation. In a seminal paper Melliès observed that the dynamical properties of a rewrite system and its ES-based implementation may not coincide: he showed that a strongly normalising term (i.e. one which does not admit infinite derivations) in the λ-calculus may lose this status in its ES-based implementation. This paper studies normalisation for the latter systems in the general setting of higher-order rewriting: Based on recent work extending the theory of needed strategies to non-orthogonal rewrite systems we show that needed strategies normalise in the ES-based implementation of any orthogonal pattern higher-order rewrite system.