Towards rewriting in Coq

Authors:
Jacek Chrząszcz;Daria Walukiewicz-Chrząszcz
Affiliations:
Institute of Informatics, Warsaw University, Warsaw, Poland;Institute of Informatics, Warsaw University, Warsaw, Poland
Venue:
Rewriting Computation and Proof
Year:
2007

Citing 23
Cited 1

Confluence of the lambda calculus with left-linear algebraic rewriting

Information Processing Letters
Synthesis of ML programs in the system Coq

Journal of Symbolic Computation - Special issue on automatic programming
Manifest types, modules, and separate compilation

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Developing certified programs in the system Coq: the program tactic

TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Inductive-data-type systems

Theoretical Computer Science - Special issue on theories of types and proofs
A Module Calculus for Pure Type Systems

TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Structural Recursive Definitions in Type Theory

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Calculus of algebraic Constructions

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved

Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
Inductively defined types

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
Theorem Proving Modulo

Journal of Automated Reasoning
Termination of rewriting in the Calculus of Constructions

Journal of Functional Programming
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
Rewriting modulo in deduction modulo

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Inductive types in the calculus of algebraic constructions

TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
A new extraction for Coq

TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Subset coercions in Coq

TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
CIC∧: type-based termination of recursive definitions in the calculus of inductive constructions

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Consistency and completeness of rewriting in the calculus of constructions

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
On the role of type decorations in the calculus of inductive constructions

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

Weak βη -Normalization and Normalization by Evaluation for System F

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Equational reasoning in Coq is not straightforward. For a few years now there has been an ongoing research process towards adding rewriting to Coq. However, there are many research problems on this way. In this paper we give a coherent view of rewriting in Coq, we describe what is already done and what remains to be done. We discuss such issues as strong normalization, confluence, logical consistency, completeness, modularity and extraction.