The PCKS-machine is an abstract machine that evaluates parallel functional programs with first-class continuations. Parallelism is introduced by the construct pcall, which provides a fork-and-join type of parallelism. To the best of our knowledge, the PCKS-machine is the first implementation of such a language that is proved to have a transparent construct for parallelism: every program using such a construct returns the same result as in the absence of this construct. This machine is also characterised by the non-speculative invocation of continuations whose interest is illustrated in an application.
CITATION STYLE
Moreau, L. (1994). The PCKS-machine: An abstract machine for sound evaluation of parallel functional programs with first-class continuations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 788 LNCS, pp. 424–438). Springer Verlag. https://doi.org/10.1007/3-540-57880-3_28
Mendeley helps you to discover research relevant for your work.