Name
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 implementations of Curry. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-22531-4_1 | WFLP |
Keywords | DocType | Volume |
new compiler,non-deterministic result,data type,existing implementation,source language curry,search space,various search strategy,functional haskell program,functional logic program,new system | Conference | 6816 |
ISSN | Citations | PageRank |
0302-9743 | 28 | 1.00 |
References | Authors | |
31 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernd Braßel | 1 | 181 | 12.47 |
| Michael Hanus | 2 | 707 | 45.18 |
| Björn Peemöller | 3 | 34 | 2.14 |
| Fabian Reck | 4 | 45 | 3.40 |