Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a conference presentation that proves an adequacy theorem for a general class of algebraic effects, including infinitary ones, presented by G. A. Kavvos from the University of Bristol at OOPSLA1 2025. Discover how the theorem targets a version of Call-by-Push-Value (CBPV) to apply to various evaluation mechanisms, including call-by-value. Learn about the calculus's operational semantics based on interaction trees and its denotational semantics founded on monad algebras. Examine the main result demonstrating that denotational equivalence implies observational equivalence through a traditional logical relations argument. Gain insights into advanced topics in programming language theory, including algebraic effects, denotational semantics, monads, adequacy, and logical relations as presented at this premier conference on object-oriented programming, systems, languages, and applications.
