Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Proofs and types
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
Polymorphic rewriting conserves algebraic strong normalization
Selected papers of the 16th international colloquium on Automata, languages, and programming
Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Handbook of theoretical computer science (vol. B)
Adding algebraic rewriting to the untyped lambda calculus
Information and Computation
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
Polymorphic rewriting conserves algebraic confluence
Information and Computation
Theoretical Computer Science - Special issue: algebraic development techniques
Higher-order rewrite systems and their confluence
Theoretical Computer Science - Special issue: rewriting systems and applications
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Theoretical Computer Science - Special issue on theories of types and proofs
The Calculus of algebraic Constructions
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Termination and Confluence of Higher-Order Rewrite Systems
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
A Termination Ordering for Higher Order Rewrite System
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
A Recursive Path Ordering for Higher-Order Terms in eta-Long beta-Normal Form
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Termination Proofs for Higher-order Rewrite Systems
HOA '93 Selected Papers from the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
Development Closed Critical Pairs
HOA '95 Selected Papers from the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
Termination of Combined (Rewrite and lambda-Calculus) Systems
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
The Higher-Order Recursive Path Ordering
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Termination of rewriting in the Calculus of Constructions
Journal of Functional Programming
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Rewriting modulo in deduction modulo
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Higher-order orderings for normal rewriting
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
The Computability Path Ordering: The End of a Quest
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
| Hi-index | 0.00 |
The notion of computability closure has been introduced for proving the termination of higher-order rewriting with first-order matching by Jean-Pierre Jouannaud and Mitsuhiro Okada in a 1997 draft which later served as a basis for the author's PhD. In this paper, we show how this notion can also be used for dealing with β-normalized rewriting with matching modulo βη (on patterns à la Miller), rewriting with matching modulo some equational theory, and higher-order data types (types with constructors having functional recursive arguments). Finally, we show how the computability closure can easily be turned into a reduction ordering which, in the higher-order case, contains Jean-Pierre Jouannaud and Albert Rubio's higher-order recursive path ordering and, in the firstorder case, is equal to the usual first-order recursive path ordering.