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 [2020-11-30 10:36] mh |
implementations:overview [2020-11-30 10:48] mh [Spite] |
||
|---|---|---|---|
| Line 85: | 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 ]] | ||
| + | |||
| + | [[ https://arxiv.org/abs/1608.04016 | A New Functional-Logic Compiler for Curry: Sprite ]] | ||
| + | |||
| + | **Contact:** | ||
| + | [[ http://www.cs.pdx.edu/~antoy | Sergio Antoy ]] | ||
| + | and Andy Jost <ajost@pdx.edu> | ||
