Type Inference with Polymorphic Recursion
Abstract
Henglein(1) The resulting typing discipline cannot be explained in a syntax-directed fashion, but is rather reminiscent of data-flow oriented reasoning.This
Related papers
- Sound Polymorphic Type Inference for Objects OOPSLA 1995
- Polymorphic Functions with Set-Theoretic Types: Part 2: Local Type Inference and Type Reconstruction POPL 2015
- Let Generalization, Polymorphic Recursion, and Variable Minimization in Boolean-Kinded Type Systems POPL 2026
- Polymorphic type inference for machine code PLDI 2016
- Implementation of the Typed Call-by-Value lambda-Calculus using a Stack of Regions POPL 1994
- When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism POPL 2024
- Global Type Inference for Featherweight Generic Java ECOOP 2022
- Type inference, principal typings, and let-polymorphism for first-class mixin modules ICFP 2005