Results 1 
9 of
9
CCoRN, the Constructive Coq Repository at Nijmegan
"... We present CCoRN, the Constructive Coq Repository at Nijmegen. It consists of a library of constructive algebra and analysis, formalized in the theorem prover Coq. In this paper we explain the structure, the contents and the use of the library. Moreover we discuss the motivation and the (possible) ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
We present CCoRN, the Constructive Coq Repository at Nijmegen. It consists of a library of constructive algebra and analysis, formalized in the theorem prover Coq. In this paper we explain the structure, the contents and the use of the library. Moreover we discuss the motivation and the (possible) applications of such a library.
The algebraic hierarchy of the FTA Project
 Journal of Symbolic Computation, Special Issue on the Integration of Automated Reasoning and Computer Algebra Systems
, 2002
"... Abstract. We describe a framework for algebraic expressions for the proof assistant Coq. This framework has been developed as part of the FTA project in Nijmegen, in which a complete proof of the fundamental theorem of algebra has been formalized in Coq. The algebraic framework that is described her ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
Abstract. We describe a framework for algebraic expressions for the proof assistant Coq. This framework has been developed as part of the FTA project in Nijmegen, in which a complete proof of the fundamental theorem of algebra has been formalized in Coq. The algebraic framework that is described here is both abstract and structured. We apply a combination of record types, coercive subtyping and implicit arguments. The algebraic framework contains a full development of the real and complex numbers and of the rings of polynomials over these fields. The framework is constructive. It does not use anything apart from the Coq logic. The framework has been successfully used to formalize nontrivial mathematics as part of the FTA project.
A Constructive Algebraic Hierarchy in Coq
"... We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof of the Fundamental Theorem of Algebra has been formalized in Coq. The algebraic hierarchy that is described here is both ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof of the Fundamental Theorem of Algebra has been formalized in Coq. The algebraic hierarchy that is described here is both abstract and way, dening e.g. a ring as a tuple consisting of a group, a binary operation and a constant that together satisfy the properties of a ring. In this way, a ring automatically inherits the group properties of the additive subgroup. The algebraic hierarchy is formalized in Coq by applying a combination of labeled record types and coercions. In the labeled record types of Coq, one can use dependent types: the type of one label may depend on another label. This allows to give a type to a dependenttyped tuple like hA; f; ai, where A is a set, f an operation on A and a an element of A. Coercions are
A Constructive Formalization of the Fundamental Theorem of Calculus
"... We have finished a constructive formalization in the theorem prover Coq of the Fundamental Theorem of Calculus, which states that differentiation and integration are inverse processes. In this formalization, we have closely followed Bishop's work ([4]). In this paper, we describe the formalization i ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We have finished a constructive formalization in the theorem prover Coq of the Fundamental Theorem of Calculus, which states that differentiation and integration are inverse processes. In this formalization, we have closely followed Bishop's work ([4]). In this paper, we describe the formalization in some detail, focusing on how some of Bishop's original proofs had to be refined, adapted or redone from scratch.
Estimating the Cost of a Standard Library for a Mathematical Proof Checker. http://www.cs.kun.nl/~freek/notes
"... Abstract. We estimate the cost of formalizing a proper standard library for proof checking of mathematics in the spirit of the QED project. Apparently it will take approximately 140 manyears. This estimate does not include the development of the proof checking program, nor does it include work on t ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. We estimate the cost of formalizing a proper standard library for proof checking of mathematics in the spirit of the QED project. Apparently it will take approximately 140 manyears. This estimate does not include the development of the proof checking program, nor does it include work on the metatheory of that program. This should discourage any individual or small research group to think they can reach anything like the goal of the QED project on their own.
Changing Data Structures in Type Theory: a study of natural numbers
 Types for Proofs and Programs, Intl. Workshop (TYPES 2000), LNCS 2277
