Gesellschaft für Informatik e.V.

Lecture Notes in Informatics

Software Engineering 2012. Workshopband P-199, 29-44 (2012).

Gesellschaft für Informatik, Bonn

Copyright © Gesellschaft für Informatik, Bonn


An abstract machine for concurrent haskell with futures

David Sabel


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. mayand should-convergence.

Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-293-2

Last changed 04.10.2013 18:38:00