Elementary Logic Programs

TL;DR: This paper gives a short description of the compiler and the engine, some performance data, and points out some of the reasons why BinProlog compares so well with systems based on the full WAM in terms of absolute performance.

TL;DR: This strategy allows us to derive linear recursive programs when the tupling strategy is not successful, and it can be applied in the case of functional programs thereby improving some transformation techniques proposed by Cohen (1983) and by Chin and Hagiya (1995).

TL;DR: A new language translation framework that supports modular compilation, allows programmer control of the speed versus size optimization, is fully portable, and has a performance that ranges between the performance of emulated code and that of native code.

TL;DR: TOAM Jr. as mentioned in this paper is a stack machine for Prolog, which departs from the TOAM adopted in early versions of B-Prolog in that it employs no registers for temporary data and it offers variable-size instructions for encoding unification and procedure calls.

TL;DR: The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.

TL;DR: In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated, and it is concluded that operational semantics is a part ofProof theory and that fixpoint semantic is a special case of model-theoretic semantics.

TL;DR: In this article, identical equivalences based upon functional semantics [P] and logical consequences of P allow the application of two different and powerful tools to reason about programs, in particular, these equivalences seem ideal for discussing the deductive structure of such deductive databases.