Purely functional lazy nondeterministic programming

Fischer, Sebastian; Kiselyov, Oleg; Shan, Chung-chieh

doi:10.1017/s0956796811000189

Cited by 33 publications

(34 citation statements)

References 42 publications

(42 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our work principally relates to the implementation of functional logic languages [19,21,22,24,30,45]. This is a long-standing and active area of research whose difficulties originate from the combination of laziness, non-determinism and sharing [41].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Compiling a Functional Logic Language: The Fair Scheme

Antoy

Jost

2014

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. We present a compilation scheme for a functional logic programming language. The input program to our compiler is a constructor-based graph rewriting system in a non-confluent, but well-behaved class. This input is an intermediate representation of a functional logic program in a language such as Curry or T OY. The output program from our compiler consists of three procedures that make recursive calls and execute both rewrite and pull-tab steps. This output is an intermediate representation that is easy to encode in any number of programming languages. Our design evolves the Basic Scheme of Antoy and Peters by removing the "left bias" that prevents obtaining results of some computations-a behavior related to the order of evaluation, which is counter to declarative programming. The benefits of this evolution are not only the strong completeness of computations, but also the provability of non-trivial properties of these computations. We rigorously describe the compiler design and prove some of its properties. To state and prove these properties, we introduce novel definitions of "need" and "failure." For non-confluent constructor-based rewriting systems these concepts are more appropriate than the classic definition of need of Huet and Levy.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In some very recent implementations [18,19,24] Haskell is the target language. This target environment provides lazy functional computations and to some extent sharing.…”

Section: Related Workmentioning

confidence: 99%

Compiling a Functional Logic Language: The Fair Scheme

Antoy

Jost

2014

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

show abstract

“…There is some recent work on embedding non-determinism in functional languages [7]. As a motivating example an isSorted predicate is used to derive a sorting function, a process which is quite similar to generating sorted lists from a predicate.…”

Section: Related Workmentioning

confidence: 99%

Generating Constrained Random Data with Uniform Distribution

Claessen

Duregård

Pałka

2014

Functional and Logic Programming

View full text Add to dashboard Cite

Abstract. We present a technique for automatically deriving test data generators from a predicate expressed as a Boolean function. The distribution of these generators is uniform over values of a given size. To make the generation efficient we rely on laziness of the predicate, allowing us to prune the space of values quickly. In contrast, implementing test data generators by hand is labour intensive and error prone. Moreover, handwritten generators often have an unpredictable distribution of values, risking that some values are arbitrarily underrepresented. We also present a variation of the technique where the distribution is skewed in a limited and predictable way, potentially increasing the performance. Experimental evaluation of the techniques shows that the uniform derived generators are much easier to define than hand-written ones, and their performance, while lower, is adequate for some realistic applications.

show abstract

“…In more recent implementations [11,13,19], Haskell is the target language. This target environment provides lazy functional computations and to some extent sharing.…”

Section: Related Work and Concluding Remarksmentioning

confidence: 99%

Compiling a Functional Logic Language: The Basic Scheme

Antoy

Peters

2012

Functional and Logic Programming

View full text Add to dashboard Cite

Abstract. We present the design of a compiler for a functional logic programming language and discuss the compiler's implementation. The source program is abstracted by a constructor based graph rewriting system obtained from a functional logic program after syntax desugaring, lambda lifting and similar transformations provided by a compiler's front-end. This system is non-deterministic and requires a specialized normalization strategy. The target program consists of 3 procedures that execute graph replacements originating from either rewrite or pull-tab steps. These procedures are deterministic and easy to encode in an ordinary programming language. We describe the generation of the 3 procedures, discuss the correctness of our approach, highlight some key elements of an implementation, and benchmark the performance of a proof-of-concept. Our compilation scheme is elegant and simple enough to be presented in one page.

show abstract

Purely functional lazy nondeterministic programming

Cited by 33 publications

References 42 publications

Compiling a Functional Logic Language: The Fair Scheme

Compiling a Functional Logic Language: The Fair Scheme

Generating Constrained Random Data with Uniform Distribution

Compiling a Functional Logic Language: The Basic Scheme

Contact Info

Product

Resources

About