Monotonicity Types for Distributed Dataflow

The Lasp programming language provides combinator functions such as Union and Intersection for combining set CRDTs. When designing a CRDT combinator, care must be taken to ensure that the combinator is monotone separately in each of its arguments, so that applying it to a tuple of increasing input streams yields an increasing output stream. We consider designing a type system which can prove the monotonicity of CRDT combinators.


Published in:
Proceedings of the 2nd Workshop on Programming Models and Languages for Distributed Computing
Presented at:
2nd Workshop on Programming Models and Languages for Distributed Computing, Barcelona, Spain, June 20, 2017
Year:
2017
Keywords:
Laboratories:




 Record created 2017-07-12, last modified 2018-03-17

Preprint:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)