Automatic and Transparent Transfer of Theorems along Isomorphisms in the Coq Proof Assistant

Théo Zimmermann 1, 2 Hugo Herbelin 2, 3
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 mathematics, it is common practice to have several constructions for the same objects. Mathematicians will identify them modulo isomorphism and will not worry later on which construction they use, as theorems proved for one construction will be valid for all. When working with proof assistants, it is also common to see several data-types representing the same objects. This work aims at making the use of several isomorphic constructions as simple and as transparent as it can be done informally in mathematics. This requires inferring automatically the missing proof-steps. We are designing an algorithm which finds and fills these missing proof-steps and we are implementing it as a plugin for Coq.
Liste complète des métadonnées

Cited literature [7 references]  Display  Hide  Download
Contributor : Théo Zimmermann <>
Submitted on : Thursday, July 9, 2015 - 10:58:59 AM
Last modification on : Thursday, February 7, 2019 - 3:01:17 PM
Document(s) archivé(s) le : Wednesday, April 26, 2017 - 1:36:52 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License


  • HAL Id : hal-01152588, version 4
  • ARXIV : 1505.05028



Théo Zimmermann, Hugo Herbelin. Automatic and Transparent Transfer of Theorems along Isomorphisms in the Coq Proof Assistant. Conference on Intelligent Computer Mathematics, 2015, Washington, D.C., United States. ⟨hal-01152588v4⟩



Record views


Files downloads