ACP and PGA
summary
Algebraic claims: ACP gives axioms for sequencing, choice, parallelism and synchronous communication and drives an implementation called SubScript extension to Scala that composes GUI events, background searches and cancel/exit flows while ensuring GUI vs background threading — the example GUI controller composes event loops, confirmation dialogs and dataflow and "works" as shown. PGA is a low‑level program algebra used to model Java static initialization and to prove behaviors; simple model yields about 10–50,000 actions per second in typical cases.
AI-written summary · about
chapters (4)
related talks
01h 04mWhat FP Can Learn From Formal Languages: Towards a Leaner Syntax
17mArchitecture panel
29mPure Scala Approach for Building Frontend and Backend Apps
01h 35mRecursion Schemes, Algebras, Finally Tagless, Data Types
01h 37mThe Art of Program Derivation and Parallel Computation
12mWhoa, pictures! A visual history of visual programming languages!
26mInfinite Possibilities
31mHow I learned to stop worrying and love the frontend