Explaining Type Inference

@article{Duggan1996ExplainingTI,
  title={Explaining Type Inference},
  author={Dominic Duggan and Frederick Bent},
  journal={Sci. Comput. Program.},
  year={1996},
  volume={27},
  pages={37-83}
}
Type inference is the compile-time process of reconstructing missing type information in a program based on the usage of its variables. ML and Haskell are two languages where this aspect of compilation has enjoyed some popularity, allowing type information to be omitted while static type checking is still performed. Type inference may be expected to have some application in the prototyping and scripting languages which are becoming increasingly popular. A difficulty with type inference is the… Expand
Precise explanation of success typing errors
Scripting the type inference process
Decrypting Local Type Inference
Type debugging in functional languages
Static Type Inference for a First-Order Declarative Visual Programming Language with Inheritance
Compositional explanation of types and algorithmic debugging of type errors
Explaining ML Type Errors by Data Flows
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 62 REFERENCES
Type inference in the presence of type abstraction
A maximum-flow approach to anomaly isolation in unification-based incremental type inference
Type checking type classes
Finding the source of type errors
  • M. Wand
  • Computer Science
  • POPL '86
  • 1986
Basic Polymorphic Typechecking
Type Classes and Overloading Resolution via Order-Sorted Unification
Efficient Type Inference Using Monads (Summary)
  • K. Hammond
  • Computer Science
  • Functional Programming
  • 1991
Topics in advanced language implementation
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
Types in Logic Programming
...
1
2
3
4
5
...