Type inference with polymorphic recursion
Fritz Henglein · ACM Transactions on Programming Languages and Systems · 1993
Henglein(1) The resulting typing discipline cannot be explained in a syntax-directed fashion, but is rather reminiscent of data-flow oriented reasoning.This
Cited by 221 works. doi:10.1145/169701.169692 Open-access PDF
Authors
References
- Lecture Notes in Computer Science 1205
- Compilers: Principles, Techniques, and Tools
- A theory of type polymorphism in programming
- Handbook of theoretical computer science
- The Definition of Standard ML
- The Lambda Calculus - Its Syntax and Semantics
- On understanding types, data abstraction, and polymorphism
- Principal type-schemes for functional programs
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- The principle type-scheme of an object in combinatory logic