A tiny constraint functional logic language and its continuation semantics

Abstract

We present an extension of k-calculus by logical features and constraints, which yields a minimal core language for constraint functional logic programming. We define a denotational semantics based on continuation passing style. The operational semantics of our language is given as a set of reduction rules. We prove soundness of the operational semantics w.r.t, the continuation semantics. Finally, we show how pure functional logic programs can be translated to this core language in a sound way.

A language for automatically enforcing privacy policies

“…Jeeves most directly borrows from CFLP-L, a constraint functional programming calculus presented by Mück et al [18]; similar functional logic models have also been implemented in languages such as Mercury [25], Escher [15], and Curry [9,10]. Our system differs in the restrictions we place on nondeterminism and the execution model.…”

A language for automatically enforcing privacy policies

“…The way Jeeves handles privacy is inspired by angelic nondeterminism [8]. Jeeves most directly borrows from CFLP-L, a constraint functional programming calculus presented by Mück et al [18]; similar functional logic models have also been implemented in languages such as Mercury [25], Escher [15], and Curry [9,10]. Our system differs in the restrictions we place on nondeterminism and the execution model.…”

“…We define Jeeves in terms of λ J , a constraint functional language that describes the propagation and enforcement of policies in Jeeves. λ J is different from existing constraint functional languages [9,10,15,18,25] in the restrictions it places on the logical model and its use of default logic to provide determinism in program behavior. These restrictions make it possible for λ J to have an efficient execution model without sacrificing too much expressiveness.…”