Towards a better-behaved unification algorithm for Coq

Beta Ziliani 1 Matthieu Sozeau 2
2 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 : The unification algorithm is at the heart of a proof assistant like Coq. In particular, it is a key component in the refiner (the algorithm who has to fill implicit terms and missing type annotations), and the application of lemmas. Despite of being so important, however, the current unification algorithm of Coq is not properly documented, and implements certain heuristics that makes unification unpredictable and hard to understand. In this work we discuss some of the problems with the current algorithm and present a new one, built from scratch, which aims at solving these issues. The new algorithm is properly documented, putting us on better grounds for a formally verified and optimized algorithm.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Matthieu Sozeau <>
Submitted on : Thursday, January 29, 2015 - 5:57:01 PM
Last modification on : Friday, January 4, 2019 - 5:33:25 PM


  • HAL Id : hal-01111193, version 1



Beta Ziliani, Matthieu Sozeau. Towards a better-behaved unification algorithm for Coq . UNIF 2014 Workshop, Jul 2014, Vienna, Austria. pp 74--87. ⟨hal-01111193⟩



Record views