Critical pair criteria for completion
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
Closure under alpha-conversion
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Higher order unification via explicit substitutions
Information and Computation
Confluence of extensional and non-extensional &lgr;-calculi with explicit substitutions
Theoretical Computer Science
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
Explicit Substitutions with de Bruijn's Levels
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
The Higher-Order Recursive Path Ordering
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
HOL-λσ: an intentional first-order expression of higher-order logic
Mathematical Structures in Computer Science
A λ-calculus with explicit weakening and explicit substitution
Mathematical Structures in Computer Science
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
| Hi-index | 0.00 |
We show how higher-order rewriting may be encoded into first-order rewriting modulo an equational theory Ɛ. We obtain a characterization of the class of higher-order rewriting systems which can be encoded by first-order rewriting modulo an empty theory (that is, Ɛ = θ). This class includes of course the λ-calculus. Our technique does not rely on a particular substitution calculus but on a set of abstract properties to be verified by the substitution calculus used in the translation.