Explaining type inference
- 31 July 1996
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 27 (1) , 37-83
- https://doi.org/10.1016/0167-6423(95)00007-0
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Report on the programming language HaskellACM SIGPLAN Notices, 1992
- The calculus of context relationsActa Informatica, 1991
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple UnificationJournal of Logic and Computation, 1991
- Unification: a multidisciplinary surveyACM Computing Surveys, 1989
- Basic polymorphic typecheckingScience of Computer Programming, 1987
- The PSG system: from formal language definitions to interactive programming environmentsACM Transactions on Programming Languages and Systems, 1986
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Linear unificationJournal of Computer and System Sciences, 1978
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965