Girard-Reynolds 1972 second-order lambda-calculus with universal type-quantification; basis for ML-style polymorphism; strong normalization but type-inference undecidable.
Girard-Reynolds 1972 second-order lambda-calculus with universal type-quantification; basis for ML-style polymorphism; strong normalization but type-inference undecidable.