2011 # KiCS2: A New Compiler from Curry to Haskell

**Abstract:** Abstract. In this paper we present our first steps towards a new system to compile functional logic programs of the source language Curry into purely functional Haskell programs. Our implementation is based on the idea to represent non-deterministic results as values of the data types corresponding to the results. This enables the application of various search strategies to extract values from the search space. We show by several benchmarks that our implementation can compete with or outperform other existing …

Help me understand this report

Search citation statements

Paper Sections

Select...

2

1

1

1

Citation Types

0

80

0

Year Published

2014

2020

Publication Types

Select...

7

Relationship

3

4

Authors

Journals

(80 citation statements)

0

80

0

“…Since this transformation is performed on FlatCurry programs, it can be easily integrated into the compilation chain for Curry programs. In fact, the transformation is fully integrated into the current releases of the Curry systems PAKCS [19] and KiCS2 [10].…”

confidence: 99%

“…Since this transformation is performed on FlatCurry programs, it can be easily integrated into the compilation chain for Curry programs. In fact, the transformation is fully integrated into the current releases of the Curry systems PAKCS [19] and KiCS2 [10].…”

confidence: 99%

“…For instance, the expression time since non-deterministic search is transformed to deterministic bindings, as demonstrated by some benchmarks. We used the Curry implementation KiCS2 [10] for the benchmarks. KiCS2 evaluates the Boolean equality operator by narrowing with the "==" rules shown in Sect.…”

confidence: 99%

“…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].…”

confidence: 99%