Explore a concise preview of the Logic & Decidability II session at POPL 2023, presented by Caleb Stanford. Dive into the world of logic and its applications in programming language research, addressing the challenge of undecidability. Gain insights into various logical theories, including arithmetic, linear real rings, and monadic shallow linear (MSL) clauses. Discover how logic translates to state machines and learn about new minimization algorithms. This 11-minute video, part of ACM SIGPLAN's innovative session preview track, aims to make POPL talks more accessible to the broader community by providing essential background information and specific paper overviews.
Overview
Syllabus
Intro
Everything is Logic
Logic, for PL Researchers
Problem: Undecidability
Logic Crash Course (in One Slide)
The Logic Landscape
Theories of Arithmetic
Linear Real Rings
Hom Clauses - "Monadic Shallow Linear" (MSL)
Higher-Order MSL
From Logic to State Machines
New Minimization Algorithms
Quick advertisement
Taught by
ACM SIGPLAN
