A Deterministic Lazy Conditional Narrowing Calculus
نویسنده
چکیده
(We show the completeness of a deterministic lazy conditional narrowing calculus with leftmost selection for the class of eft-linear fresh deterministic constructorbased conditional rewrite systems. This class of rewrite systems permits extra variables in the right-hand sides and conditions of its rewrite rules. This result is relevant for the designers of suitable computational models for functional logic programming, where the reduction of search space for solutions of systems of equations in theories presented by conditional rewrite systems is of paramount importance. AMS Subject Classification: 68T15, 68T20.
منابع مشابه
Complete Selection Functions for a Lazy Conditional Narrowing Calculus
In this paper we extend the lazy narrowing calculus lnc of Middeldorp, Okui, and Ida [26] to conditional rewrite systems. The resulting lazy conditional narrowing calculus lcnc is highly non-deterministic. We investigate for which classes of conditional rewrite systems the completeness of lcnc is ensured. In order to improve the efficiency of the calculus, we pay special attention to the remova...
متن کاملStrong Completeness of a Lazy Conditional Narrowing Calculus
In this paper we extend the lazy narrowing calculus of Middeldorp, Okui, and Ida 13] to conditional rewrite systems. We show that our calculus is strongly complete whenever basic conditional narrowing is complete. This generalizes one of the three main results of 13] to the conditional case. As a corollary we obtain the strong completeness for three classes of conditional rewrite systems, one o...
متن کاملA Rewriting Logic for Declarative Programming
Abst rac t . We propose an approach to declarative programming which integrates the functional and relational paradigms by taking possibly non-deterministic lazy functions as the fundamental notion. Programs in our paradigm are theories in a constructor-based conditional rewriting logic. We present proof calculi and a model theory for this logic, and we prove the existence of free term models w...
متن کاملA Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees
We generalize the Constructor-based ReWriting Logic CRWL to the setting of the simply typed λ-calculus, where theories are presented by conditional overlapping fully extended pattern rewrite systems. We claim that this logic is useful for higher-order functional-logic programming, and propose a Higher-Order Lazy Narrowing calculus HOLNDT for answering joinability and reducibility queries, in wh...
متن کاملA Deterministic Lazy Narrowing Calculus
In this paper we study the non-determinism between the inference rules of the lazy narrowing calculus lnc (Middeldorp et al., 1996). We show that all non-determinism can be removed without losing the important completeness property by restricting the underlying term rewriting systems to left-linear confluent constructor systems and interpreting equality as strict equality. For the subclass of o...
متن کامل