Section: New Results

ELPI, Fast, Embeddable, $\lambda$-Prolog Interpreter

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

We developed a new interpreter that runs consistently faster than the other available implementations of $\lambda$-prolog. The key insight is the identification of a fragment of the language, which we call reduction-free fragment, that occurs quite naturally and that admits constant time reduction and unification rules. In the long run, we hope that this will contribute to developing elaborators that support a more efficient and adaptable usage of interactive proof tools. This work is published in [14] .