Explore >> Select a destination
|
You are here 
|
blog.acolyer.org | ||
| | | | |
bloom-lang.net
|
|
| | | | | CALM: consistency as logical monotonicity One of the key innovations underlying Bloom is the ability to formally guarantee consistency properties of distributed programs. This reasoning is based o | |
| | | | |
drops.dagstuhl.de
|
|
| | | | | [AI summary] The provided text is a collection of academic papers and proceedings from the 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023). The papers cover various topics in coalgebra, including: 1. **Compositionality and Equivalence of Coalgebraic Specifications** (by Bas Spitters and others): This paper explores how to compose coalgebraic specifications and ensure their equivalence, with applications to formal verification and system design. 2. **Coalgebraic Semantics for CRDTs**: A paper by Nathan Liittschwager et al. presents a coalgebraic approach to modeling conflict-free replicated data types (CRDTs), aiming to unify their specification and verification. 3. **Polynomial Functors and Their Coalgebras**: Jiří Adámek, Stefa... | |
| | | | |
databeta.wordpress.com
|
|
| | | | | For folks who care about what's possible in distributed computing: Peter Alvaro and I wrote an introduction to the CALM Theorem and subsequent work that is now up on arXiv. The CALM Theorem formally characterizes the class of programs that can achieve distributed consistency without the use of coordination. I spent a good fraction of... | |
| | | | |
geriatrixfotogallerie.wordpress.com
|
|
| | | Geriatri'x' Corner:Travel Blog in English from 2011 Geriatri'x' Corner: Travel Blog in German from 2011 Geriatri'x' Cornerwebsite till 2011 | ||
