Hierarchy Builder

Abstract

Libraries of machine checked code are, nowadays, organized around hierarchies of algebraic structures. Unfortunately the language of Type Theory and the features provided by the Coq system make the construction of a hierarchy hard even for expert users. The difficulty begins with the non-orthogonal choices, between storing information as record fields or parameters, and between using type classes and canonical structures for inference. To this, one may add the concerns about performance and about the usability, by a non expert, of the final hierarchy.

HB gives the library designer a language to describe the building blocks of algebraic structures and to assemble them into a hierarchy. Similarly it provides the final user linguistic constructs to build instances (examples) of structures and to teach the elaborator of Coq how to take advantage of this knowledge during type inference. Finally HB lets the library designer improve the usability of his library by providing alternative interfaces to the primitive ones, a feature that can also be used to accommodate changes to the hierarchy without breaking user code.

This is a joint work with Kazuhiko Sakaguchi and Enrico Tassi.

Cyril Cohen

Inria permanent researcher (CR1)

I have a PhD in computer sciences, and I am currently a permanent researcher (CR1) at Inria Sophia Antipolis in the team MARELLE. I did a postdoc in the Department of Computer Science and Engineering of University of Gothenburg and Chalmers in Sweden. I used to be a PhD Student under the supervision of Assia Mahboubi at École Polytechnique (Palaiseau, France). I studied Mathematics and Computer Sciences in ENS Cachan (Cachan, France), and I’m a qualified teacher (agrégé) in Mathematics.