by Bernd Braßel, Michael Hanus, Björn Peemöller, Fabian Reck
Proc. of the 20th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2011), Springer LNCS 6816, pp. 1-18, 2011
© Springer-Verlag
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.
Preprint (PDF) BibTeX-Entry Online