Functional logic programming

Antoy, Sergio; Hanus, Michael

doi:10.1145/1721654.1721675

Cited by 105 publications

(111 citation statements)

References 32 publications

Supporting

Mentioning

107

Contrasting

Unclassified

Order By: Relevance

“…"Reverse" is the same but with built-in lists. "Tak" is a highly recursive function on naturals [34] applied to arguments (27,16,8) and "TakPeano" is the same but with user-defined natural numbers in Peano representation. Note that the Prolog programs use a strict evaluation strategy in contrast to all others.…”

Section: Benchmarksmentioning

confidence: 99%

“…To evaluate the efficiency of non-deterministic computations (Fig. 4), we sort a list containing 15 elements by enumerating all permutations and selecting the sorted ones ("PermSort" and "PermSortPeano" for Peano numbers), compute the last element x of a list xs containing 100,000 elements by solving the equation "ys++[x] =:= xs" (the implementation of unification and variable bindings require some additional machinery that is sketched in Section 5.3), and match a regular expression in a string of length 200,000 following the non-deterministic specification of grep shown in [8]. The results show that our high-level implementation is not far from the efficiency of MCC, and it is superior to PAKCS which exploits Prolog features like backtracking, logic variables and unification for these benchmarks.…”

Section: Benchmarksmentioning

confidence: 99%

“…Functional logic languages integrate the most important features of functional and logic languages (see [8,24] for recent surveys). In particular, they combine higher-order functions and demand-driven evaluation from functional programming with logic programming features like non-deterministic search and computing with partial information (logic variables).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

KiCS2: A New Compiler from Curry to Haskell

Braßel

Hanus

Peemöller

et al. 2011

Functional and Constraint Logic Programming

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper we present our first steps towards a new system to compile functional logic programs of the source language Curry into purely functional Haskell programs. Our implementation is based on the idea to represent non-deterministic results as values of the data types corresponding to the results. This enables the application of various search strategies to extract values from the search space. We show by several benchmarks that our implementation can compete with or outperform other existing implementations of Curry.

show abstract

Section: Benchmarksmentioning

confidence: 99%

Section: Benchmarksmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

KiCS2: A New Compiler from Curry to Haskell

Braßel

Hanus

Peemöller

et al. 2011

Functional and Constraint Logic Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…Thus, we assume familiarity with basic concepts of functional logic programming (details can be found in recent surveys [4,15]). For our examples and implementation, we use the declarative multi-paradigm language Curry [12,17] that combines functional programming features (demand-driven evaluation, higher-order functions) with logic programming features (computing with partial information, unification, non-deterministic search for solutions) and concurrent evaluation.…”

Section: Motivationmentioning

confidence: 99%

“…4 If the programmer wants to define assertions that should be only lazily evaluated (i.e., they might not be faithful but could be desirable for assertions on infinite data structures), our library also provides an operator to attach such lazy assertions to expressions:…”

Section: Main >> Enforceassertionsmentioning

confidence: 99%

Lazy and Enforceable Assertions for Functional Logic Programs

Hanus¹

2011

Functional and Constraint Logic Programming

Self Cite

View full text Add to dashboard Cite

Abstract. Assertions or contracts are an important technique to improve the quality of software. Thus, assertions are also desirable for functional logic programming. Unfortunately, there is no established meaning of assertions in languages with a demand-driven evaluation strategy. Strict assertions are immediately checked but may influence the behavior of programs. Lazy assertions do not modify the behavior but may not be faithful since some assertions might not be checked at all. In order to avoid the disadvantages of strict and lazy assertions, we propose enforceable assertions that are delayed as lazy assertions but can be explicitly enforced at some point where faith is required, e.g., at the end of the program execution or before irrevocable I/O actions. We describe a prototypical implementation of this idea in the functional logic language Curry where the programmer can choose between lazy and enforceable assertions.

show abstract

Non-linear Pattern Matching with Backtracking for Non-free Data Types

Egi

Nishiwaki

2018

Programming Languages and Systems

View full text Add to dashboard Cite

Pattern matching is an important feature of programming languages for data abstraction. Many pattern-matching extensions have been proposed and implemented for extending the range of data types to which pattern matching is applicable. Among them, the pattern-matching system proposed by Egi and Nishiwaki features practical pattern matching for non-free data types by providing an extensible non-linear pattern-matching facility with backtracking [20]. However, they implemented their proposal only in an interpreter of the Egison programming language, and a method for compiling pattern-matching expressions of Egison was not discussed. This paper proposes a method for translating a program that contains patternmatching expressions of Egison to a program that contains only the existing syntax constructs of functional programming languages. This method is based on the three key ideas: (i) transformation of a matcher to a function that takes a pattern and a target, and returns lists of triples of a pattern, a matcher, and a target; (ii) compilation of match-all to application of the map function; (iii) transformation of a value pattern to a function that takes an intermediate pattern-matching result and returns a value. This paper shows the proposed method works by showing Scheme macros that provide the users the patternmatching facility of Egison. This paper also presents benchmark results that show Egison pattern-matching embedded in Gauche Scheme is faster than the original Egison interpreter.

show abstract

Functional logic programming

Abstract: Combining the paradigm features of both logic and functional programming makes for some powerful implementations.

Cited by 105 publications

References 32 publications

KiCS2: A New Compiler from Curry to Haskell

KiCS2: A New Compiler from Curry to Haskell

Lazy and Enforceable Assertions for Functional Logic Programs

Non-linear Pattern Matching with Backtracking for Non-free Data Types

Contact Info

Product

Resources

About