(Enter summary)
Abstract: future is an annotation that indicates which expressions of a program may be evaluated in parallel. By
definition, future is transparent, i.e. annotated programs return the same results as in the absence of annotations.
In such a framework, the interaction of parallelism and first-class continuations has been considered as
a delicate matter for a long time. Indeed, unrestricted parallelism and first-class continuations may lead to
non-deterministic programs, which is contradictory to the... (Update)
Similar documents (at the sentence level):
13.4%: The Semantics of Scheme with Future - Moreau (1996)
(Correct)
Active bibliography (related documents): More All
1.1: The Semantics of Pcall and Fork in the Presence of.. - Moreau, Ribbens (1995)
(Correct)
0.8: Correctness of a Distributed-Memory Model for Scheme - Moreau (1996)
(Correct)
0.7: The Semantics of Future in the Presence of First-Class.. - Moreau (1995)
(Correct)
Similar documents based on text: More All
0.1: Extending execution tracing for mobile code security - Tan, Moreau (2002)
(Correct)
0.1: Practical Aspects of the Moreau-Yosida Regularization .. - Lemaréchal.. (1994)
(Correct)
0.1: A Fault-Tolerant Directory Service for Mobile Agents based on.. - Moreau (2002)
(Correct)
BibTeX entry: (Update)
@misc{ moreau-continuing,
author = "Luc Moreau",
title = "Continuing Into the Future: the Return",
url = "citeseer.ist.psu.edu/moreau96continuing.html" }
Citations (may not include all citations):
197
Revised 4 Report on the Algorithmic Language Scheme
- Rees, Clinger - 1991
70
A Standard ML compiler
- Appel, MacQueen - 1987
33
MultiScheme : A Parallel Processing System Based on MIT Sche.. (context) - Miller - 1987
31
The Incremental Garbage Collection of Processes
- Baker, Hewitt - 1977
25
Continuing Into the Future: On the Interaction of Futures an.. (context) - Katz, Weise - 1990
25
New Ideas in Parallel Lisp : Language Design (context) - Halstead - 1990
24
SCHEME: an Interpreter for Extended Lambda Calculus (context) - Sussman, Steele - 1975
23
An Efficient and General Implementation of Futures on Large ..
- Feeley - 1993
22
the SECD-Machine and the -Calculus (context) - Felleisen, Friedman - 1986
21
Parallel Execution of Sequential Scheme with ParaTran (context) - Tinker, Katz - 1988
18
Abstracting Timed Preemption with Engines (context) - Haynes, Friedman - 1987
18
Obtaining Coroutines with Continuations (context) - Haynes, Friedman et al. - 1986
18
A Parallel Lisp Language Pailisp and its Kernel Specificatio.. (context) - Ito, Matsui - 1990
17
Design of a Concurrent and Distributed Language
- Queinnec, De Roure - 1992
14
The Semantics of Scheme with Future
- Moreau - 1995
14
The Semantics of Scheme with Future
- Moreau - 1996
12
A Mathematical Semantics for Handling Full Jumps (context) - Strachey, Wadsworth - 1974
10
Causality and Continuations (context) - Queinnec - 1994
7
Sound Evaluation of Parallel Functional Programs with First-.. (context) - Moreau - 1994
7
On Pailisp Continuation and its Implementation (context) - Ito, Seino - 1992
5
An Abstract Machine for Sound Evaluation of Parallel Functio.. (context) - Moreau - 1994
5
Friedman and Christopher T (context) - Daniel - 1985
4
Non-speculative and Upward Invocation of Continuations in a ..
- Moreau - 1995
Documents on the same site (http://www.ecs.soton.ac.uk/~lavm/papers.html): More
A Parallel Functional Language With First-Class Continuations.. - Moreau
(Correct)
A Distributed Garbage Collector for NeXeme - Moreau, De Roure
(Correct)
An Operational Semantics for a Parallel Functional Language With.. - Moreau (1992)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC