AWhat changed
PRG-2 combines information approximation, complete-lattice types, continuity, effective bases and a recursive self-function-space outline to model higher-order computation mathematically.
Scientific scope
PRG-2 combines information approximation, complete-lattice types, continuity, effective bases and a recursive self-function-space outline to model higher-order computation mathematically. The function space contains continuous mappings, not every set-theoretic function; the recursive domain equation holds up to isomorphism. An effective basis is additional structure: continuity alone does not make every element computable. PRG-2 sketches construction and store/procedure semantics rather than fully proving all later domain-theory or compiler-correctness results. Originality/first-model claims are not independently certified.
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
- Dana Scott · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Dana Scott, Outline of a Mathematical Theory of Computation, Oxford Programming Research Group Technical Monograph PRG-2 (November 1970)
- Oxford Computer Science publication record: Outline of a Mathematical Theory of Computation, PRG 02
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