Overview
Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a conference presentation that examines the formal verification of Scheme's denotational semantics using the Agda proof assistant. Learn how Peter D. Mosses from Delft University of Technology and Swansea University traces the historical development of semantic definitions in Scheme reports and demonstrates a shallow embedding approach to translate denotational semantics into Agda's functional programming environment. Discover the methodology for type-checking semantic definitions to verify their wellformedness, with specific focus on fragments from the fifth revised Scheme report (R5RS). Examine the issues identified through Agda's type system when embedding the complete denotational semantics and review proposed solutions to address these problems. Gain insights into improving the conciseness and clarity of semantic definitions while understanding the intersection of programming language theory, formal verification, and functional programming through this tribute to Christopher Strachey's foundational work in denotational semantics.
Syllabus
[Scheme'25] Checking a Denotational Semantics of Scheme in Agda
Taught by
ACM SIGPLAN