An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry

Christiansen, Jan; Seidel, Daniel; Voigtländer, Janis

doi:10.1007/978-3-642-20775-4_7

Cited by 4 publications

(18 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These restrictions are reasonable since polymorphism does not add extra insights and nonrecursive let-expressions with more than one binding can easily be split up into a series of bindings. Furthermore, Christiansen et al [11] point out that recursive let-expressions cannot be handled by a compositional semantics like the one we head for. We could also omit let-expressions completely because they can be simulated by function calls, but they are useful for example calculations.…”

Section: (Flat)currymentioning

confidence: 99%

“…Christiansen et al [11] present a set-based denotational semantics for FlatCurry. We present a slightly modified version of this semantics and extend it with constructs for encapsulation.…”

Section: Semanticsmentioning

confidence: 99%

“…However, many tools that process Curry programs, such as compilers and analyzers, actually work on a kernel language, called FlatCurry, into which all Curry programs can be translated by eliminating syntactic sugar from source programs. Christiansen et al [11] present a denotational semantics for a variant of this intermediate language, called TFLC.…”

Section: (Flat)currymentioning

confidence: 99%

“…The typing context Γ provides type information for unbound variables. Typing rules for the remaining language constructs can be found in [11]. In example programs, we often omit type subscripts if they can be easily determined by the context.…”

Section: (Flat)currymentioning

confidence: 99%

“…In order to specify the intended results of expressions and to be independent of implementation details, we propose a denotational semantics for the encapsulation primitive allValues, inspired by a denotational semantics without capsules [11]. As we will see, a precise description of nested capsules (item 3 above) requires the introduction of different failure values in the semantical domain so that one can distinguish between non-termination and finite failures occuring in different nesting levels.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A semantics for weakly encapsulated search in functional logic programs

Christiansen

Hanus

Reck

et al. 2013

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

Encapsulated search is a key feature of (functional) logic languages. It allows the programmer to access and process different results of a non-deterministic computation within a program. Unfortunately, due to advanced operational features (lazy evaluation, partial values, infinite structures), there is no straightforward definition of the semantics of encapsulated search in functional logic languages. As a consequence, various proposals and implementations are available but a rigorous definition covering all semantical aspects does not exist. In this paper, we analyze the requirements of encapsulated search in a functional logic language like Curry and provide a comprehensive definition that covers weak encapsulation, a modular form of encapsulation, as well as nested applications of search operators. We set up a denotational semantics that distinguishes non-termination and different levels of failures in a computation. The semantics is also the basis of a practical implementation of search operators in the functional logic language Curry.

show abstract

Section: (Flat)currymentioning

confidence: 99%

“…Christiansen et al [11] present a set-based denotational semantics for FlatCurry. We present a slightly modified version of this semantics and extend it with constructs for encapsulation.…”

Section: Semanticsmentioning

confidence: 99%

Section: (Flat)currymentioning

confidence: 99%

Section: (Flat)currymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A semantics for weakly encapsulated search in functional logic programs

Christiansen

Hanus

Reck

et al. 2013

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

show abstract

Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism

Dylus¹,

Christiansen²,

Teegen³

2019

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

This paper presents PFLP, a library for probabilistic programming in the functional logic programming language Curry. It demonstrates how the concepts of a functional logic programming language support the implementation of a library for probabilistic programming. In fact, the paradigms of functional logic and probabilistic programming are closely connected. That is, language characteristics from one area exist in the other and vice versa. For example, the concepts of non-deterministic choice and call-time choice as known from functional logic programming are related to and coincide with stochastic memoization and probabilistic choice in probabilistic programming, respectively. We will further see that an implementation based on the concepts of functional logic programming can have benefits with respect to performance compared to a standard list-based implementation and can even compete with full-blown probabilistic programming languages, which we illustrate by several benchmarks. Under consideration in Theory and Practice of Logic Programming (TPLP). KEYWORDS: probabilistic programming, functional logic programming, non-determinism, laziness, calltime choice * This is an extended version of a paper presented at the International Symposium on Practical Aspects of Declarative Languages (PADL 2018), invited as a rapid communication in TPLP. The authors acknowledge the assistance of the conference program chairs Nicola Leone and Kevin Hamlen. 14 We use version 2.7.10 of Python.

show abstract

Transparent function types

Martin-Martin

Rodríguez-Hortalá

2012

Proceedings of the 14th Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry

Cited by 4 publications

References 7 publications

A semantics for weakly encapsulated search in functional logic programs

A semantics for weakly encapsulated search in functional logic programs

Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism

Transparent function types

Contact Info

Product

Resources

About