Journal of Symbolic Computation
Proofs and types
Handbook of combinatorics (vol. 1)
Handbook of formal languages, vol. 3
A Method for Automatic Cryptographic Protocol Verification
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Modular Termination of Term Rewriting Systems Revisited
Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
On a Duality Between Kruskal and Dershowitz Theorems
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Abstracting Cryptographic Protocols with Tree Automata
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Well-foundedness of Term Orderings
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
The Higher-Order Recursive Path Ordering
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
The Computability Path Ordering: The End of a Quest
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Languages: From Formal to Natural
A proof of weak termination providing the right way to terminate
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Jumping and escaping: Modular termination and the abstract path ordering
Theoretical Computer Science
| Hi-index | 0.00 |
We give a short constructive proof of the fact that certain binary relations are well-founded, given a lifting ≫ à la Ferreira-Zantema and a well-founded relation ▹. This construction generalizes several variants of the recursive path ordering on terms and of the Knuth-Bendix ordering. It also applies to other domains, of graphs, of infinite terms, of word and tree automata notably. We then extend this construction further; the resulting family of well-founded relations generalizes Jouannaud and Rubio's higher-order recursive path orderings.