Skip to Main content Skip to Navigation
Conference papers

Towards typed repositories of proofs

Matthias Puech 1 Yann Régis-Gianas 2, 3, * 
* Corresponding author
3 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
Abstract : In this paper, we advocate for an architecture for proof assistants and programming language tools that is closer to the daily workflow of their users. Indeed, most of the mathematician or programmer's time is spent editing, not writing. As a consequence, the usual interaction loop "(edit; compile)*; commit" is an over-approximation that does not scale when compilation is replaced by proof-checking. We propose an enhancement and an adaptation of version control paradigms to the management of proof repositories, to witness with more precision the impact of changes. We sketch a dependently typed language that would be a kernel language to build such a framework upon.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Yann Regis-Gianas Connect in order to contact the contributor
Submitted on : Wednesday, October 13, 2010 - 8:52:51 AM
Last modification on : Friday, January 21, 2022 - 3:21:36 AM
Long-term archiving on: : Thursday, October 25, 2012 - 5:10:32 PM


Files produced by the author(s)


  • HAL Id : inria-00525874, version 1



Matthias Puech, Yann Régis-Gianas. Towards typed repositories of proofs. Mathematically Intelligent Proof Search - MIPS 2010, Jul 2010, Paris, France. ⟨inria-00525874⟩



Record views


Files downloads