Name
Abstract | ||
|---|---|---|
Delimited continuations are a famous control primitive that originates in the functional programming world. It allows the programmer to suspend and capture the remaining part of a computation in order to resume it later. We put a new Prolog-compatible face on this primitive and specify its semantics by means of a meta-interpreter. Moreover, we establish the power of delimited continuations in Prolog with several example definitions of high-level language features. Finally, we show how to easily and effectively add delimited continuations support to the WAM. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1017/S1471068413000331 | THEORY AND PRACTICE OF LOGIC PROGRAMMING |
Keywords | Field | DocType |
delimited continuations,Prolog | Programming language,Programmer,Functional programming,Computer science,Delimited continuation,Algorithm,Theoretical computer science,Prolog,Semantics,Computation | Journal |
Volume | Issue | ISSN |
13 | 4-5 | 1471-0684 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| tom schrijvers | 1 | 652 | 63.35 |
| bart demoen | 2 | 956 | 77.58 |
| Benoit Desouter | 3 | 8 | 2.69 |
| Jan Wielemaker | 4 | 488 | 49.21 |