On proving the equivalence of concurrency primitives

Various concurrency primitives have been added to sequential programming languages, in order to turn them concurrent. Prominent examples are concurrent buffers for Haskell, channels in Concurrent ML, joins in JoCaml, and handled futures in Alice ML. Even though one might conjecture that all these primitives provide the same expressiveness, proving this equivalence is an open challenge in the area of program semantics. In this paper, we establish a first instance of this conjecture. We show that concurrent buffers can be encoded in the lambda calculus with futures underlying Alice ML. Our correctness proof results from a systematic method, based on observational semantics with respect to may and must convergence.

Metadaten
Author:	Jan Schwinghammer, David Sabel ORCiD GND, Joachim Niehren ORCiD, Manfred Schmidt-Schauß ORCiD GND
URN:	urn:nbn:de:hebis:30-60353
URL:	http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank-34.pdf
Parent Title (German):	Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 34
Series (Serial Number):	Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik (34)
Publisher:	Johann Wolfgang Goethe-Univ., Fachbereich Informatik und Mathematik, Inst. für Informatik, Research group for Artificial Intelligence and Software Technology
Place of publication:	Frankfurt [am Main]
Document Type:	Working Paper
Language:	English
Year of Completion:	2008
Year of first Publication:	2008
Publishing Institution:	Universitätsbibliothek Johann Christian Senckenberg
Release Date:	2008/11/20
Page Number:	34
First Page:	1
Last Page:	34
HeBIS-PPN:	208808086
Institutes:	Informatik und Mathematik / Informatik
Dewey Decimal Classification:	0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):	Deutsches Urheberrecht

Open Access