Crafting a proof assistant

Authors:
Andrea Asperti;Claudio Sacerdoti Coen;Enrico Tassi;Stefano Zacchiroli
Affiliations:
Department of Computer Science, University of Bologna, Bologna, Italy;Department of Computer Science, University of Bologna, Bologna, Italy;Department of Computer Science, University of Bologna, Bologna, Italy;Department of Computer Science, University of Bologna, Bologna, Italy
Venue:
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Year:
2006

Citing 7
Cited 4

The ALF proof editor and its proof engine

TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Proof by Pointing

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Mizar Mode for HOL

TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Implicit Coercions in Type Systems

TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Open Proofs and Open Terms: A Basis for Interactive Logic

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
From notation to semantics: there and back again

MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
A content based mathematical search engine: whelp

TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs

Coercive Subtyping via Mappings of Reduction Behaviour

Electronic Notes in Theoretical Computer Science (ENTCS)
An Interactive Driver for Goal-directed Proof Strategies

Electronic Notes in Theoretical Computer Science (ENTCS)
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms

Information and Computation
A scalable module system

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proof assistants are complex applications whose development has never been properly systematized or documented. This work is a contribution in this direction, based on our experience with the development of Matita: a new interactive theorem prover based--as Coq--on the Calculus of Inductive Constructions (CIC). In particular, we analyze its architecture focusing on the dependencies of its components, how they implement the main functionalities, and their degree of reusability. The work is a first attempt to provide a ground for a more direct comparison between different systems and to highlight the common functionalities, not only in view of reusability but also to encourage a more systematic comparison of different softwares and architectural solutions.