 |
Free and accessible knowledge |
Conference papers
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
Abstract : We present an observational semantics for lambda(fut), a concurrent lambda calculus with reference cells and futures. The calculus lambda(fut) models the operational semantics of the concurrent higher-order programming language Alice ML. Our result is a powerful notion of equivalence that is the coarsest nontrivial congruence distinguishing observably different processes. It justifies a maximal set of correct program transformations, and it includes all of lambda(fut)'s deterministic reduction rules, in particular, call-by-value beta reduction.
Cited literature [19 references]
https://hal.inria.fr/inria-00128861
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Wednesday, March 7, 2007 - 4:16:47 PM
Last modification on : Friday, February 4, 2022 - 3:08:51 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 11:08:46 PM
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Wednesday, March 7, 2007 - 4:16:47 PM
Last modification on : Friday, February 4, 2022 - 3:08:51 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 11:08:46 PM
File
nssssMFPS23final.pdf
Files produced by the author(s)