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.


Publié dans:
Proceedings of the 2nd Workshop on Programming Models and Languages for Distributed Computing
Présenté à:
2nd Workshop on Programming Models and Languages for Distributed Computing, Barcelona, Spain, June 20, 2017
Année
2017
Mots-clefs:
Laboratoires:




 Notice créée le 2017-07-12, modifiée le 2018-09-13

Preprint:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)