Hierarchy Builder: algebraic hierarchies made easy in Coq with Elpi - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Hierarchy Builder: algebraic hierarchies made easy in Coq with Elpi


It is nowadays customary to organize libraries of machine checked proofs around hierarchies of algebraic structures [2, 6, 8, 16, 18, 23, 27]. One influential example is the Mathematical Components library on top of which the long and intricate proof of the Odd Order Theorem could be fully formalized [14]. Still, building algebraic hierarchies in a proof assistant such as Coq [9] requires a lot of manual labor and often a deep expertise in the internals of the prover [13, 17]. Moreover, according to our experience [26], making a hierarchy evolve without causing breakage in client code is equally tricky: even a simple refactoring such as splitting a structure into two simpler ones is hard to get right. In this paper we describe HB, a high level language to build hierarchies of algebraic structures and to make these hierarchies evolve without breaking user code. The key concepts are the ones of factory, builder and abbreviation that let the hierarchy developer describe an actual interface for their library. Behind that interface the developer can provide appropriate code to ensure retro compatibility. We implement the HB language in the hierarchy-builder addon for the Coq system using the Elpi [11, 28] extension language.
Fichier principal
Vignette du fichier
LIPIcs-FSCD-2020-34.pdf (658.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02478907 , version 1 (14-02-2020)
hal-02478907 , version 2 (10-03-2020)
hal-02478907 , version 3 (11-03-2020)
hal-02478907 , version 4 (11-03-2020)
hal-02478907 , version 5 (06-05-2020)
hal-02478907 , version 6 (23-09-2022)



Cyril Cohen, Kazuhiko Sakaguchi, Enrico Tassi. Hierarchy Builder: algebraic hierarchies made easy in Coq with Elpi. FSCD 2020 - 5th International Conference on Formal Structures for Computation and Deduction, Jun 2020, Paris, France. pp.34:1--34:21, ⟨10.4230/LIPIcs.FSCD.2020.34⟩. ⟨hal-02478907v6⟩
1343 View
1053 Download



Gmail Facebook X LinkedIn More