Coq modulo theory

Authors:
Pierre-Yves Strub
Affiliations:
INRIA, Tsinghua University, Tsinghua University
Venue:
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Year:
2010

Citing 14
Cited 3

Completion of a set of rules modulo a set of equations

SIAM Journal on Computing
The calculus of constructions

Information and Computation - Semantics of Data Types
Rewrite systems

Handbook of theoretical computer science (vol. B)
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
A Practical Decision Procedure for Arithmetic with Function Symbols

Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Structural Recursive Definitions in Type Theory

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Normalized Types

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Inductively defined types

COLOG '88 Proceedings of the International Conference on Computer Logic
Definitions by rewriting in the Calculus of Constructions

Mathematical Structures in Computer Science
Inductive types in the Calculus of Algebraic Constructions

Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
The Open Calculus of Constructions (Part I): An Equational Type Theory with Dependent Types for Programming, Specification, and Interactive Theorem Proving

Fundamenta Informaticae
Extensionality in the calculus of constructions

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Building decision procedures in the calculus of inductive constructions

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

How to make ad hoc proof automation less ad hoc

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Static and user-extensible proof checking

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transporting functions across ornaments

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coq Modulo Theory (CoqMT) is an extension of the Coq proof assistant incorporating, in its computational mechanism, validity entailment for user-defined first-order equational theories. Such a mechanism strictly enriches the system (more terms are typable), eases the use of dependent types and provides more automation during the development of proofs. CoqMT improves over the Calculus of Congruent Inductive Constructions by getting rid of various restrictions and simplifying the type-checking algorithm and the integration of first-order decision procedures. We present here CoqMT, and outline its meta-theoretical study. We also give a brief description of our CoqMT implementation.