Canonical Structures for the working Coq user - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2013

Canonical Structures for the working Coq user

Abstract

This paper provides a gentle introduction to the art of programming type inference with the mechanism of Canonical Structures. Programmable type inference has been one of the key ingredients for the successful formalization of the Odd Order Theorem using the Coq proof assistant. The paper concludes comparing the language of Canonical Structures to the one of Type Classes and Unification Hints.
Fichier principal
Vignette du fichier
main.pdf (184.73 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00816703 , version 1 (22-04-2013)
hal-00816703 , version 2 (29-04-2013)

Identifiers

Cite

Assia Mahboubi, Enrico Tassi. Canonical Structures for the working Coq user. ITP 2013, 4th Conference on Interactive Theorem Proving, Jul 2013, Rennes, France. pp.19-34, ⟨10.1007/978-3-642-39634-2_5⟩. ⟨hal-00816703v2⟩

Collections

INRIA INRIA2 ANR
1860 View
5426 Download

Altmetric

Share

More