ELPI : fast , Embeddable , λ Prolog Interpreter

@inproceedings{Dunchev2016ELPIF,
  title={ELPI : fast , Embeddable , λ Prolog Interpreter},
  author={Cvetan Dunchev and Ferruccio Guidi and Claudio Sacerdoti Coen and Enrico Tassi},
  year={2016}
}
We present a new interpreter for λProlog that runs consistently faster than the byte code compiled by Teyjus, that is believed to be the best available implementation of λProlog. The key insight is the identification of a fragment of the language, which we call reduction-free fragment (Lβλ), that occurs quite naturally in λProlog programs and that admits constant time reduction and unification rules. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

A Verified Translation of Landau’s Grundlagen” from Automath into a Pure Type System, via λδ

F. Guidi
2015
View 1 Excerpt

The formal system lambdadelta

ACM Trans. Comput. Log. • 2009
View 1 Excerpt

Lambda-Prolog de A a Z... ou presque

O. Ridoux
Habilitation à diriger des recherches, Université de Rennes • 1998
View 1 Excerpt

Similar Papers

Loading similar papers…