Hindley's principal type schemes
- type theory
Roger Hindley’s 1969 result established principal type schemes for the relevant combinatory-logic setting. A typable expression has a most general scheme that captures the range of its valid typings through substitution. The result became part of the theoretical basis for practical type inference, later associated with Hindley–Milner systems. It is a theorem about a specified type discipline, not a guarantee that every expressive type system can infer all annotations. The connection shows how foundational logic can become a useful programming-language mechanism. **Timeline anchor:** 1 January 1969 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Hindley–Milner_type_system).
Sources
Related
On other timelines
- Hindley proves a principal type-scheme result on Type theory · foundations, languages, proof assistants and program logics by @athan