## Section: New Results

### Implementing Theorem Proving in Higher Order Logic Programming

Participants : Enrico Tassi, Luc Chabassier, Cyril Cohen, Cvetan Dunchev [University of Bologna] , Ferruccio Guidi [University of Bologna] , Claudio Sacerdoti Coen [University of Bologna] .

We are designing a Coq plugin named elpi providing an extension language based on $\lambda $-prolog to write new commands and tactics. This year, we re-designed the constraint handling engine of the elpi interpreter. Luc Chabassier illustrated the use of this extension on the problem of generating automatically equality test functions for arbitrary recursive types, together with their proof of correctness.

Another experiment was conducted by Cyril Cohen on using elpi to compute genericity theorems. For now the unary and binary cases have been covered in a concise fashion.

An article on this topic has been submitted to MSCS [19], a presentation will also be given at the CoqPL workshop [21].