POPL 2025 (series) / WITS 2025 (series) / WITS 2025 / Eta conversion for the unit type (is still not that simple)
Eta conversion for the unit type (is still not that simple)Remote
This program is tentative and subject to change.
Sat 25 Jan 2025 12:00 - 12:30 at Duck, Duck Goose - Session 2
Eta-conversion for the unit type is a simple feature with well-known formal metatheory, but in practical implementations it’s more often shunned than supported. The problem is that it requires type-aware conversion, and implementors prefer the comfort of the purely syntax-directed world. To date, Agda is the only big system that attempts to support it, but its support is not particularly efficient or complete. I describe improved designs in the following, which I hope to be much faster than the existing Agda version, while guaranteeing unique solutions of unification problems.
Abstract (wits25-paper5.pdf) | 332KiB |
This program is tentative and subject to change.
Sat 25 JanDisplayed time zone: Mountain Time (US & Canada) change
Sat 25 Jan
Displayed time zone: Mountain Time (US & Canada) change
11:00 - 12:30 | |||
11:00 30mTalk | Towards Generic Type Checking Implementations in Haskell via Second-Order Abstract SyntaxRemote WITS Nikolai Kudasov Innopolis University, Anastasia Smirnova Innopolis University, Vladislav Deryabkin Innopolis University, Diana Tomilovskaia Innopolis University, Ekaterina Maksimova Innopolis University File Attached | ||
11:30 30mTalk | McTT: Building A Correct-By-Construction Proof Checker For Martin-Loef Type Theory WITS Junyoung Jang McGill University, Jason Z.S. Hu Amazon Web Services, USA, Antoine Gaulin McGill University, Brigitte Pientka McGill University Pre-print File Attached | ||
12:00 30mTalk | Eta conversion for the unit type (is still not that simple)Remote WITS András Kovács University of Gothenburg and Chalmers University of Technology File Attached |