Dowek, G., Felty, A., Herbelin, H., Huet, G., Murthy, C., Parent, C., Paulin-Mohring, C., and Werner, B. The Coq Proof Assistant User's Guide. Rapport Techniques, no. 154, INRIA, Rocquencourt, France, 1993. Version 5.8. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Framework for Distributed Interoperation Based On Higher-Order.. - Liang (Correct)
....as C procedures invoked from several declarative languages. 2 Middleware and Meta Logic The encoding of object level formalisms into suitable meta level logical frameworks is a common practice in many areas of formal methods and logic. Interactive theorem provers such as Isabelle [14] and Coq [5] use common higher order meta logics to encode the syntax and semantics of various object level logics. Meta languages of both the functional and logic programming variety have also been used to specify and analyze properties of object level programming languages. These encodings involve ....
G. Dowek et al. The Coq proof assistant user's guide. Technical Report 134, INRIA, 1993, 1993.
Fast Tactic-based Theorem Proving - Hickey, Nogin (2000) (Correct)
....structures and modularity, which allows parts of the prover to be customized on a domain speci c basis. Our architecture is used in the MetaPRL logical framework, with speedups of more than two orders of magnitude over traditional tactic based proof search. 1 Introduction Several provers [7 9, 11, 12, 15, 18] use higher order logics for reasoning because the expressivity of the logics permits concise problem descriptions, and because meta principles that characterize entire classes of problems can be proved and reused on multiple problem instances. In these provers, proof automation is coded in a ....
Gilles Dowek, Amy Felty, Hugo Herbelin, Gerard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The coq proof assistant user's guide. Technical Report Rapport Techniques 154, INRIA, Rocquencourt, France, 1993. Version 5.8.
Matrix-based Inductive Theorem Proving - Kreitz, Pientka (2000) (1 citation) (Correct)
....discussing several inductive proofs for the integer square root problem. 1 Introduction Formal methods have become increasingly important for the verification and synthesis of software for safety critical applications. Over the past years, a number of proof assistants such as NuPRL [12] or Coq [13] have been developed to support the logical reasoning process involved in these methods. But they su#er from the low degree of automation, which is due to their expressive underlying calculi. It is therefore desirable to extend the reasoning power of proof assistants by integrating well understood ....
G. Dowek et. al. The Coq proof assistant user's guide. Institut National de Recherche en Informatique et en Automatique, Report RR 134, 1991.
Tradeoffs in the Intensional Representation of Lambda Terms - Liang, Nadathur (Correct)
....implementation of programming languages and systems in which it is necessary to examine the structures of such terms during execution. The best known uses of of this kind of lambda terms appears within higher order metalanguages [16, 21] logical frameworks [9, 19] and proof development systems [5, 7, 20]. Within these systems and formalisms, the terms of a chosen lambda calculus are used as data structures, with abstraction in these terms being used to encode binding notions in objects such as formulas, programs and proofs, and the attendant reduction operation capturing important substitution ....
G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. PaulinMohring, and B. Werner. The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France, 1993.
Formal Verification of Processes - Schöpp (2001) (Correct)
....procedure. It is therefore of interest to develop proof tactics and and heuristics to aid the proof process. With the goal of a partial automatisation of the verification process, one is interested in implementing the proof system. General purpose theorem provers such as Isabelle [34] Coq [16] or PVS [36] are specifically made for formulating different logics. They provide a framework for dealing with common problems in the implementation of proof systems, and they facilitate tasks such as automation or user interaction. Unfortunately, none of these theorem provers provides support for ....
Gilles Dowek, Amy Felty, Hugo Herbelin, Gerard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq proof assistant user's guide. Technical Report 154, INRIA, Rocquencourt, France, 1993.
The Semantics of Constraint Addition in Non-Linear Planning - Fox, Long (1997) (Correct)
....concerned with formalising the modal system that underpins constraint addition in Chapman s non linear planning theory. The motivation is to provide a full formalisation of the theory that would render it amenable to formal theorem proving using an automated proof assistant such as Lego [7] or Coq [2]. Work is in progress using Lego to assist in the reconstruction and verification of Chapman s proofs with the intention of extending the resulting non linear planning theory to include the abstraction mechanism exploited by AbNLP [3] An axiomatisation of the constraint posting mechanism is ....
G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthey, C. Parent, C. Paulin-Mohring, and B. Werner. The coq proof assistant user's guide. Technical report, INRIA, 1993.
A Nice and Accurate Checker for the Mathematical Language Automath - Wiedijk (1997) (Correct)
....3 However, in the field of proof checking there are quite a number of projects that have descended from or at least are closely related to Automath, the socalled type theoretical proof checkers. Some of them are still being actively worked on: there are the Coq project at INRIA in France [DFHHMPPW93], the Lego system of Randi Pollack in Edinburgh [LP92] and the Alf Half CHalf project in Gteborg [S96] There are quite a number of other systems that were designed for the verification of mathematical proofs: for instance there are the Boyer Moore theorem prover 4 [BM88] 1. Although it is not ....
Gilles Dowek, Amy Felty, Hugo Herbelin, Grard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, Benjamin Werner, The Coq Proof Assistant User's guide, Version 5.8. Projet Formel, INRIA, Rocquencourt, Lyon,1993.
A Comparison of Formalizations of the Meta-Theory of a.. - Momigliano, Ambler.. (2001) (6 citations) (Correct)
....weak HOAS in Section 3 requires two additional axioms and would have a slighly higher cost. We have carried out our study with Isabelle and Isabelle HOL because they are systems which seem to o er most automation, but many of our observations may apply to other tactics based systems such as Coq [8]. A direct comparison with a system such as Twelf [28] is complicated by the fact the latter is not biased towards interactive theorem proving. The paper is organized as follows. In section 2 we report on de Bruijn formalizations in Isabelle HOL. In Section 3 we move to weak HOAS, by following ....
G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, and B. Werner. The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France, 1993. Version 5.8.
A Certified Compiler for an Imperative Language - Bertot (1998) (4 citations) (Correct)
....language corresponding to the basic kernel common to all imperative languages and the target language is an assembly language with a goto statement that also corresponds to a very basic subset of most machine languages for micro processors. The proof has been veried using the Coq proof assistant [17] and its graphical interface CtCoq [3] The main complications in this work come from the lack of structure in the assembly language used as the target language. The contributions of this work provide ways to recover the missing structure, rst by making it possible to reason independently on ....
.... program fragments, even though the presence of goto statements hinders this kind of independence, and second by proposing techniques for proof by induction that are more powerful than those normally provided by inductive tools, as embodied in inductive packages [11, 24, 28] or proof systems [17, 20, 21]. In the rest of this section we give an overview of inductive type theory that will serve as the language for all the reasoning described in this paper, we describe more precisely the languages addressed by this experiment, we detail the main contributions of this paper, and we study how they ....
[Article contains additional citation context not shown here]
Gilles Dowek, Amy Felty, Hugo Herbelin, G#rard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq Proof Assistant User's Guide. INRIA, May 1993. Version 5.8.
A Schema for Adding Dependent Types to ML - Xi, Pfenning (Correct)
No context found.
Dowek, G., Felty, A., Herbelin, H., Huet, G., Murthy, C., Parent, C., Paulin-Mohring, C., and Werner, B. The Coq Proof Assistant User's Guide. Rapport Techniques, no. 154, INRIA, Rocquencourt, France, 1993. Version 5.8.
A Schema for Adding Dependent Types to ML - Hongwei Xi Department (Correct)
No context found.
Dowek, G., Felty, A., Herbelin, H., Huet, G., Murthy, C., Parent, C., Paulin-Mohring, C., and Werner, B. The Coq Proof Assistant User's Guide. Rapport Techniques, no. 154, INRIA, Rocquencourt, France, 1993. Version 5.8.
Dependent Types in Practical Programming (Extended Abstract) - Xi, Pfenning (1999) (Correct)
No context found.
Dowek, G., A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, and B. Werner (1993). The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France. Version 5.8.
Higher-Order Rewriting with Dependent Types - Virga (1999) (24 citations) (Correct)
No context found.
Gilles Dowek, Amy Felty, Hugo Herbelin, G'erard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France, 1993. Version 5.8.
Proof Optimization Using Lemma Extraction - Rahul George Necula (Correct)
No context found.
Dowek, G., Felty, A., Herbelin, H., Huet, G. P., Murthy, C., Parent, C., Paulin-Mohring, C., and Werner, B. The Coq proof assistant user's guide. Version 5.8. Tech. rep., INRIA { Rocquencourt, May 1993.
Bigloo: A Portable and Optimizing Compiler for Strict.. - Serrano, Weis (1995) (20 citations) (Correct)
No context found.
G. Dowek, A. Felty, H. Herbelin, and G. Huet. The COQ proof assistant user's guide. Technical Report 154, Inria-Rocquencourt, France, 1993.
Notions Of Dependency In Proof Assistants - Pons, Bertot, Rideau (1998) (Correct)
No context found.
Gilles Dowek, Amy Felty, Hugo Herbelin, G#rard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq Proof Assistant User's Guide. INRIA, May 1993. Version 5.8.
Algebraic Process Verification - Groote, Reniers (5 citations) (Correct)
No context found.
G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. PaulinMohring, and B. werner. The Coq proof assistant user's guide, version 5.9. Technical report, INRIA-Rocquencourt and CNRS-ENS Lyon, 1993.
Tool Support for Logics of Programs - Paulson (2002) (Correct)
No context found.
Gilles Dowek et al. The Coq proof assistant user's guide. Technical Report 154, INRIA-Rocquencourt, 1993. Version 5.8.
Reasoning About Logic Programs Using Definitions And Induction - Wajs (2002) (2 citations) (Correct)
No context found.
Gilles Dowek, Amy Felty, G'erard Huet Hugo Herbelin, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq proof assistant user's guide. Technical report, INRIA, Rocquencourt, France, 1993.
Facilitating Program Verification with Dependent Types - Xi (Correct)
No context found.
G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, and B. Werner. The Coq proof assistant user's guide. Rapport Technique 154, INRIA, Rocquencourt, France, 1993. Version 5.8.
Extending the Reach of Proof Planning by - Randomization And Restart (Correct)
No context found.
G. Dowek, A. Felty, H. Herbelin, G Huet, C. Paulin, and B. Werner. The Coq proof assistant user's guide, version 5.6. Technical Report Technical Report 134, INRIA, France, 1991.
Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001) (Correct)
No context found.
Gilles Dowek, Amy Felty, Hugo Herbelin, Gerard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq proof assistant user's guide. Technical Report 154, INRIA, Rocquencourt, France, 1993.
Formal Description and Analysis of a Bounded . . . - Mateescu (Correct)
No context found.
G. Dowek, A. Felty, H. Herbelin, G. P. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, and B. Werner. The Coq proof assistant user's guide. Version 5.8. Technical Report, INRIA -- Rocquencourt, Rocquencourt, May 1993.
Towards Proof Planning for ... - Schürmann, Autexier (2002) (Correct)
No context found.
Gilles Dowek, Amy Felty, Hugo Herbelin, Gerard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France, 1993. Version 5.8. 20
Some Lambda Calculus and Type Theory Formalized - McKinna, Pollack (1997) (15 citations) (Correct)
No context found.
Dowek, Felty, Herbelin, Huet, Murthy, Parent, Paulin-Mohring, and Werner. The Coq proof assistant user's guide, version 5.8. Technical report, INRIA-Rocquencourt, February 1993.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC