The Computability Path Ordering: The End of a Quest
Authors:
Open Access
- 1 January 2008
- book chapter
- Published by Springer Nature
- p. 1-14
Abstract
No abstract availableKeywords
All Related Versions
This publication has 30 references indexed in Scilit:
- Polymorphic higher-order recursive path orderingsJournal of the ACM, 2007
- On Dependency Pair Method for Proving Termination of Higher-Order Rewrite SystemsIEICE Transactions on Information and Systems, 2005
- Definitions by rewriting in the Calculus of ConstructionsMathematical Structures in Computer Science, 2005
- The pattern calculusACM Transactions on Programming Languages and Systems, 2004
- Termination checking with typesRAIRO - Theoretical Informatics and Applications, 2004
- Type-based termination of recursive definitionsMathematical Structures in Computer Science, 2004
- Termination of rewriting in the Calculus of ConstructionsJournal of Functional Programming, 2003
- Abstract data type systemsTheoretical Computer Science, 1997
- Strict functionals for termination proofs1995
- Polymorphic rewriting conserves algebraic strong normalization and confluence1989