Section: New Results

Extension language for Coq

Participants : Enrico Tassi, Feruccio Guidi [University of Bologna] , Claudio Sacerdoti Coen [University of Bologna] .

We continued our work on the design of a language mixing $\lambda$-prolog and constraint programming. This year, we redesigned and provided a new implementation of the constraint handling rules, leading to a first public release of the software. We are starting to have users beyond our own team:

• (Inria/Parsifal) MLTS https://github.com/voodoos/mlts

• (Inria/Parsifal) proofcert https://github.com/proofcert/checkers

• (UML.eu) Lang-n-play https://github.com/mcimini/lang-n-play

In an article submitted for publication [24], we showed that Elpi could be used to give a short implementation of Type Theory.

We are also starting a collaboration to construct an elaborator for HOL-Light using Elpi.