Citation Context

...egies, concurrency, external operations etc (see [3] for details). The flat representation of programs and its operational semantics has been used for various language-oriented tools (e.g., compilers =-=[20,27]-=-, partial evaluators [4,5], trace-oriented debuggers [40], profilers [39]) and extended in various ways (e.g., higher-order functions [87], memoization [53], encapsulated search [38], computation cost...

Citation Context

...ains, like real arithmetic, Boolean, or finite domain constraints. Thus, typical applications of constraint logic programming can be covered and combined with features of lazy higherorder programming =-=[10,19,30,31,67,70,77]-=-. As an example demonstrating the compactness obtained by combining constraint programming with higher-order features, consider a solver for SuDoku puzzles 6 with finite domain constraints. If we repr...

Citation Context

...elements of type a and returns a list of elements of type a, where a is any type. A consequence of the rules defining insert, where the second and third rule overlap, is that the expression (insert 1 =-=[3,5]-=-) has three possible values: [1,3,5], [3,1,5], and [3,5,1]. Using insert, we define the possible permutations of a list by: perm [] = [] perm (x:xs) = insert x (perm xs) As an example of solving const...

Citation Context

...the standard prelude as \PEVAL x = x." The source program is then translated into the FlatCurry format, a standard intermediate representation which is used during the compilation of Curry progr=-=ams [16, 32, 43-=-] (this representation is described in detail in Section 3). The process continues by extracting the set of annotated expressions and by creating a copy of the FlatCurry program without the PEVAL ann...

Citation Context

...ny constructor term l such that p ∗ ❀ l is computed. We have implemented function patterns in the Curry programming environment PAKCS [20]. This environment includes a compiler from Curry into Prolog =-=[7]-=-, which we used for our benchmarks. The implementation is based on the ideas sketched above. Rules with function patterns are transformed into standard rules by putting the calls to “=:<=” in the cond...

Citation Context

...ementations of functional logic programming languages, e.g., Curry [18] and T OY [19]. Most existing implementations of these languages are based on a translation of source code to Prolog code (e.g., =-=[7]-=-), which can be executed by existing standard Prolog engines. This approach simplifies the task of implementing functional logic language features: e.g., source language variables can be implemented b...

Citation Context

...ation for non-deterministic search as well as logic variables and unification for computing with partial information. However, one has to implement demand-driven evaluation and higher-order functions =-=[5]-=-. A disadvantage of this approach is the commitment to a fixed search strategy (backtracking). If one compiles into a non-strict functional language like Haskell, one can reuse the implementation of l...

Citation Context

...to implement distributed applications (e.g., Internet servers [14], dynamic web pages [17]) or graphical user interfaces [16]. Several ecient implementations of the language already exist (see, e.g., =-=[7, 18, 25]-=-), although there is still room for further improvements. Existing compilers for pure functional languages have been successfully improved by semantics-based program transformation techniques. For ins...