Canonical Structures for the working Coq user

Assia Mahboubi (1, 2) , Enrico Tassi (1, 2)

1 MSR - INRIA - Microsoft Research - Inria Joint Centre
2 SPECFUN - Symbolic Special Functions : Fast and Certified

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.

Domaines: Logique en informatique [cs.LO]

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⟩