Published November 24, 2015 | Version v1
Conference paper Metadata-only

ELPI: fast, Embeddable, λProlog Interpreter

Dunchev, Cvetan
Guidi, Ferruccio
Sacerdoti Coen, Claudio
Tassi, Enrico
Others:
Department of Computer Science and Engineering [Bologna] (DISI) ; Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO)
Mathematical, Reasoning and Software (MARELLE) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Description

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.

Abstract

International audience

Additional details

Identifiers Origin repository
Created:
March 25, 2023
Modified:
November 30, 2023