Academic
Publications
Functional logic programming

Functional logic programming,10.1145/1721654.1721675,Communications of The ACM,Sergio Antoy,Michael Hanus

Functional logic programming   (Citations: 10)
BibTex | RIS | RefWorks Download
Combining the paradigm features of both logic and functional programming makes for some powerful implementations.
Journal: Communications of The ACM - CACM , vol. 53, no. 4, pp. 74-85, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...As explained in [4], the combination proposed by this paradigm is conservative: programs that do not use the features of one paradigm behave as programs of the other paradigm...

    Rafael Caballero. A program transformation for returning states in functional-logic prog...

    • ...Functional logic languages (see [7,13] for recent surveys) integrate the most important features of functional and logic languages to provide a variety of programming concepts to the programmer...
    • ...More details about functional logic programming and Curry can be found in recent surveys [7,13] and the language definition [16]...

    Bernd Braßelet al. Transforming Functional Logic Programs into Monadic Functional Program...

    • ...Functional logic languages integrate the most important features of functional and logic languages (see [8,24] for recent surveys)...
    • ... 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 ofgrep shown in [8]...

    Bernd Braßelet al. KiCS2: A New Compiler from Curry to Haskell

    • ...Logic programming (LP) languages [1] and functional logic languages [3], have nondeterminism, combined with backtrackingbased search, at their core...
    • ...Por instance, LExp [1,2,3,4]) has 3240 expressions, while (genSExp [1,2,3,4]) consists of 42 bundles...
    • ...Por instance, LExp [1,2,3,4]) has 3240 expressions, while (genSExp [1,2,3,4]) consists of 42 bundles...
    • ...Table 3 contains results for a pair of instances of the problem: operands is [1,2,3,4,5,6] in both cases, total is 101 in the first case (times correspond to the first found solution), and 284 (no solution) in the second case...

    F. J. Lopez-Fraguaset al. Bundles: a data structure for lazy non-determinism (Work in progress)

    • ...How relation algebra and the features of the functional-logic extension Curry (see [3]) of Functional Version of Warshall’s Algorithm with Applications 111...

    Rudolf Berghammer. A Functional, Successor List Based Version of Warshall’s Algorithm wit...

Sort by: