AWhat changed
Let-local polymorphism and constrained non-generic parameter variables are organized into a usable type discipline, a recursive inference algorithm and separate semantic/syntactic soundness theorems for Exp.
Scientific scope
Let-local polymorphism and constrained non-generic parameter variables are organized into a usable type discipline, a recursive inference algorithm and separate semantic/syntactic soundness theorems for Exp. The proof concerns Exp under a respecting environment and its defined type-error semantics. It does not prove termination, arbitrary program correctness or full imperative-ML safety. Completeness/most-general inference is conjectured here, not proved; the stateful polymorphic-list example exposes an extension failure. Hindley's principal schemes and Robinson's unification are inherited, and later Damas–Milner results remain separate.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Robin Milner · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Robin Milner, A Theory of Type Polymorphism in Programming, Journal of Computer and System Sciences 17(3), 348–375 (1978), DOI 10.1016/0022-0000(78)90014-4
- University of Edinburgh Research Explorer: A theory of type polymorphism in programming
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction