A unification algorithm for Coq featuring universe polymorphism and overloading - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

A unification algorithm for Coq featuring universe polymorphism and overloading

Résumé

Unification is a core component of every proof assistant or programming language featuring dependent types. In many cases, it must deal with higher-order problems up to conversion. Since unification in such conditions is undecidable, unification algorithms may include several heuristics to solve common problems. However, when the stack of heuristics grows large, the result and complexity of the algorithm can become unpredictable. Our contributions are twofold: (1) We present a full description of a new unification algorithm for the Calculus of Inductive Constructions (the base logic of Coq), including universe polymorphism, canonical structures (the overloading mechanism baked into Coq's unification), and a small set of useful heuristics. (2) We implemented our algorithm, and tested it on several libraries, providing evidence that the selected set of heuristics suffices for large developments.
Fichier non déposé

Dates et versions

hal-01248804 , version 1 (28-12-2015)

Identifiants

Citer

Beta Ziliani, Matthieu Sozeau. A unification algorithm for Coq featuring universe polymorphism and overloading. 20th ACM SIGPLAN International Conference on Functional Programming, Sep 2015, Vancouver, Canada. ⟨10.1145/2784731.2784751⟩. ⟨hal-01248804⟩
83 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More