/explore
|
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 |
|
| | | | | ||
| | | | |
www.bailis.org
[AI summary] A technical article introduces 'invariant confluence' (I-confluence), a property that determines when database consistency can be achieved without coordination or synchronous communication, leading to significant performance improvements in distributed systems. |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
tomverbeure.github.io
|
|
| | | |||
