Logic and Algebras for Distributed Computing - Applications and Open Questions

Explore a comprehensive lecture on the intersection of distributed computing, logic, and algebra. Delve into the connections between distributed computing concerns and formal program representations, examining work grounded in logic, including the CALM Theorem, and algebraic approaches like semi-lattices in CRDTs. Investigate the unification of these results and their integration into practical language stacks for programming, program checking, and compilation. Gain insights from a practitioner's perspective on the current state of research, motivations behind various approaches, and open questions based on experiences with language and runtime designs such as Dedalus, Bloom, and the Hydro project. Discover the potential for fluidity between different formalisms in both theoretical proofs and practical applications within distributed computing systems.