Soft typing with conditional types
Alex Aiken, Edward L. Wimmers, T. K. Lakshman · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1994
We present a simple and powerful type inference method for dynamically typed languages where no type information is supplied by the user. Type inference is reduced to the problem of solvability of a system of type inclusion constraints over a type language that includes function types, constructor types, union, intersection, and recursive types, and conditional types. Conditional types enable us to analyze control flow using type inference, thus facilitating computation of accurate types. We demonstrate the power and practicality of the method with examples and performance results from an implementation.
Cited by 215 works. doi:10.1145/174675.177847 Open-access PDF
Authors
References
- A theory of type polymorphism in programming
- Can programming be liberated from the von Neumann style?
- Principal type-schemes for functional programs
- Flow analysis and optimization of LISP-like structures
- Coercion and type inference
- Operational Semantics and Polymorphic Type Inference
- An ideal model for recursive polymorphic types
- Automatic computation of data set definitions
- Soft typing
- Control flow analysis in scheme