TY  - UNPD
A1  - Schwinghammer, Jan
A1  - Sabel, David
A1  - Niehren, Joachim
A1  - Schmidt-Schauß, Manfred
T1  - On correctness of buffer implementations in a concurrent lambda calculus with futures
T2  - Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 37
N2  - Motivated by the question of correctness of a specific implementation of concurrent buffers in the lambda calculus with futures underlying Alice ML, we prove that concurrent buffers and handled futures can correctly encode each other. Correctness means that our encodings preserve and reflect the observations of may- and must-convergence. This also shows correctness wrt. program semantics, since the encodings are adequate translations wrt. contextual semantics. While these translations encode blocking into queuing and waiting, we also provide an adequate encoding of buffers in a calculus without handles, which is more low-level and uses busy-waiting instead of blocking. Furthermore we demonstrate that our correctness concept applies to the whole compilation process from high-level to low-level concurrent languages, by translating the calculus with buffers, handled futures and data constructors into a small core language without those constructs.
T3  - Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik - 37 
KW  - Funktionale Programmiersprache
KW  - Pufferspeicher
KW  - Lambda-Kalkül
KW  - Nebenläufigkeit
Y1  - 2009
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/6666
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-67253
UR  - http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank-37.pdf
IS  - Version: March 2, 2009
PB  - Johann Wolfgang Goethe-Univ., Fachbereich Informatik und Mathematik, Inst. für Informatik, Research group for Artificial Intelligence and Software Technology
CY  - Frankfurt [am Main]
ER  -