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 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: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
|14:00 - 14:30|
|14:30 - 15:00|
Deepthi Devaki Akkoorath, José Brandão, Annette BieniusaTechnischen Universität Kaiserslautern, Carlos BaqueroHASLab/INESC TEC & University of MinhoFile Attached
|15:00 - 15:30|