Syntactic Implicit Parameters with Static Overloading
summary
Presents a simple, orthogonal design that combines syntactic implicit parameters and static overloading, formalizes coherence and gives a sound, complete inference algorithm, and ships a full Koka implementation with a VS Code extension and reusable artifacts. Demonstrates practical resolution rules, an elaboration that inserts qualifiers and eta-expansions, a predictable termination cutoff that still encodes a three-state busy beaver, and reports that the approach works at scale without dictionary machinery.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 1:05Three orthogonal ideas
- 2:32Locally qualified names
- 3:55Abstraction in overloading
- 5:43Syntactic implicits explained
- 7:08Multiple type variables
- 8:58Advantages over type classes
- 10:23Live demo in Koka
- 11:28Implicits vs type classes
- 13:14Formalization and soundness
- 14:40Termination and Turing completeness
- 17:58Q&A
