The integration of functions into logic programming: From theory to practice

Hanus, Michael

doi:10.1016/0743-1066(94)90034-5

Cited by 325 publications

(202 citation statements)

References 25 publications

Supporting

Mentioning

184

Contrasting

Unclassified

Order By: Relevance

“…the head g(s(0)) of the rule (2)). The case (c) is handled by the magic rules for the outermost functions since the condition of the rules for the inner functions will appear as condition of these magic rules (see rule (8)). This failure generates mg (mg f N (0), s(0)) {F} by 4t denotes the set {t ∈ CTerm ⊥,F | t and t have a DC ∪ {F}-clash}.…”

Section: Model Of P (In Symbols H |= P) Iff H Satisfies All the Rulementioning

confidence: 99%

“…By joining the SAS's C R,t , we obtain the final SAS for f (e 1 , ..., e n ). Rules (5) to (8) consider all the possible ways in which a rule R can be used to produce a SAS for a call f (t) where t i ∈ CTerm ⊥,F . Rule (5) is the trivial case.…”

Section: Definition 1 (Relations Over Cterm ⊥F )mentioning

confidence: 99%

“…It has led to the recent design of modern programming languages such as CURRY [9] and T OY [13]. The basic ideas in functional-logic programming consist in lazy narrowing as operational mechanism, following some class of narrowing strategy combined with some kind of constraint solving and higher order features, see [8] for a survey.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Computational Model for Functional Logic Deductive Databases

2001

View full text Add to dashboard Cite

Abstract. This paper adds the handling of negative information to a functional-logic deductive database language. By adopting as semantics for negation the so-called CRWLF, wherein the negation is intended as 'finite failure' of reduction, we will define Herbrand algebras and models for this semantics and a fix point operator to be used in a new goaldirected bottom-up evaluation mechanism based on magic transformations. This bottom-up evaluation will simulate the top-down one of the original program; in fact, it will carry out a goal-directed lazy evaluation.

show abstract

Section: Model Of P (In Symbols H |= P) Iff H Satisfies All the Rulementioning

confidence: 99%

Section: Definition 1 (Relations Over Cterm ⊥F )mentioning

confidence: 99%

See 1 more Smart Citation

A Computational Model for Functional Logic Deductive Databases

2001

View full text Add to dashboard Cite

show abstract

“…Functional logic computations generalize functional computations by adding three specific features: non-determinism, narrowing and residuation (see [12] for a survey). Our machine is not designed for a specific programming language.…”

Section: Functional Logic Computationsmentioning

confidence: 99%

A Virtual Machine for Functional Logic Computations

Antoy

Hanus

Liu

et al. 2005

Implementation and Application of Functional Languages

Self Cite

View full text Add to dashboard Cite

Abstract.We describe the architecture of a virtual machine for executing functional logic programming languages. A distinguishing feature of our machine is that it preserves the operational completeness of non-deterministic programs by concurrently executing a pool of independent computations. Each computation executes only root-needed sequential narrowing steps. We describe the machine's architecture and instruction set, and show how to compile overlapping inductively sequential programs to sequences of machine instructions. The machine has been implemented in Java and in Standard ML.

show abstract

“…Functional logic programming integrates in a single programming model the most important features of functional and logic programming (see [18] for a detailed survey). Thus, functional logic languages provide pattern matching in the definition of functions and predicates as well as the use of logical variables in expressions.…”

Section: Functional Logic Programming and Currymentioning

confidence: 99%

Functional Logic Design Patterns

Antoy

Hanus

2002

Functional and Logic Programming

Self Cite

View full text Add to dashboard Cite

Abstract. We introduce a handful of software design patterns for functional logic languages. Following usual approaches, for each pattern we propose a name and we describe its intent, applicability, structure, consequences, etc. Our patterns deal with data type construction, identifier declarations, mappings, search, nondeterminism and other fundamental aspects of the design and implementation of programs. We present some problems and we show fragments of programs that solve these problems using our patterns. The programming language of our examples is Curry. The complete programs are available on-line.

show abstract

The integration of functions into logic programming: From theory to practice

Cited by 325 publications

References 25 publications

A Computational Model for Functional Logic Deductive Databases

A Computational Model for Functional Logic Deductive Databases

A Virtual Machine for Functional Logic Computations

Functional Logic Design Patterns

Contact Info

Product

Resources

About