, 2000
"... In typetheory based proof systems that provide inductive structures, computation tools are automatically associated to inductive de nitions. Choosing a particular representation for a given concept has a strong inuence on proof structure. We propose a method to make the change from one represe ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In typetheory based proof systems that provide inductive structures, computation tools are automatically associated to inductive de nitions. Choosing a particular representation for a given concept has a strong inuence on proof structure. We propose a method to make the change from one representation to another easier, by systematically translating proofs from one context to another. We show how this method works by using it on natural numbers, for which a unary representation (based on Peano axioms) and a binary representation are available. This method leads to an automatic translation tool that we have implemented in Coq and successfully applied to several arithmetical theorems.
Hierarchical Reflection
"... Abstract. The technique of reflection is a way to automate proof construction in type theoretical proof assistants. Reflection is based on the definition of a type of syntactic expressions that gets interpreted in the domain of discourse. By allowing the interpretation function to be partial or even ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. The technique of reflection is a way to automate proof construction in type theoretical proof assistants. Reflection is based on the definition of a type of syntactic expressions that gets interpreted in the domain of discourse. By allowing the interpretation function to be partial or even a relation one gets a more general method known as ``partial reflection''. In this paper we show how one can take advantage of the partiality of the interpretation to uniformly define a family of tactics for equational reasoning that will work in different algebraic structures. The tactics then follow the hierarchy of those algebraic structures in a natural way.
First Order Logic With Domain Conditions
 in `Theorem Proving in Higher Order Logics, TPHOLs 2003', Vol. 2758 of LNCS
, 2001
"... The correctness of proofs is increasingly being veried with computer programs called `proof checkers'. Examples of such proof checkers are Mizar, ACL2, PVS, Nuprl, HOL, Isabelle and Coq. This paper addresses what is one of the most important problems for that kind of system, which is how to deal wit ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The correctness of proofs is increasingly being veried with computer programs called `proof checkers'. Examples of such proof checkers are Mizar, ACL2, PVS, Nuprl, HOL, Isabelle and Coq. This paper addresses what is one of the most important problems for that kind of system, which is how to deal with partial functions and the related issue of how to treat undened terms. In many systems the problem is avoided by articially making all functions total. However that does not correspond to the practice of every day mathematics. In type theory partial functions are modeled by giving functions extra arguments which are proof objects. Because of that it is not possible to apply a function outside its domain. However having proofs as rst class objects makes the logic nonstandard. This has the disadvantages that it is unfamiliar to most mathematicians and that many proof tools won't be usable for it. For instance a theorem prover like Otter cannot be easily used for this kind of logic. Also expressions in type theoretical systems get clumsy because they contain proof objects. The PVS system solves the problem of partial functions dierently. PVS generates typecorrectness conditions or TCCs for statements in its language. These are proof obligations that have to be satised `on the side' to show that the statements are wellformed. In this paper we relate the type theoretical approach to one resembling the PVS approach. We add domain conditions to ordinary rst order logic (which in this paper will be classical and onesorted) and we show that the combination corresponds precisely to a rst order system that treats partial functions in the style of type theory. 1
Formalizing Real Calculus in Coq
, 2002
"... We have finished a constructive formalization in the theorem prover Coq of the Fundamental Theorem of Calculus, which states that differentiation and integration are inverse processes. This formalization is built upon the library of constructive algebra created in the FTA (Fundamental Theorem of Alg ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We have finished a constructive formalization in the theorem prover Coq of the Fundamental Theorem of Calculus, which states that differentiation and integration are inverse processes. This formalization is built upon the library of constructive algebra created in the FTA (Fundamental Theorem of Algebra) project, which is extended with results about the real numbers, namely about (power) series. Two important issues that arose in this formalization and which will be discussed in this paper are partial functions (different ways of dealing with this concept and the advantages of each different approach) and the high level tactics that were developed in parallel with the formalization (which automate several routine procedures involving results about realvalued functions).