Reynolds's polymorphic lambda calculus
- type theory
John Reynolds independently developed a polymorphic lambda calculus in the early 1970s, presenting it in work on type structure. Like Girard’s System F, it supports abstraction over types, giving a precise setting for uniform polymorphic functions. Reynolds’s broader research connected language design, semantics and reasoning about representation. The independent origins matter historically: a common formal idea arose from related but distinct investigations. Later parametricity results should be treated as further developments, not all collapsed into the first presentation of the calculus. **Timeline anchor:** 1 January 1974 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/System_F), [Source 2](https://en.wikipedia.org/wiki/John_C._Reynolds).
Sources
Related
On other timelines
- Reynolds independently develops polymorphic type structure on Type theory · foundations, languages, proof assistants and program logics by @athan