THE EXECUTION ALGORITHM OF MERCURY, AN EFFICIENT PURELY DECLARATIVE LOGIC PROGRAMMING LANGUAGE

Citation
Z. Somogyi et al., THE EXECUTION ALGORITHM OF MERCURY, AN EFFICIENT PURELY DECLARATIVE LOGIC PROGRAMMING LANGUAGE, The journal of logic programming, 29(1-3), 1996, pp. 17-64
Citations number
36
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Theory & Methods
ISSN journal
07431066
Volume
29
Issue
1-3
Year of publication
1996
Pages
17 - 64
Database
ISI
SICI code
0743-1066(1996)29:1-3<17:TEAOMA>2.0.ZU;2-C
Abstract
We introduce Mercury, a new purely declarative logic programming langu age designed to provide the support that groups of application program mers need when building large programs. Mercury's strong type, mode, a nd determinism systems improve program reliability by catching many er rors at compile time. We present a new and relatively simple execution model that takes advantage of the information these systems provide, yielding very efficient code. The Mercury compiler uses this execution model to generate portable C code. Our benchmarking shows that the co de generated by our implementation is significantly faster than the co de generated by mature optimizing implementations of other logic progr amming languages.