On Compiling Linear Logic Programs with Comprehensions, Aggregates and Rule Priorities

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2015

Autores

Flavio Cruz (Autor) Outra; Ricardo Rocha (Autor) FCUP

Ata de Conferência Internacional

Título: PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, PADL 2015

Páginas: 34-49

17th International Symposium on Practical Aspects of Declarative Languages (PADL)

Portland, OR, JUN 18-19, 2015

Indexação

ISI Web of Knowledge - 1 Citação

Scopus - 1 Citação

Classificação Científica

FOS: Ciências exactas e naturais > Ciências da computação e da informação

Outras Informações

ID Authenticus: P-00G-6HH

DOI: 10.1007/978-3-319-19686-2_3

Abstract (EN): Linear logic programs are challenging to implement efficiently because facts are asserted and retracted frequently. Implementation is made more difficult with the introduction of useful features such as rule priorities, which are used to specify the order of rule inference, and comprehensions or aggregates, which are mechanisms that make data iteration and gathering more intuitive. In this paper, we describe a compilation scheme for transforming linear logic programs enhanced with those features into efficient C++ code. Our experimental results show that compiled logic programs are less than one order of magnitude slower than hand-written C programs and much faster than interpreted languages such as Python.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 16