Towards Generic Type Checking Implementations in Haskell via Second-Order Abstract Syntax
ACM SIGPLAN via YouTube
The Fastest Way to Become a Backend Developer Online
Python, Prompt Engineering, Data Science — Build the Skills Employers Want Now
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Watch a 20-minute video presentation from WITS 2025 workshop where researchers from Innopolis University present their work-in-progress on implementing generic versions of bidirectional typing and Hindley-Milner-style type inference algorithms within the Free Foil framework. Learn about this efficient scope-safe representation for syntax with binders that aims to create more generic type checking implementations in Haskell using Second-Order Abstract Syntax. The presentation was delivered by Nikolai Kudasov, Anastasia Smirnova, Vladislav Deryabkin, Diana Tomilovskaia, and Ekaterina Maksimova at the ACM SIGPLAN-sponsored workshop on January 20, 2025.
Syllabus
[WITS'25] Towards Generic Type Checking Implementations in Haskell via Second-Order Abstract Syntax
Taught by
ACM SIGPLAN