From ML to MLF

Didier Rémy, Boris Yakobowski
2008 SIGPLAN notices  
ML F is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type inference in both ML or ML F . We show that this constraint system is a small extension of the formalism of graphic types, originally introduced to represent ML F types. We give a few semantic preserving transformations on constraints and propose a strategy for applying them to solve constraints. We show that the
more » ... ting algorithm has optimal complexity for ML F type inference, and argue that, as for ML, this complexity is linear under reasonable assumptions.
doi:10.1145/1411203.1411216 fatcat:auekis6qnfamzhpnx6curkrakq