000229896 001__ 229896
000229896 005__ 20190317000751.0
000229896 037__ $$aCONF
000229896 245__ $$aMonotonicity Types for Distributed Dataflow
000229896 269__ $$a2017
000229896 260__ $$c2017
000229896 336__ $$aConference Papers
000229896 520__ $$aThe 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.
000229896 6531_ $$atypes
000229896 6531_ $$aprogramming languages
000229896 6531_ $$adistributed programming
000229896 6531_ $$aconcurrency
000229896 6531_ $$aCRDTs
000229896 6531_ $$aconflict-free replicated datatype
000229896 700__ $$aClancy, Kevin
000229896 700__ $$0242185$$aMiller, Heather$$g191683
000229896 7112_ $$a2nd Workshop on Programming Models and Languages for Distributed Computing$$cBarcelona, Spain$$dJune 20, 2017
000229896 773__ $$tProceedings of the 2nd Workshop on Programming Models and Languages for Distributed Computing
000229896 8564_ $$s787791$$uhttps://infoscience.epfl.ch/record/229896/files/MonotonicityPMLDC2017.pdf$$yPreprint$$zPreprint
000229896 909C0 $$0252187$$pLAMP$$xU10409
000229896 909CO $$ooai:infoscience.tind.io:229896$$pconf$$pIC$$qGLOBAL_SET
000229896 917Z8 $$x191683
000229896 937__ $$aEPFL-CONF-229896
000229896 973__ $$aEPFL$$rREVIEWED$$sACCEPTED
000229896 980__ $$aCONF