Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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.
Martin Odersky, Aleksander Slawomir Boruch-Gruszecki, Ondrej Lhoták
Aleksander Slawomir Boruch-Gruszecki
Martin Odersky, Yichen Xu, Aleksander Slawomir Boruch-Gruszecki