Write a Blog >>
Tue 20 Jun 2017 14:00 - 14:30 at Vertex WS208 - Afternoon Session

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 the combinator to a tuple of increasing input streams yields an increasing result stream. We consider designing a type system which can prove the monotonicity of CRDT combinators.

Tue 20 Jun
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

14:00 - 15:30: Afternoon SessionPMLDC at Vertex WS208
14:00 - 14:30
Talk
Monotonicity Types for Distributed Dataflow
PMLDC
Kevin Clancy, Heather MillerEcole Polytechnique Federale de Lausanne
File Attached
14:30 - 15:00
Talk
Multi-view data types for scalable concurrency in the multi-core era
PMLDC
Deepthi Devaki Akkoorath, José Brandão, Annette BieniusaTechnischen Universität Kaiserslautern, Carlos BaqueroHASLab/INESC TEC & University of Minho
File Attached
15:00 - 15:30
Talk
The Single-Writer Principle in CRDT Composition
PMLDC
Vitor Enes, Paulo Sérgio Almeida, Carlos BaqueroHASLab/INESC TEC & University of Minho
File Attached