Non-speculative and Upward Invocation of Continuations in a Parallel Language


Moreau, Luc (1995) Non-speculative and Upward Invocation of Continuations in a Parallel Language. In, International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'95) Springer-Verlag, 726.

Download

[img] PDF
Download (264Kb)

Description/Abstract

A method of preserving the sequential semantics in parallel programs with first-class continuations is to invoke continuations non-speculatively. This method, which prevents a continuation from being invoked as long as its invocation can infringe the sequential semantics, reduces parallelism by the severe conditions that it imposes, especially on upward uses. In this paper, we present new conditions for invoking continuations in an upward way and both preserving the sequential semantics and providing parallelism. This new approach is formalised in the PCKS-machine, which is proved to be correct by showing that it has the same observational equivalence theory as the sequential semantics.

Item Type: Conference or Workshop Item (Other)
Additional Information: Address: Aarhus, Denmark
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 252767
Date Deposited: 20 Mar 2000
Last Modified: 27 Mar 2014 19:54
Further Information:Google Scholar
ISI Citation Count:2
URI: http://eprints.soton.ac.uk/id/eprint/252767

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics