Creative Commons Attribution 3.0 Germany license (CC BY 3.0 DE)when quoting this document, please refer to the following
DOI: 10.4230/DARTS.5.2.1
URN: urn:nbn:de:0030-drops-107786
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10778/
Fernandez-Reyes, Kiko ; Clarke, Dave ; Henrio, Ludovic ; Johnsen, Einar Broch ; Wrigstad, Tobias
Godot: All the Benefits of Implicit and Explicit Futures (Artifact)
| pdf-format: |
|
|
| artifact-format: |
|
Abstract
This artifact contains an implementation of data-flow futures in terms of control-flow futures, in the Scala language. In the implementation, we show microbenchmarks that solve the three identified problems from the paper:1) The Type Proliferation Problem,
2) The Fulfilment Observation Problem, and
3) The Future Proliferation Problem
There are also detailed instructions on design decisions that differ from the formal semantics and restrictions on the limits of how much can be encoded in the Scala language. We provide examples, e.g., creation of a proxy service using data-flow futures, as well as tests that exercise different parts of the type system.
BibTeX - Entry
@Article{fernandezreyes_et_al:DARTS:2019:10778,
author = {Kiko Fernandez-Reyes and Dave Clarke and Ludovic Henrio and Einar Broch Johnsen and Tobias Wrigstad},
title = {{Godot: All the Benefits of Implicit and Explicit Futures (Artifact)}},
pages = {1:1--1:2},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2019},
volume = {5},
number = {2},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10778},
doi = {10.4230/DARTS.5.2.1},
annote = {Keywords: Futures, Concurrency, Type Systems, Formal Semantics}
}
| Keywords: | Futures, Concurrency, Type Systems, Formal Semantics | |
| Seminar: | Special Issue of the 33rd European Conference on Object-Oriented Programming (ECOOP 2019) | |
| Related Scholarly Article: | https://dx.doi.org/10.4230/LIPIcs.ECOOP.2019.2 | |
| Issue date: | 2019 | |
| Date of publication: | 12.07.2019 |
