ELPI: Fast, Embeddable, \lambda Prolog Interpreter

@inproceedings{Dunchev2015ELPIFE,
  title={ELPI: Fast, Embeddable, \lambda Prolog Interpreter},
  author={Tsvetan Dunchev and F. Guidi and C. Coen and E. Tassi},
  booktitle={LPAR},
  year={2015}
}
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. 
Implementing HOL in an Higher Order Logic Programming Language
Mechanized Metatheory Revisited
  • Dale Miller
  • Computer Science
  • Journal of Automated Reasoning
  • 2018
Prototyping a functional language using higher-order logic programming: a functional pearl on learning the ways of λProlog/Makam
Rapid Prototyping Formal Systems in MMT: 5 Case Studies
...
1
2
3
...

References

SHOWING 1-10 OF 14 REFERENCES
Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts
The formal system λΔ
  • F. Guidi
  • Mathematics, Computer Science
  • TOCL
  • 2009
Programming with Higher-Order Logic
How to make ad hoc proof automation less ad hoc
Hints in Unification
First-Class Type Classes
...
1
2
...