Explore >> Select a destination
|
You are here 
|
speakerdeck.com | ||
| | | | |
sookocheff.com
|
|
| | | | | Title and Author of Paper Consistency Analysis in Bloom: a CALM and Collected Approach. Alvaro et al. Summary Distributed programming is difficult for even experienced developers to get correct. Understanding the tradeoff between consistency, availability, and latency, while guaranteeing data correctness, provides a wealth of problems for the application developer. This paper presents a language and method for programmatically verifying distributed consistency. CALM - Consistency and Logical Monotonicity... | |
| | | | |
decomposition.al
|
|
| | | | | My research group has a new paper, "CRDT Emulation, Simulation, and Representation Independence", appearing at ICFP this year! This project was headed up by my PhD student Nathan Liittschwager, with help from another PhD student in my group, Jonathan Castello, and our collaborator Stelios Tsampas. You can read our preprint (warts and all, but soon to be improved, thanks to feedback from the ICFP reviewers) on arXiv, but here's a quick summary. Update (August 2025): The final version is now published in PACMPL, and there's an updated extended version on arXiv! | |
| | | | |
martin.kleppmann.com
|
|
| | | | | ||
| | | | |
thehighergeometer.wordpress.com
|
|
| | | Here's a fun thing: if you want to generate a random finite $latex T_0$ space, instead select a random subset from $latex \mathbb{S}^n$, the $latex n$-fold power of the Sierpinski space $latex \mathbb{S}$, since every $latex T_0$ space embeds into some (arbitrary) product of copies of the Sierpinski space. (Recall that $latex \mathbb{S}$ has underlying... | ||
