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.

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.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
460
468
Dunchev, Tsvetan Chavdarov; Guidi, Ferruccio; Sacerdoti Coen, Claudio; Tassi, Enrico
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11585/552429
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 23
  • ???jsp.display-item.citation.isi??? 9
social impact