Parametric Subtyping for Structural Parametric Polymorphism
summary
Paper proves structural subtyping is undecidable for recursive type constructors and defines parametric subtyping as a decidable fragment that enforces Reynolds-style parametricity on type constructors. Decision procedure has two phases: a forward saturation-based decision procedure that computes admissible parametric rules and a terminating backward construction to build derivations. Works on examples like stacks (pushes/pops), even/odd natural numbers, and serialized binary trees, and an implementation/artifact is available for reuse.
AI-written summary · about
chapters (11)
- 0:00Parametric subtyping intro
- 2:35Recursive type constructors
- 3:42Key idea behind subtyping
- 6:14Saturation fails with constructors
- 8:06Subtyping rules explained
- 9:10Decision procedure
- 12:49Serialized binary trees example
- 13:50Contributions and future work
- 14:58Q&A: Session types limits
- 16:17Q&A: Restrictions obstacles
- 17:25Q&A: Forward phase computation
