The PCKS-machine. an abstract machine for sound evaluation of parallel functional programs with first-class continuations (1994)
| Venue: | In European Symposium on Programming (ESOP'94), number 788 in Lecture Notes in Computer Science |
| Citations: | 7 - 3 self |
BibTeX
@INPROCEEDINGS{Moreau94thepcks-machine.,
author = {Luc Moreau},
title = {The PCKS-machine. an abstract machine for sound evaluation of parallel functional programs with first-class continuations},
booktitle = {In European Symposium on Programming (ESOP'94), number 788 in Lecture Notes in Computer Science},
year = {1994},
pages = {424--438},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. The PCKS-machine is an abstract machine that evaluates parallel functional programs with rst-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 rst 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. 1
