KiCS2: a new compiler from Curry to Haskell. 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.
Keywords for this software
References in zbMATH (referenced in 10 articles , 1 standard article )
Showing results 1 to 10 of 10.
- Dylus, Sandra; Christiansen, Jan; Teegen, Finn: Implementing a library for probabilistic programming using non-strict non-determinism (2020)
- Sandra Dylus, Jan Christiansen, Finn Teegen: Implementing a Library for Probabilistic Programming using Non-strict Non-determinism (2019) arXiv
- Antoy, Sergio; Hanus, Michael: Transforming Boolean equalities into constraints (2017)
- Antoy, Sergio; Hanus, Michael: Default rules for Curry (2017)
- Antoy, Sergio; Hanus, Michael: From Boolean equalities to constraints (2015)
- Antoy, Sergio; Jost, Andy: Compiling a functional logic language: \textitTheFair Scheme (2014)
- Giegerich, Robert; Touzet, H’el’ene: Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems (2014)
- Antoy, Sergio; Peters, Arthur: Compiling a functional logic language: the basic scheme (2012) ioport
- Braßel, Bernd; Hanus, Michael; Peemöller, Björn; Reck, Fabian: KiCS2: a new compiler from Curry to Haskell (2011) ioport
- Fischer, Sebastian; Kiselyov, Oleg; Shan, Chung-chieh: Purely functional lazy non-deterministic programming (2009)