Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Guarded horn clauses: A parallel logic programming language with the concept of a guard
Proceedings of the first Franco-Japanese Symposium on Programming of future generation computers
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
On the occur-check-free PROLOG programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Moded flat GHC and its message-oriented implementation technique
New Generation Computing
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Proving termination of input-consuming logic programs
Proceedings of the 1999 international conference on Logic programming
Communications of the ACM
Verification of Logic Programs with Delay Declarations
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Termination of Logic Programs with block Declarations Running in Several Modes
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Semantics of Input-Consuming Logic Programs
CL '00 Proceedings of the First International Conference on Computational Logic
Termination of simply moded logic programs with dynamic scheduling
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Recent logic programming languages employ dynamic scheduling of calls to improve efficiency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically ''delayed'' until their arguments are sufficiently instantiated. To this end, logic languages are extended with constructs such as delay declarations. However, many declarative properties that hold for logic and pure Prolog programs do not apply any longer in this extended setting. In particular, the equivalence between the model-theoretic and operational semantics does not hold. In this paper, we study the class of input-consuming programs. Firstly, we argue that input-consuming logic programs are suitable for modeling programs employing delay declarations. Secondly, we show that-under some syntactic restrictions-the S-semantics of a program is correct and fully abstract also for input-consuming programs. This allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one. Thus, input-consuming programs are shown to be the right answer for conjugate efficiency and declarativeness.