Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
|
implementations:overview [2015-05-12 12:33] mh [MCC] |
implementations:overview [2020-11-30 10:48] mh [Spite] |
||
|---|---|---|---|
| Line 34: | Line 34: | ||
| a [[ implementations:overview#tastecurry | simple interpreter implemented in Prolog ]], | a [[ implementations:overview#tastecurry | simple interpreter implemented in Prolog ]], | ||
| but these are no longer maintained). | but these are no longer maintained). | ||
| + | |||
| + | PAKCS (release 2.0.1) is also available as an Ubuntu 18.04 package. | ||
| + | If you run this OS, PAKCS can be installed with the command | ||
| + | |||
| + | > sudo apt install pakcs | ||
| + | |||
| + | **Contact:** | ||
| + | [[ http://www.informatik.uni-kiel.de/~mh/ | Michael Hanus ]] | ||
| + | <mh@informatik.uni-kiel.de> | ||
| + | |||
| + | |||
| + | ===== KiCS2 ===== | ||
| + | |||
| + | The [[ http://www-ps.informatik.uni-kiel.de/kics2 | KiCS2 ]] | ||
| + | is a new implementation that translates Curry | ||
| + | into [[ http://www.haskell.org/ | Haskell]]. | ||
| + | KiCS2 supports several search strategies to encapsulate search | ||
| + | (e.g., depth-first, breadth-first) and advanced extensions | ||
| + | of Curry like | ||
| + | [[ http://www.informatik.uni-kiel.de/~mh/papers/PPDP09.html | encapsulated search via set functions ]] | ||
| + | and [[http://www.informatik.uni-kiel.de/~mh/papers/LOPSTR05.html | functional patterns]]. | ||
| + | It also provides almost all libraries | ||
| + | of PAKCS for application programming so that it has been | ||
| + | used for various applications. | ||
| **Contact:** | **Contact:** | ||
| Line 61: | Line 85: | ||
| <wlux@uni-muenster.de> | <wlux@uni-muenster.de> | ||
| + | ===== Sprite ===== | ||
| + | Sprite is a compiler and runtime for Curry programs. | ||
| + | It is based on the Fair Scheme, a compilation strategy for transforming | ||
| + | declarative, non-deterministic source programs into imperative, | ||
| + | deterministic code. | ||
| + | As the Fair Scheme emphasizes operational completeness, | ||
| + | Sprite aims to produce all values of Curry programs, | ||
| + | subject only to practical limits such as the amount of memory available. | ||
| + | Relevant papers: | ||
| + | [[ https://doi.org/10.1007/978-3-319-14125-1_12 | Compiling a Functional Logic Language: The Fair Scheme ]] | ||
| - | ===== KiCS2 ===== | + | [[ https://arxiv.org/abs/1608.04016 | A New Functional-Logic Compiler for Curry: Sprite ]] |
| - | + | ||
| - | The [[ http://www-ps.informatik.uni-kiel.de/kics2 | KiCS2 ]] | + | |
| - | is a new implementation that translates Curry | + | |
| - | into [[ http://www.haskell.org/ | Haskell]]. | + | |
| - | KiCS2 supports several search strategies to encapsulate search | + | |
| - | (e.g., depth-first, breadth-first) and advanced extensions | + | |
| - | of Curry like | + | |
| - | [[ http://www.informatik.uni-kiel.de/~mh/papers/PPDP09.html | encapsulated search via set functions ]] | + | |
| - | and [[http://www.informatik.uni-kiel.de/~mh/papers/LOPSTR05.html | functional patterns]]. | + | |
| - | It also provides almost all libraries | + | |
| - | of PAKCS for application programming so that it has been | + | |
| - | used for various applications. | + | |
| **Contact:** | **Contact:** | ||
| - | [[ http://www.informatik.uni-kiel.de/~mh/ | Michael Hanus ]] | + | [[ http://www.cs.pdx.edu/~antoy | Sergio Antoy ]] |
| - | <mh@informatik.uni-kiel.de> | + | and Andy Jost <ajost@pdx.edu> |
