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 At International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'95). , p. 726.

Download

[img] PDF Non-speculative_and_Upward_Invocation_of_Continuations_in_Parallel_Language.pdf - Accepted Manuscript
Download (270kB)

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 (Paper)
Additional Information: Address: Aarhus, Denmark
Venue - Dates: International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'95), 1995-01-01
Organisations: Web & Internet Science
ePrint ID: 252767
Date :
Date Event
1995Published
Date Deposited: 20 Mar 2000
Last Modified: 17 Apr 2017 23:29
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/252767

Actions (login required)

View Item View Item