Crafting a Proof Assistant

@inproceedings{Asperti2006CraftingAP,
  title={Crafting a Proof Assistant},
  author={A. Asperti and C. Coen and E. Tassi and Stefano Zacchiroli},
  booktitle={TYPES},
  year={2006}
}
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… Expand
Experiences from Exporting Major Proof Assistant Libraries
Interactive theorem provers: issues faced as a user and tackled as a developer
A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading*
A unification algorithm for Coq featuring universe polymorphism and overloading
User interaction widgets for interactive theorem proving
Verified programming with explicit coercions
Foundation-Independent Type Reconstruction
An Interactive Driver for Goal-directed Proof Strategies
The proof monad
...
1
2
3
4
...

References

SHOWING 1-10 OF 23 REFERENCES
Proof General: A Generic Tool for Proof Development
Tinycals: Step by Step Tacticals
A Mizar Mode for HOL
Construction and deduction in type theories
MMode, a Mizar Mode for the proof assistant Coq
A Calculus of Substitutions for Incomplete-Proof Representation in Type Theory
The ALF Proof Editor and Its Proof Engine
Coercive Subtyping
  • Z. Luo
  • Computer Science
  • J. Log. Comput.
  • 1999
...
1
2
3
...