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 implementations of Curry.
CITATION STYLE
Braßel, B., Hanus, M., Peemöller, B., & Reck, F. (2011). KiCS2: A new compiler from curry to Haskell. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6816 LNCS, pp. 1–18). Springer Verlag. https://doi.org/10.1007/978-3-642-22531-4_1
Mendeley helps you to discover research relevant for your work.