Corpus ID: 27382990

ELPI: fast, Embeddable, λProlog Interpreter

@inproceedings{Dunchev2015ELPIFE,
  title={ELPI: fast, Embeddable, $\lambda$Prolog Interpreter},
  author={Cvetan Dunchev and F. Guidi and C. Coen and E. Tassi},
  year={2015}
}
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. 
Functional programming with λ-tree syntax : Draft
A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading*
Implementing type theory in higher order constraint logic programming
Mechanized Metatheory Revisited
  • Dale Miller
  • Computer Science
  • Journal of Automated Reasoning
  • 2018
MutantChick: Type-Preserving Mutation Analysis for Coq
...
1
2
3
...

References

SHOWING 1-10 OF 14 REFERENCES
System description : Teyjus : A compiler and abstract machine based implementation of λprolog
The formal system λΔ
  • F. Guidi
  • Mathematics, Computer Science
  • TOCL
  • 2009
Hints in Unification
First-Class Type Classes
Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
Programming with Higher-Order Logic
How to make ad hoc proof automation less ad hoc
...
1
2
...