Information and Computation - Semantics of Data Types
Polymorphic rewriting conserves algebraic strong normalization
Selected papers of the 16th international colloquium on Automata, languages, and programming
Handbook of theoretical computer science (vol. B)
Functional programming and lambda calculus
Handbook of theoretical computer science (vol. B)
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
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
Inductive Definitions in the system Coq - Rules and Properties
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
A Termination Ordering for Higher Order Rewrite System
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Termination of Combined (Rewrite and lambda-Calculus) Systems
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
COLOG '88 Proceedings of the International Conference on Computer Logic
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
Journal of Automated Reasoning
Modularity of strong normalization in the algebraic-λ-cube
Journal of Functional Programming
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
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
The Computability Path Ordering: The End of a Quest
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Rewriting modulo in deduction modulo
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Consistency and completeness of rewriting in the calculus of constructions
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Decidability of type-checking in the calculus of algebraic constructions with size annotations
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Inductive consequences in the calculus of constructions
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Computability closure: ten years later
Rewriting Computation and Proof
Rewriting Computation and Proof
New equations for neutral terms: a sound and complete decision procedure, formalized
Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming
| Hi-index | 0.00 |
We show how to incorporate rewriting into the Calculus of Constructions and we prove that the resulting system is strongly normalizing with respect to beta and rewrite reductions. An important novelty of this paper is the possibility to define rewriting rules over dependently typed function symbols. We prove strong normalization for any term rewriting system, such that all function symbols satisfy the, so called, star dependency condition, and every rule is accepted by the Higher Order Recursive Path Ordering (which is an extension of the method created by Jouannaud and Rubio for the setting of the simply typed lambda calculus). The proof of strong normalization is done by using a typed version of reducibility candidates due to Coquand and Gallier. Our criterion is general enough to accept definitions by rewriting of many well-known higher order functions, for example dependent recursors for inductive types or proof carrying functions. This makes it a very good candidate for inclusion in a proof assistant based on the Curry-Howard isomorphism.