inria-00128861, version 1
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
Joachim Niehren
1David Sabel 2Manfred Schmidt-Schauß 2Jan Schwinghammer 3
23rd Conference on Mathematical Foundations of Programming Semantics 173 (2007) 313-337
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.
- 1: MOSTRARE (INRIA Futurs)
- INRIA – CNRS : UMR8022 – Université des Sciences et Technologies de Lille - Lille I : EA3588 – Université Charles de Gaulle - Lille III
- 2: J. W. Goethe-Universität
- J. W. Goethe-Universitat – Goethe Universität
- 3: Programming Systems Lab [Saarland]
- Saarland University
- Domain : Computer Science/Programming Languages
- inria-00128861, version 1
- http://hal.inria.fr/inria-00128861
- oai:hal.inria.fr:inria-00128861
- From: Joachim Niehren
- Submitted on: Wednesday, 7 March 2007 16:16:47
- Updated on: Monday, 14 December 2009 22:24:30






Associated documents
Export