Syntactic Type Soundness for HM(X)
Christian Skalka, François Pottier · Electronic Notes in Theoretical Computer Science · 2003
The HM(X) framework is a constraint-based type framework with built-in let-polymorphism. This paper establishes purely syntactic type soundness for the framework, treating an extended version of the language containing state and recursive binding. These results demonstrate that any instance of HM(X), comprising a specialized constraint system and possibly additional functional constants and their types, enjoys syntactic type soundness.