An abstract machine for concurrent Haskell with futures
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.
Download full text files
Export metadata
Additional Services
| Author: | David Sabel |
|---|---|
| URN: | urn:nbn:de:hebis:30:3-242534 |
| URL: | http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank-48.pdf |
| Series (Serial Number) | Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik (48) |
| 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 |
| Date of Publication (online): | 07.02.2012 |
| Year of first Publication: | 2012 |
| Publishing Institution: | Univ.-Bibliothek Frankfurt am Main |
| SWD-Keyword: | Abstrakter Automat; Formale Semantik; Funktionale Programmierung; Lambda-Kalkül; Nebenläufigkeit |
| Pagenumber: | 26 |
| HeBIS PPN: | 28945624X |
| Institutes: | Informatik |
| Dewey Decimal Classification: | 004 Datenverarbeitung; Informatik |
| Sammlungen: | Universitätspublikationen |
| Licence (German): |  Creative Commons - Namensnennung-Keine Bearbeitung |
