Certified higher-order recursive path ordering

Authors:
Adam Koprowski
Affiliations:
Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
Venue:
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Year:
2006

Citing 4
Cited 1

Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
The Higher-Order Recursive Path Ordering

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Extracting constructive content from classical proofs

Extracting constructive content from classical proofs

Modeling permutations in CoQ for COCCINELLE

Rewriting Computation and Proof

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper reports on a formalization of a proof of well-foundedness of the higher-order recursive path ordering (HORPO) in the proof checker Coq. The development is axiom-free and fully constructive. Three substantive parts that could be used also in other developments are the formalizations of the simply-typed lambda calculus, of finite multisets and of the multiset ordering. The Coq code consists of more than 1000 lemmas and 300 definitions.