Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch a 21-minute conference presentation from POPL 2018 exploring how intrinsically-typed definitional interpreters can be scaled to handle complex programming languages with mutable state and objects. Learn about innovative techniques developed by researchers from Delft University of Technology and Portland State University for implementing type-safe interpreters in Agda, including dependent-passing style and scope graph programming. Discover how these approaches were successfully applied to create interpreters for both the simply-typed lambda calculus with references (STLC+Ref) and a substantial subset of Middleweight Java, while maintaining conciseness and comprehensibility. The presentation demonstrates how dependent types can be leveraged to automatically verify type safety without requiring separate proofs, advancing the field of mechanized semantics.
