{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "iverson-array-oriented-algorithm-notation-1962",
    "title": "Iverson: describing an algorithm as transformations of arrays",
    "summary": "Iverson presents a unified notation for describing algorithms over vectors and matrices, combining elementwise operations with selection, reduction and generalized products instead of spelling out every scalar loop.\n\nSuppose a calculation must select some entries from a list, compare two lists and combine their values. A scalar description can bury the main idea beneath repeated indexing and branching. Iverson treats structured data and families of operations as part of the language, so the reader can see the transformation as a whole. The1962book develops this notation for mathematical description and analysis; it does not by itself establish a faster computer implementation. Later APL implementations changed details of the notation and involved additional contributors. This record keeps the original book contribution separate from those implementations and from the mathematical operations it reuses.",
    "boundary": "The assessed notation is the 1962 book’s opening framework, not every later APL convention. Array dimensions, operator domains and algebraic assumptions matter. Its historical reduction order differs from later variants; inverse notation needs domain/range choices. The goal is descriptive clarity, not a universal speed or productivity gain. Later chapters and implementations are outside the reviewed scope.",
    "area": "Programming languages and array algorithms",
    "topic": "Computing",
    "year": 1962,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "iverson-array-oriented-algorithm-notation-1962",
    "target": {
      "record_id": "urn:uuid:732419fe-6791-4e0c-a4ec-4344452a3017",
      "version": 1,
      "content_hash": "sha256:95c86f1c254d57cae94e58cc03b72c76db1014eff166449727338be33ba913b6"
    },
    "humans": [
      "Kenneth E. Iverson"
    ],
    "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",
      "fortran-compiler",
      "stroustrup-cpp-programming-language-1985"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-iverson-array-notation-1962-original",
        "title": "Kenneth E. Iverson, A Programming Language (1962), later-printing original book facsimile",
        "url": "https://softwarepreservation.computerhistory.org/apl/book/APROGRAMMINGLANGUAGE.pdf"
      },
      {
        "id": "wrs24-falkoff-iverson-apl-evolution-1978-partial",
        "title": "Adin D. Falkoff and Kenneth E. Iverson, The Evolution of APL (1978), author retrospective",
        "url": "https://www.cs.tufts.edu/comp/150FP/archive/ken-iverson/evolution-apl.pdf"
      },
      {
        "id": "wrs24-chm-apl-target-archive",
        "title": "Computer History Museum APL collection: target bibliography and archive provenance",
        "url": "https://softwarepreservation.computerhistory.org/apl/"
      }
    ],
    "points": "150000",
    "published_grade": {
      "id": "iverson-array-oriented-algorithm-notation-1962",
      "entry_id": "iverson-array-oriented-algorithm-notation-1962",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:732419fe-6791-4e0c-a4ec-4344452a3017",
        "version": 1,
        "content_hash": "sha256:95c86f1c254d57cae94e58cc03b72c76db1014eff166449727338be33ba913b6"
      },
      "what_changed": "Unified array-oriented notation for algorithm description and analysis.",
      "scope": "Unified array-oriented notation for algorithm description and analysis. The assessed notation is the 1962 book’s opening framework, not every later APL convention. Array dimensions, operator domains and algebraic assumptions matter. Its historical reduction order differs from later variants; inverse notation needs domain/range choices. The goal is descriptive clarity, not a universal speed or productivity gain. Later chapters and implementations are outside the reviewed scope.",
      "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:732419fe-6791-4e0c-a4ec-4344452a3017",
        "version": 1,
        "content_hash": "sha256:95c86f1c254d57cae94e58cc03b72c76db1014eff166449727338be33ba913b6"
      },
      "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": "Kenneth E. Iverson",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Kenneth E. Iverson, A Programming Language (1962), later-printing original book facsimile",
            "url": "https://softwarepreservation.computerhistory.org/apl/book/APROGRAMMINGLANGUAGE.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Kenneth E. Iverson, A Programming Language (1962), later-printing original book facsimile",
            "url": "https://softwarepreservation.computerhistory.org/apl/book/APROGRAMMINGLANGUAGE.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Adin D. Falkoff and Kenneth E. Iverson, The Evolution of APL (1978), author retrospective",
            "url": "https://www.cs.tufts.edu/comp/150FP/archive/ken-iverson/evolution-apl.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-2",
          "kind": "source_reference",
          "source": {
            "citation": "Computer History Museum APL collection: target bibliography and archive provenance",
            "url": "https://softwarepreservation.computerhistory.org/apl/"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The assessed notation is the 1962 book’s opening framework, not every later APL convention. Array dimensions, operator domains and algebraic assumptions matter. Its historical reduction order differs from later variants; inverse notation needs domain/range choices. The goal is descriptive clarity, not a universal speed or productivity gain. Later chapters and implementations are outside the reviewed scope.",
        "domain": "Programming languages and array algorithms"
      },
      "sources": [
        {
          "citation": "Kenneth E. Iverson, A Programming Language (1962), later-printing original book facsimile",
          "url": "https://softwarepreservation.computerhistory.org/apl/book/APROGRAMMINGLANGUAGE.pdf"
        },
        {
          "citation": "Adin D. Falkoff and Kenneth E. Iverson, The Evolution of APL (1978), author retrospective",
          "url": "https://www.cs.tufts.edu/comp/150FP/archive/ken-iverson/evolution-apl.pdf"
        },
        {
          "citation": "Computer History Museum APL collection: target bibliography and archive provenance",
          "url": "https://softwarepreservation.computerhistory.org/apl/"
        }
      ],
      "statement": "# Iverson: describing an algorithm as transformations of arrays\n\nIverson presents a unified notation for describing algorithms over vectors and matrices, combining elementwise operations with selection, reduction and generalized products instead of spelling out every scalar loop.\n\nSuppose a calculation must select some entries from a list, compare two lists and combine their values. A scalar description can bury the main idea beneath repeated indexing and branching. Iverson treats structured data and families of operations as part of the language, so the reader can see the transformation as a whole. The1962book develops this notation for mathematical description and analysis; it does not by itself establish a faster computer implementation. Later APL implementations changed details of the notation and involved additional contributors. This record keeps the original book contribution separate from those implementations and from the mathematical operations it reuses.\n\n## Scientific scope\n\nThe assessed notation is the 1962 book’s opening framework, not every later APL convention. Array dimensions, operator domains and algebraic assumptions matter. Its historical reduction order differs from later variants; inverse notation needs domain/range choices. The goal is descriptive clarity, not a universal speed or productivity gain. Later chapters and implementations are outside the reviewed scope.\n\n## People and systems\n\nKenneth E. Iverson\n\n\n\n## Original sources\n\n- [Kenneth E. Iverson, A Programming Language (1962), later-printing original book facsimile](https://softwarepreservation.computerhistory.org/apl/book/APROGRAMMINGLANGUAGE.pdf)\n- [Adin D. Falkoff and Kenneth E. Iverson, The Evolution of APL (1978), author retrospective](https://www.cs.tufts.edu/comp/150FP/archive/ken-iverson/evolution-apl.pdf)\n- [Computer History Museum APL collection: target bibliography and archive provenance](https://softwarepreservation.computerhistory.org/apl/)\n",
      "summary": "Iverson presents a unified notation for describing algorithms over vectors and matrices, combining elementwise operations with selection, reduction and generalized products instead of spelling out every scalar loop.\n\nSuppose a calculation must select some entries from a list, compare two lists and combine their values. A scalar description can bury the main idea beneath repeated indexing and branching. Iverson treats structured data and families of operations as part of the language, so the reader can see the transformation as a whole. The1962book develops this notation for mathematical description and analysis; it does not by itself establish a faster computer implementation. Later APL implementations changed details of the notation and involved additional contributors. This record keeps the original book contribution separate from those implementations and from the mathematical operations it reuses.",
      "title": "Iverson: describing an algorithm as transformations of arrays"
    },
    "record_id": "urn:uuid:732419fe-6791-4e0c-a4ec-4344452a3017",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:732419fe-6791-4e0c-a4ec-4344452a3017",
      "version": 1,
      "content_hash": "sha256:95c86f1c254d57cae94e58cc03b72c76db1014eff166449727338be33ba913b6"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:1a149426889d09a0f412d69f1fa2d6f5b64fe4cd6d698a2fa942cf22870f739c"
  },
  "target": {
    "record_id": "urn:uuid:732419fe-6791-4e0c-a4ec-4344452a3017",
    "version": 1,
    "content_hash": "sha256:95c86f1c254d57cae94e58cc03b72c76db1014eff166449727338be33ba913b6"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "iverson-array-oriented-algorithm-notation-1962",
    "entry_id": "iverson-array-oriented-algorithm-notation-1962",
    "revision": 1,
    "title": "Iverson: describing an algorithm as transformations of arrays",
    "context": "Programming languages and array algorithms",
    "track": "Programming languages and array algorithms",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Unified array-oriented notation for algorithm description and analysis.",
    "scope": "Unified array-oriented notation for algorithm description and analysis. The assessed notation is the 1962 book’s opening framework, not every later APL convention. Array dimensions, operator domains and algebraic assumptions matter. Its historical reduction order differs from later variants; inverse notation needs domain/range choices. The goal is descriptive clarity, not a universal speed or productivity gain. Later chapters and implementations are outside the reviewed scope.",
    "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": "Kenneth E. Iverson, A Programming Language (1962), later-printing original book facsimile",
        "url": "https://softwarepreservation.computerhistory.org/apl/book/APROGRAMMINGLANGUAGE.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "Adin D. Falkoff and Kenneth E. Iverson, The Evolution of APL (1978), author retrospective",
        "url": "https://www.cs.tufts.edu/comp/150FP/archive/ken-iverson/evolution-apl.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "Computer History Museum APL collection: target bibliography and archive provenance",
        "url": "https://softwarepreservation.computerhistory.org/apl/",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Kenneth E. Iverson",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:732419fe-6791-4e0c-a4ec-4344452a3017",
      "version": 1,
      "content_hash": "sha256:95c86f1c254d57cae94e58cc03b72c76db1014eff166449727338be33ba913b6"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "150000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}