ELPI: fast, Embeddable, λProlog Interpreter
Abstract
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.
| Origin | Files produced by the author(s) |
|---|
Loading...