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

• Type: Article in International Conference Proceedings Book
• Date: 2015

Authors

Flavio Cruz (Author) Other; Ricardo Rocha (Author) FCUP

Conference proceedings International

Title: PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, PADL 2015

Pages: 34-49

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

Portland, OR, JUN 18-19, 2015

Indexing

ISI Web of Knowledge - 1 Citation

Scopus - 1 Citation

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 16