Name
Abstract | ||
|---|---|---|
KiCS2 is a new system to compile functional logic programs of the source language Curry into purely functional Haskell programs. The implementation is based on the idea to represent the search space as a data structure and logic variables as operations that generate their values. This has the advantage that one can apply various, in particular, complete search strategies or even user-defined strategies to compute solutions. However, the generation of all values for logic variables might be inefficient for applications that exploit constraints on partially known values. To overcome this drawback, we propose new techniques to implement equational constraints in this framework. In particular, we show how unification modulo function evaluation and functional patterns can be added without sacrificing the efficiency of the kernel implementation. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-45284-0_9 | PADL |
Keywords | DocType | Volume |
programming language,functional logic programming,functional language,data structure,search space | Conference | abs/1108.5609 |
Citations | PageRank | References |
4 | 0.43 | 27 |
Authors | ||
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 |