Theoretical Computer Science
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
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
Information and Computation
Proving the correctness of reactive systems using sized types
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science - Special issue: algebraic development techniques
Rewrite orderings for higher-order terms in n-long &bgr;-normal form and the recursive path ordering
Theoretical Computer Science - Special issue on rewriting techniques and applications
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
The size-change principle for program termination
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science - Special issue on theories of types and proofs
Higher-Order and Symbolic Computation
Dependent Types for Program Termination Verification
Higher-Order and Symbolic Computation
A Monotonic Higher-Order Semantic Path Ordering
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Combining First and Higher Order Rewrite Systems with Type Assignment Systems
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Strict Functionals for Termination Proofs
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Termination and Confluence of Higher-Order Rewrite Systems
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Well-Founded Recursive Relations
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Termination Proofs for Higher-order Rewrite Systems
HOA '93 Selected Papers from the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
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
Definitions by Rewriting in the Calculus of Constructions
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Type-based termination of recursive definitions
Mathematical Structures in Computer Science
Termination of rewriting in the Calculus of Constructions
Journal of Functional Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
IEICE - Transactions on Information and Systems
Polymorphic higher-order recursive path orderings
Journal of the ACM (JACM)
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
HORPO with computability closure: a reconstruction
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Higher-order termination: from kruskal to computability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automated termination analysis for Haskell: from term rewriting to programming languages
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Higher-order orderings for normal rewriting
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Orderings and constraints: theory and practice of proving termination
Rewriting Computation and Proof
Computability closure: ten years later
Rewriting Computation and Proof
A Higher-Order Iterative Path Ordering
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Simplifying algebraic functional systems
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Harnessing first order termination provers using higher order dependency pairs
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Semantic labelling for proving termination of combinatory reduction systems
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Nominal completion for rewrite systems with binders
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Jumping and escaping: Modular termination and the abstract path ordering
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments à la Tait and Girard, therefore explaining the name of the improved ordering.