FreezeML: complete and easy type inference for first-class polymorphism
Frank Emrich, Sam Lindley, Jan Stolarek, James Cheney, Jonathan Coates
Abstract
ML is remarkable in providing statically typed polymorphism without the programmer ever having to write any type annotations. The cost of this parsimony is that the programmer is limited to a form of polymorphism in which quantifiers can occur only at the outermost level of a type and type variables can be instantiated only with monomorphic types.
Topics & Concepts
ProgrammerType inferenceComputer scienceProgramming languageType (biology)InferencePolymorphism (computer science)SubtypingType theoryAlgorithmTheoretical computer scienceData typeStatistical inferenceDependent typeArtificial intelligenceMathematicsInference systemPopulationParallel Computing and Optimization TechniquesLogic, programming, and type systemsScientific Computing and Data Management