AWhat changed
The published completeness theorem factors any derivable instance judgment through W's result and yields principal schemes/typeability decidability for the chosen discipline.
Scientific scope
The published completeness theorem factors any derivable instance judgment through W's result and yields principal schemes/typeability decidability for the chosen discipline. The target is the purely applicative skeletal language, its specified inference system and environment substitutions—not unrestricted higher-rank polymorphism, mutable-reference ML, termination or all program correctness. Detailed proofs are deferred to Damas's thesis and were not reconstructed here. Hindley's combinatory theorem and Milner 1978 soundness remain separate inherited contributions.
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
- Luis Damas · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Robin Milner · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Luis Damas and Robin Milner, Principal type-schemes for functional programs, POPL'82, 207–212 (1982), DOI 10.1145/582153.582176
- ACM Digital Library: Principal type-schemes for functional programs
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