Efficient Type Inference Using Monads (Summary)

This publication has 7 references indexed in Scilit:

• A theory of type polymorphism in programming
  Published by Elsevier ,2003
• Type inference with polymorphic recursion
  ACM Transactions on Programming Languages and Systems, 1993
• Deciding ML typability is complete for deterministic exponential time
  Published by Association for Computing Machinery (ACM) ,1990
• ML typability is dexptime-complete
  Published by Springer Nature ,1990
• An Efficient Unification Algorithm
  ACM Transactions on Programming Languages and Systems, 1982
• Principal type-schemes for functional programs
  Published by Association for Computing Machinery (ACM) ,1982
• Linear unification
  Journal of Computer and System Sciences, 1978