The Coq proof assistant : reference manual, version 6.1

Coq is a proof assistant based on a higher-order logic allowing powerful definitions of functions. Coq V6.1 is available by anonymous ftp at ftp.inria.fr:/INRIA/Projects/coq/V6.1 and ftp.ens-lyon.fr:/pub/LIP/COQ/V6.1

[1]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[2]  J. Davenport.  Editor , 1960 .

[3]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[4]  de Ng Dick Bruijn.  Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[5]  de Ng Dick Bruijn,et al.  A survey of the project Automath , 1980 .

[6]  Richard W. Weyhrauch,et al.  A Decidable Fragment of Predicate Calculus , 1984, Theor. Comput. Sci..

[7]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[8]  Thierry Coquand,et al.  Constructions: A Higher Order Proof System for Mechanizing Mathematics , 1985, European Conference on Computer Algebra.

[9]  Robert L. Constable,et al.  Proofs as programs , 1985, TOPL.

[10]  Lennart Augustsson,et al.  Compiling Pattern Matching , 1985, FPCA.

[11]  M. Beeson.  Foundations of Constructive Mathematics , 1985 .

[12]  Thierry Coquand,et al.  Concepts mathématiques et informatiques formalisés dans le calcul des constructions , 1985, Logic Colloquium.

[13]  Editors , 1986, Brain Research Bulletin.

[14]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[15]  Thierry Coquand,et al.  An Analysis of Girard's Paradox , 1986, LICS.

[16]  Gérard P. Huet,et al.  Induction Principles Formalized in the Calculus of Constructions , 1987, TAPSOFT, Vol.1.

[17]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[18]  A. Troelstra,et al.  Constructivism in Mathematics: An Introduction , 1988 .

[19]  Christine C. Paulin.  Extraction de programmes dans le calcul des constructions , 1989 .

[20]  Gérard P. Huet,et al.  The Constructive Engine , 1989, A Perspective in Theoretical Computer Science.

[21]  T. Coquand,et al.  Metamathematical investigations of a calculus of constructions , 1989 .

[22]  Christine Paulin-Mohring,et al.  Extracting ω's programs from proofs in the calculus of constructions , 1989, POPL '89.

[23]  J. Girard,et al.  Proofs and types , 1989 .

[24]  J. Krivine.  Lambda-calcul : types et modèles , 1990 .

[25]  Xavier Leroy,et al.  The ZINC experiment : an economical implementation of the ML language , 1990 .

[26]  Amy P. Felty,et al.  The Coq proof assistant user's guide : version 5.6 , 1990 .

[27]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[28]  Bengt Nordström,et al.  Programming in Martin-Löf's Type Theory , 1990 .

[29]  Philippe Audebaud,et al.  Partial objects in the calculus of constructions , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[30]  Gilles Dowek,et al.  A Second-Order Pattern Matching Algorithm for the Cube of Typed Lambda-Calculi , 1991, MFCS.

[31]  G. Dowek.  Démonstration Automatique dans le Calcul des Constructions. (Automated Theorem Proving in the Calculus of Constructions) , 1991 .

[32]  G. Dowek.  L'INDECIDABILITE DU FILTRAGE DU TROSIEME ORDRE DANS LES CALCULS AVEC TYPESDEPENDANTS OU CONSTRUCTEURS DE TYPES , 1991 .

[33]  Alain Laville.  Comparison of Priority Rules in Pattern Matching and Term Rewriting , 1991, J. Symb. Comput..

[34]  C. Audebaud.  Extension du calcul des constructions par points fixes , 1992 .

[35]  J. Rouyer.  Développement de l'algorithme d'unification dans le calcul des constructions avec types inductifs , 1992 .

[36]  Gilles Kahn,et al.  Real theorem provers deserve real user-interfaces , 1992, SDE 5.

[37]  Gérard P. Huet,et al.  The Gallina Specification language: A Case Study , 1992, FSTTCS.

[38]  Gianluigi Bellin,et al.  A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementation , 1992, Theor. Comput. Sci..

[39]  Michel Parigot,et al.  ProPre A Programming Language with Proofs , 1992, LPAR.

[40]  Michel Parigot.  Recursive Programming with Proofs , 1992, Theor. Comput. Sci..

[41]  Christine Paulin-Mohring,et al.  Synthesis of ML Programs in the System Coq , 1993, J. Symb. Comput..

[42]  Xavier Leroy,et al.  Le langage Caml , 1993 .

[43]  Catherine Parent,et al.  Developing Certified Programs in the System Coq - The Program Tactic , 1994, TYPES.

[44]  Gilles Dowek,et al.  A Complete Proof Synthesis Method for the Cube of Type Systems , 1993, J. Log. Comput..

[45]  Gilles Dowek.  The Undecidability of Pattern Matching in Calculi Where Primitive Recursive Functions are Representable , 1993, Theor. Comput. Sci..

[46]  K. V. S. Prasad.  Programming with Broadcasts , 1993, CONCUR.

[47]  Christine Paulin-Mohring,et al.  Inductive Definitions in the system Coq - Rules and Properties , 1993, TLCA.

[48]  Christine Paulin-Mohring,et al.  Programming with Streams in Coq - A Case Study: the Sieve of Eratosthenes , 1994, TYPES.

[49]  Laurence Puel,et al.  Compiling Pattern Matching by Term Decomposition , 1993, J. Symb. Comput..

[50]  Benjamin Werner,et al.  Une Théorie des Constructions Inductives , 1994 .

[51]  Gilles Dowek,et al.  Third Order Matching is Decidable , 1994, Ann. Pure Appl. Log..

[52]  Pascal Manoury.  A User's Friendly Syntax to Define Recursive Functions as Typed lambda-Terms , 1994, TYPES.

[53]  Luc Maranget,et al.  Two Techniques for Compiling Lazy Pattern Matching , 1994 .

[54]  Gérard Huet,et al.  Residual theory in λ-calculus: a formal development , 1994, Journal of Functional Programming.

[55]  CoqJean-Christophe FILLIÂTREFebruary.  A decision procedure for Direct Predicate Calculus Study and implementation in the system Coq Jean , 1995 .

[56]  Catherine Parent.  Synthese de preuves de programmes dans le calcul des constructions inductives , 1995 .

[57]  Catherine Parent,et al.  Synthesizing Proofs from Programs in the Calculus of Inductive Constructions , 1995, MPC.