We present a new interpreter for λProlog that runs consistently faster than the byte code compiled by Teyjus, that is considered 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.
Dunchev, T.C., Guidi, F., Sacerdoti Coen, C., Tassi, E. (2015). ELPI: Fast, embeddable, λprolog interpreter. Springer Verlag [10.1007/978-3-662-48899-7_32].
ELPI: Fast, embeddable, λprolog interpreter
DUNCHEV, TSVETAN CHAVDAROV;GUIDI, FERRUCCIO;SACERDOTI COEN, CLAUDIO;
2015
Abstract
We present a new interpreter for λProlog that runs consistently faster than the byte code compiled by Teyjus, that is considered 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.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
