Towards Tagless Interpretation of Stratified System F

Offered By: ACM SIGPLAN via YouTube

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!

Explore the design of an intrinsically typed, tagless interpreter for stratified System F in Agda through this 19-minute conference talk presented by Peter Thiemann and Marius Weidner at TyDe'23. Delve into the intricacies of implementing a type-safe interpreter for a powerful polymorphic lambda calculus, focusing on the challenges and solutions in creating a tagless representation. Gain insights into advanced type theory concepts and their practical applications in programming language implementation.

Syllabus

[TyDe'23] Towards Tagless Interpretation of Stratified System F (Extended Abstract)

Taught by

ACM SIGPLAN

Related Courses

Radical and Type Theories in Organic Chemistry (1832-1850) - Lecture 22
Yale 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