Higher-order patterns in replicated data types
Higher-order patterns in replicated data types
dc.contributor.author | Paulo Sérgio Almeida | en |
dc.contributor.author | Leijnse,A | en |
dc.contributor.author | Carlos Baquero | en |
dc.contributor.other | 5607 | en |
dc.contributor.other | 5596 | en |
dc.date.accessioned | 2019-12-16T14:58:48Z | |
dc.date.available | 2019-12-16T14:58:48Z | |
dc.date.issued | 2019 | en |
dc.description.abstract | The design of Conflict-free Replicated Data Types traditionally requires implementing new designs from scratch to meet a desired behavior. Although there are composition rules that can guide the process, there has not been a lot of work explaining how existing data types relate to each other, nor work that factors out common patterns. To bring clarity to the field we explain underlying patterns that are common to flags, sets, and registers. The identified patterns are succinct and composable, which gives them the power to explain both current designs and open up the space for new ones. © 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM. | en |
dc.identifier.uri | http://repositorio.inesctec.pt/handle/123456789/10536 | |
dc.identifier.uri | http://dx.doi.org/10.1145/3301419.3323971 | en |
dc.language | eng | en |
dc.rights | info:eu-repo/semantics/openAccess | en |
dc.title | Higher-order patterns in replicated data types | en |
dc.type | Publication | en |
dc.type | conferenceObject | en |
Files
Original bundle
1 - 1 of 1