Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures

Authors:
Joachim Niehren;David Sabel;Manfred Schmidt-Schauß;Jan Schwinghammer
Affiliations:
INRIA Futurs, Lille, France, Mostrare Project;J. W. Goethe-Universität, Frankfurt, Germany;J. W. Goethe-Universität, Frankfurt, Germany;Saarland University, Programming Systems Lab, Saarbrücken, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 14
Cited 9

The lazy Lambda calculus in a concurrency scenario

Information and Computation
A non-deterministic call-by-need lambda calculus

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
Operational Semantics and Program Equivalence

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Jocaml: Mobile Agents for Objective-Caml

ASAMA '99 Proceedings of the First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents
The incremental garbage collection of processes

Proceedings of the 1977 symposium on Artificial intelligence and programming languages
The semantics of future and an application

Journal of Functional Programming
A theory of weak bisimulation for Core CML

Journal of Functional Programming
A theory of bisimulation for a fragment of concurrent ML with local names

Theoretical Computer Science
On the representation of McCarthy's amb in the π-calculus

Theoretical Computer Science - Expressiveness in concurrency
The missing link: dynamic components for ML

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
A concurrent lambda calculus with futures

Theoretical Computer Science - Applied semantics
A call-by-need lambda calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations

Mathematical Structures in Computer Science

Asynchronous sequential processes

Information and Computation
Correctly translating concurrency primitives

Proceedings of the 2009 ACM SIGPLAN workshop on ML
Functional Active Objects: Typing and Formalisation

Electronic Notes in Theoretical Computer Science (ENTCS)
Closures of may-, should- and must-convergences for contextual equivalence

Information Processing Letters
On generic context lemmas for higher-order calculi with sharing

Theoretical Computer Science
A contextual semantics for concurrent Haskell with futures

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
ASPfun: A typed functional active object calculus

Science of Computer Programming
Correctness of program transformations as a termination problem

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Conservative Concurrency in Haskell

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an observational semantics for @l(fut), a concurrent @l-calculus with reference cells and futures. The calculus @l(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 @l(fut)'s deterministic reduction rules, in particular, call-by-value @b-reduction.