Главная
Study mode:
on
1
Intro
2
Abstraction: the good
3
Abstraction: the bad
4
Abstraction: the ugly
5
Back-of-envelope calculations
6
Hellerstein's inequality
7
Semantics: a richer example
8
Lineage and derivation
9
(stateless) protocols
10
(stateful) protocols
11
Distributed language requirements
12
A relativist model of time
13
Dedalus: Syntax
14
Syntax Sugar
15
Dedalus: stateful patterns
16
Ultimate Models
17
CALM Theorem
18
Dedalus: design choices
19
Logic programming tricks From model theory
20
Dedalus answers
Description:
Explore the power of query languages for distributed systems programming in this thought-provoking conference talk from Strange Loop. Delve into the semantics of query languages and their potential to simplify complex distributed systems programming. Discover Dedalus, a query language designed for distributed programming that abstracts away traditional programming details and prioritizes data and time. Learn how this approach enables programmers to reason about distributed correctness properties and lays the foundation for advanced program analysis tools. Follow Peter Alvaro's journey through the evolution of data-centric programming languages, from Dedalus to Bloom, Edelweiss, and Eve. Gain insights into the speaker's research on using data-centric languages to build scalable, predictable, and robust distributed systems. Examine topics such as abstraction, back-of-envelope calculations, stateless and stateful protocols, distributed language requirements, and the CALM Theorem. Uncover how Dedalus's unique design choices and logic programming tricks from model theory contribute to its effectiveness in distributed systems programming. Read more

I See What You Mean

Strange Loop Conference
Add to list