Skip to main content

The Semantics of Scheme with Future

DOI 10.1145/232627.232644 dblp BibTeX

Abstract

We present the formal semantics of future in a Scheme-like language which has both side-effects and first-class continuations. Correctness is established by proving that programs annotated by future have the same observable behaviour as their non-annotated counterparts, even though evaluation may be parallel.

Related papers

Object-Oriented Concurrent Programming in ABCL/1 OOPSLA 1986
StackThreads/MP: Integrating Futures into Calling Standards PPoPP 1999
The Semantics of Future and an Application JFP 1999
Investigating the semantics of futures in transactional memory systems PPoPP 2021
The Semantics of Future and Its Use in Program Optimizations POPL 1995
Reflective Facilities in Smalltalk-80 OOPSLA 1989
Cache topology aware computation mapping for multicores PLDI 2010
An Efficient Implementation Scheme of Concurrent Object-Oriented Languages on Stock Multicomputers PPoPP 1993