An approach to declarative programming based on a rewriting logic

Functional Logic Design Patterns

“…It is interesting to note that the determinism property of functions (i.e., there is at most one result value for fixed input arguments) is not strictly required. Actually, one can also deal with nondeterministic functions that deliver more than one result on a given input [3,15]. This comes at no cost to the implementor since non-determinism is always available in functional logic languages.…”

“…This comes at no cost to the implementor since non-determinism is always available in functional logic languages. On the other hand, the combination of demand-driven evaluation and non-deterministic functions can result in a large reduction of the search space [3,15].…”

A Computational Model for Functional Logic Deductive Databases

“…We assume the reader has familiarity with basic concepts of model theory on functional and logic programming (see [3,7] for more details), but now we point up some notions.…”

“…As in the logic paradigm, the bottom-up evaluation is based on a magic transformation for a given programquery into a magic program-query. In the cited paper, the semantics adopted for the programs is the Constructor Based ReWriting Logic (CRWL) presented in [7]. This bottom-up evaluation is based on the use of a fix point operator over CRWL-Herbrand algebras and it simulates the demand driven strategy [11] for top-down evaluation of CRWL-programs.…”

A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs

“…In our case, we will consider a functional logic language like T OY [7], that is, our programs will be conditional constructor-based rewriting rules in which no additional restrictions in the form of program rules will be required. Therefore, Horn-logic programs will be considered as particular cases of our functional-logic programs.…”