Non-Determinism and Lazy Evaluation in Logic Programming. In: Clement, T.P., Lau, KK. (eds) Logic Program Synthesis and Transformation. Workshops in ...
People also ask
What is lazy evaluation in programming?
What is the difference between non strict and lazy evaluation?
What is lazy evaluation of function?
What is the difference between lazy evaluation and eager evaluation?
We propose a transformation of term rewriting systems in logic programs. The systems we consider may be non-confluent and/or non-terminating. The.
A transformation of term rewriting systems in logic programs based on a generalization of the concept of definitional trees is proposed, which addresses the ...
For instance, sharing the results of non-strict evaluation—known as call-by-need or lazy evaluation—ensures that each expression is evaluated at most once. This ...
It is possible to combine lazy evaluation with nondeterminism and simulate coroutining. It is also possible to handle infinite data structures and implement ...
We present a practical way to write purely functional lazy non-deterministic programs that are efficient and perspicuous. We achieve this goal by embedding the ...
Abstract: A method for bringing the concept of lazy evaluation to logic programming in a rigorous yet efficient manner is presented.
We describe a technique for defining functions in PROLOG that directly yields lazy evaluation. Rather than modifying the interpreter, we modify the programming.
Lazy evaluation and sharing are two of the most impor- tant issues in implementations of lazy functional languages. However they are either inadequately.
We present a practical way to write purely functional lazy non-deterministic programs that are efficient and perspicuous. ... Copyrightc 2009 ACM. Original ...