Modular Denotational Semantics for Effects with Guarded Interaction Trees
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
Explore a 21-minute conference talk from POPL 2024 that introduces guarded interaction trees, a framework for representing higher-order computations with higher-order effects in Coq. Delve into the presentation of a structure inspired by domain theory and interaction trees, along with an accompanying separation logic for reasoning. Learn how guarded interaction trees provide a convenient domain for interpreting higher-order languages with effects through the demonstration of a PCF-like language interpretation. Discover the modular approach to combining and reasoning about different effects, illustrated through a proof of type soundness for cross-language interactions. Gain insights into the formalization of all results in Coq using the Iris logic over guarded type theory, with available and reusable artifacts for further exploration.
Syllabus
[POPL'24] Modular Denotational Semantics for Effects with Guarded Interaction Trees
Taught by
ACM SIGPLAN
Related Courses
Radical and Type Theories in Organic Chemistry (1832-1850) - Lecture 22Yale University via YouTube Introduction to programming with dependent types in Scala
Stepik Uncovering the Unknown - Principles of Type Inference in Programming Languages
ChariotSolutions via YouTube Univalence from a Computer Science Point-of-View - Dan Licata
Institute for Advanced Study via YouTube Univalent Foundations and the Equivalence Principle - Benedikt Ahrens
Institute for Advanced Study via YouTube