An abstract machine for concurrent haskell with futures
| dc.contributor.author | Sabel, David | |
| dc.contributor.editor | Jähnichen, Stefan | |
| dc.contributor.editor | Rumpe, Bernhard | |
| dc.contributor.editor | Schlingloff, Holger | |
| dc.date.accessioned | 2018-11-19T13:30:01Z | |
| dc.date.available | 2018-11-19T13:30:01Z | |
| dc.date.issued | 2012 | |
| dc.description.abstract | 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. | en |
| dc.identifier.isbn | 978-3-88579-293-2 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/18374 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Software Engineering 2012. Workshopband | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-199 | |
| dc.title | An abstract machine for concurrent haskell with futures | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 44 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 29 | |
| gi.conference.date | 27. Februar - 2. März 2012 | |
| gi.conference.location | Berlin | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1