The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism
Abstract elided by the publisher.
Related papers
- Quantifier Elimination and Parametric Polymorphism in Programming Languages JFP 1992
- Parametric polymorphism for XML POPL 2005
- Polymorphic types and effects with Boolean unification OOPSLA 2020
- A simple library implementation of binary sessions JFP 2017
- A quick look at impredicativity ICFP 2020
- Constraint-Based Type Inference and Parametric Polymorphism SAS 1994
- From Polyvariant flow information to intersection and union types JFP 2001
- HMF: simple type inference for first-class polymorphism ICFP 2008