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 p r o vides 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.
The PCKS machine supports parallel executions of functional programs in a shared-memory environment REF .
The PCKS-machine. an abstract machine for sound evaluation of parallel functional programs with first-class continuations
In European Symposium on Programming (ESOP'94), number 788 in Lecture Notes in Computer Science
Computer Science