Show simple item record

dc.contributor.authorSabel, David
dc.contributor.editorJähnichen, Stefan
dc.contributor.editorRumpe, Bernhard
dc.contributor.editorSchlingloff, Holger
dc.date.accessioned2018-11-19T13:30:01Z
dc.date.available2018-11-19T13:30:01Z
dc.date.issued2012
dc.identifier.isbn978-3-88579-293-2
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/18374
dc.description.abstractWe 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.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofSoftware Engineering 2012. Workshopband
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-199
dc.titleAn abstract machine for concurrent haskell with futuresen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages29-44
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBerlin
mci.conference.date27. Februar - 2. März 2012


Files in this item

Thumbnail

Show simple item record