Functional Logic Programming: From Theory to Curry

Hanus, Michael

doi:10.1007/978-3-642-37651-1_6

Cited by 57 publications

(73 citation statements)

References 106 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since functional logic programs are interested on values instead of normal forms, the standard Maude equality is not useful and we need a strict equality 9 [26]. That is, an expression coin == 0 will always be evaluated to false because it requires a rule application of coin before checking for equality.…”

Section: Strict Equalitymentioning

confidence: 99%

“…The current implementation of narrowing in Maude deals only with unconditional rules but we transform conditional rules into unconditional ones using a standard technique in functional logic languages such as Curry (see [2,26] for details). Conditional means that a rule has an extra element, apart from the left-hand and right-hand sides, which contains conditions and, intuitively, these conditions must be satisfied before the rule is applied.…”

Section: Conditional Equationsmentioning

confidence: 99%

“…Third, we replace the conditional expression by a new operator ">>" with just the positive case, where we restrict reductions on the second argument using the attributes frozen (2) and strat (1 0), as in the standard Maude if-then-else-fi symbol. Again, this transformation is standard in functional logic languages such as Curry, see [2,26] where the symbol >> is also known as if-then (without an else branch). Note that Maude expects conditions to be boolean expressions but we consider here conditions to be of sort Success just because we consider only the positive cases.…”

Section: Conditional Equationsmentioning

confidence: 99%

“…A typical optimization in logic programming is to combine different goals where some of them are suspended until an instantiation is provided by another goal. This procedure is called residuation in functional logic programming languages such as Curry [26] and Escher [30] and it is easy to achieve in Maude. That is, residuation is based on the idea to delay or suspend function calls until they are ready for deterministic evaluation.…”

Section: Constraint Solving and Residuationmentioning

confidence: 99%

“…Modern concurrent constraint functional logic programming languages, such as Curry [26], combine different features of both functional and logic paradigms using an evaluation mechanism called narrowing. Narrowing is a generalization of term rewriting that allows free variables in terms (as in logic programming) and replaces pattern matching by unification in order to (non-deterministically) reduce these terms.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Functional Logic Programming in Maude

Escobar

2014

Specification, Algebra, and Software

View full text Add to dashboard Cite

Abstract. Functional logic programming languages combine the most important features of functional programming languages and logic programming languages. Functional logic programming applied to the Maude specification language would replace the functional viewpoint by an equational viewpoint while retaining the logic features. This paper tries to bridge the gap between functional logic languages and the current implementation of narrowing as symbolic reachability in Maude. It illustrates how many features available in modern functional logic languages are easily definable and simulated in Maude but also shows how Maude goes beyond standard practices in the functional logic area by using, e.g. equational properties such as associativity and commutativity or order-sorted information. As a practical application we use the Missionaries and Cannibals equational logic program given by Goguen and Meseguer for Eqlog in the eighties.

show abstract

Section: Strict Equalitymentioning

confidence: 99%

Section: Conditional Equationsmentioning

confidence: 99%

Section: Conditional Equationsmentioning

confidence: 99%

Section: Constraint Solving and Residuationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Functional Logic Programming in Maude

Escobar

2014

Specification, Algebra, and Software

View full text Add to dashboard Cite

show abstract

Improving Residuation in Declarative Programs

Hanus¹

2018

Practical Aspects of Declarative Languages

Self Cite

View full text Add to dashboard Cite

Unintended failures during a computation are painful but frequent during software development. Failures due to external reasons (e.g., missing files, no permissions) can be caught by exception handlers. Programming failures, such as calling a partially defined operation with unintended arguments, are often not caught due to the assumption that the software is correct. This paper presents an approach to verify such assumptions. For this purpose, nonfailure conditions for operations are inferred and then checked in all uses of partially defined operations. In the positive case, the absence of such failures is ensured. In the negative case, the programmer could adapt the program to handle possibly failing situations and check the program again. Our method is fully automatic and can be applied to larger declarative programs. The results of an implementation for functional logic Curry programs are presented.

show abstract

Synthesizing Set Functions

Antoy

Hanus

Teegen

2019

Functional and Constraint Logic Programming

Self Cite

View full text Add to dashboard Cite

Set functions are a feature of functional logic programming to encapsulate all results of a non-deterministic computation in a single data structure. Given a function f of a functional logic program written in Curry, we describe a technique to synthesize the definition of the set function of f . The definition produced by our technique is based on standard Curry constructs. Our approach is interesting for three reasons. It allows reasoning about set functions, it offers an implementation of set functions which can be added to any Curry system, and it has the potential of changing our thinking about the implementation of non-determinism, a notoriously difficult problem.

show abstract

Functional Logic Programming: From Theory to Curry

Cited by 57 publications

References 106 publications

Functional Logic Programming in Maude

Functional Logic Programming in Maude

Improving Residuation in Declarative Programs

Synthesizing Set Functions

Contact Info

Product

Resources

About