TY  - UNPD
A1  - Sabel, David
T1  - An abstract machine for concurrent Haskell with futures
T2  - Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 48
N2  - We show how Sestoft’s abstract  machine for lazy evaluation of purely functional programs can be extended to evaluate expressions of the calculus CHF – a process calculus that models Concurrent Haskell extended by imperative and implicit futures. The abstract machine is modularly constructed by first adding monadic IO-actions to the machine and then in a second step we add concurrency. Our main result is that the abstract machine coincides with the original operational semantics of CHF, w.r.t. may- and should-convergence.
T3  - Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik - 48 
KW  - Lambda-Kalkül
KW  - Formale Semantik
KW  - Funktionale Programmierung
KW  - Nebenläufigkeit
KW  - Abstrakter Automat
Y1  - 2012
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/24253
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30:3-242534
UR  - http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank-48.pdf
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  -