{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "scott-lattice-computation-outline-1970",
    "title": "Scott: lattice models for computation and self-application",
    "summary": "Scott's PRG-2 monograph organized partial computational information as ordered approximations in complete lattices, with continuous mappings and effective bases supporting mathematical program semantics.\n\nThe outline describes products, sums and continuous function spaces, then a limiting construction whose elements can themselves represent functions on the same space. This supplies a mathematical account of recursive data and self-application beyond recording execution steps.",
    "boundary": "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.",
    "area": "Mathematical semantics of programming languages",
    "topic": "Computer science",
    "year": 1970,
    "lane": "HUMAN",
    "result": "THEORY",
    "package_id": "scott-lattice-computation-outline-1970",
    "target": {
      "record_id": "urn:uuid:713459cc-11df-42ea-add9-193ba2b802ab",
      "version": 1,
      "content_hash": "sha256:191713de45c7d0b33d82ccf9d835459ad9c07c1d48e8068bdafff44f608ac931"
    },
    "humans": [
      "Dana Scott"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "lisp-recursive-functions",
      "hoare-program-logic",
      "floyd-assigning-meanings-programs-1967"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-scott-outline-computation-1970",
        "title": "Dana Scott, Outline of a Mathematical Theory of Computation, Oxford Programming Research Group Technical Monograph PRG-2 (November 1970)",
        "url": "https://www.cs.ox.ac.uk/files/3222/PRG02.pdf"
      },
      {
        "id": "wrs24-oxford-scott-prg2-metadata",
        "title": "Oxford Computer Science publication record: Outline of a Mathematical Theory of Computation, PRG02",
        "url": "https://www.cs.ox.ac.uk/publications/publication3720-abstract.html"
      }
    ],
    "points": "210000",
    "published_grade": {
      "id": "scott-lattice-computation-outline-1970",
      "entry_id": "scott-lattice-computation-outline-1970",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:713459cc-11df-42ea-add9-193ba2b802ab",
        "version": 1,
        "content_hash": "sha256:191713de45c7d0b33d82ccf9d835459ad9c07c1d48e8068bdafff44f608ac931"
      },
      "what_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.",
      "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.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:713459cc-11df-42ea-add9-193ba2b802ab",
        "version": 1,
        "content_hash": "sha256:191713de45c7d0b33d82ccf9d835459ad9c07c1d48e8068bdafff44f608ac931"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Dana Scott",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Dana Scott, Outline of a Mathematical Theory of Computation, Oxford Programming Research Group Technical Monograph PRG-2 (November 1970)",
            "url": "https://www.cs.ox.ac.uk/files/3222/PRG02.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Dana Scott, Outline of a Mathematical Theory of Computation, Oxford Programming Research Group Technical Monograph PRG-2 (November 1970)",
            "url": "https://www.cs.ox.ac.uk/files/3222/PRG02.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Oxford Computer Science publication record: Outline of a Mathematical Theory of Computation, PRG02",
            "url": "https://www.cs.ox.ac.uk/publications/publication3720-abstract.html"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "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.",
        "domain": "Mathematical semantics of programming languages"
      },
      "sources": [
        {
          "citation": "Dana Scott, Outline of a Mathematical Theory of Computation, Oxford Programming Research Group Technical Monograph PRG-2 (November 1970)",
          "url": "https://www.cs.ox.ac.uk/files/3222/PRG02.pdf"
        },
        {
          "citation": "Oxford Computer Science publication record: Outline of a Mathematical Theory of Computation, PRG02",
          "url": "https://www.cs.ox.ac.uk/publications/publication3720-abstract.html"
        }
      ],
      "statement": "# Scott: lattice models for computation and self-application\n\nScott's PRG-2 monograph organized partial computational information as ordered approximations in complete lattices, with continuous mappings and effective bases supporting mathematical program semantics.\n\nThe outline describes products, sums and continuous function spaces, then a limiting construction whose elements can themselves represent functions on the same space. This supplies a mathematical account of recursive data and self-application beyond recording execution steps.\n\n## Scientific scope\n\nThe 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.\n\n## People and systems\n\nDana Scott\n\n\n\n## Original sources\n\n- [Dana Scott, Outline of a Mathematical Theory of Computation, Oxford Programming Research Group Technical Monograph PRG-2 (November 1970)](https://www.cs.ox.ac.uk/files/3222/PRG02.pdf)\n- [Oxford Computer Science publication record: Outline of a Mathematical Theory of Computation, PRG02](https://www.cs.ox.ac.uk/publications/publication3720-abstract.html)\n",
      "summary": "Scott's PRG-2 monograph organized partial computational information as ordered approximations in complete lattices, with continuous mappings and effective bases supporting mathematical program semantics.\n\nThe outline describes products, sums and continuous function spaces, then a limiting construction whose elements can themselves represent functions on the same space. This supplies a mathematical account of recursive data and self-application beyond recording execution steps.",
      "title": "Scott: lattice models for computation and self-application"
    },
    "record_id": "urn:uuid:713459cc-11df-42ea-add9-193ba2b802ab",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:713459cc-11df-42ea-add9-193ba2b802ab",
      "version": 1,
      "content_hash": "sha256:191713de45c7d0b33d82ccf9d835459ad9c07c1d48e8068bdafff44f608ac931"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:aaa4397c795f0c4d7d285531c02fb70b93d431e3b9dad6eea8dc9f3de8814b31"
  },
  "target": {
    "record_id": "urn:uuid:713459cc-11df-42ea-add9-193ba2b802ab",
    "version": 1,
    "content_hash": "sha256:191713de45c7d0b33d82ccf9d835459ad9c07c1d48e8068bdafff44f608ac931"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "scott-lattice-computation-outline-1970",
    "entry_id": "scott-lattice-computation-outline-1970",
    "revision": 1,
    "title": "Scott: lattice models for computation and self-application",
    "context": "Mathematical semantics of programming languages",
    "track": "Mathematical semantics of programming languages",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-03",
    "evidence_cutoff": "2026-10-03",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_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.",
    "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_summary": "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.",
    "references": [
      {
        "title": "Dana Scott, Outline of a Mathematical Theory of Computation, Oxford Programming Research Group Technical Monograph PRG-2 (November 1970)",
        "url": "https://www.cs.ox.ac.uk/files/3222/PRG02.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "Oxford Computer Science publication record: Outline of a Mathematical Theory of Computation, PRG 02",
        "url": "https://www.cs.ox.ac.uk/publications/publication3720-abstract.html",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Dana Scott",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:713459cc-11df-42ea-add9-193ba2b802ab",
      "version": 1,
      "content_hash": "sha256:191713de45c7d0b33d82ccf9d835459ad9c07c1d48e8068bdafff44f608ac931"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "210000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}