# ELPI: Fast, Embeddable, \lambda Prolog Interpreter

@inproceedings{Dunchev2015ELPIFE,
}
We present a new interpreter for $$\lambda$$Prolog that runs consistently faster than the byte code compiled by Teyjus, that is considered the best available implementation of $$\lambda$$Prolog. The key insight is the identification of a fragment of the language, which we call reduction-free fragment $$\mathcal {L}_\lambda ^\beta$$, that occurs quite naturally in $$\lambda$$Prolog programs and that admits constant time reduction and unification rules.