{"title": "Semantics evidence",
 "producer":
 ["GENERATED by tools/Drivers/Semantics.lean (make gen-semantics); do not edit",
  "format: effect4-semantics-report v8",
  "command: make gen-semantics",
  "inputs: tools/ProofGraph/Registry.lean, tools/Tools/Semantics.lean, tools/Drivers/Semantics.lean, tools/Tools/SemanticsDisplay.lean, tools/Tools/SemanticsDocument.lean, tools/Tools/Document.lean, tools/Tools/Document/Json.lean, src/Effect4/Laws/Auto/Semantics.lean, Test/Counterexamples/REGISTER.md, docs/core/decisions.md, lean-toolchain"],
 "format": "effect4-document/1",
 "body":
 [{"line":
   [{"text": "Effect4 makes "},
    {"text": "216 claims about Effect's runtime: "},
    {"text": "198 "},
    {"status": "proved"},
    {"text": ", "},
    {"text": "12 "},
    {"status": "modulo"},
    {"text": ", "},
    {"text": "1 "},
    {"status": "goal"},
    {"text": ", "},
    {"text": "1 "},
    {"status": "refuted"},
    {"text": ", "},
    {"text": "3 "},
    {"status": "absent"},
    {"text": ", "},
    {"text": "1 "},
    {"status": "assumed"},
    {"text": "."}],
   "kind": "para"},
  {"line":
   [{"text":
     "A claim's evidence comes from its Lean declaration and is never written by hand (decisions row 203). "},
    {"ref": "open", "label": "The open work"},
    {"text":
     " lists the planned goals that the remaining claims rest on, and why each waits."}],
   "kind": "para"},
  {"line":
   [{"text": "Every witness uses no axiom beyond "},
    {"code": "propext"},
    {"text": " and "},
    {"code": "Quot.sound"},
    {"text":
     ", or the page is not written. That ceiling covers the evidence shown here, not the whole library. "},
    {"text":
     "A claim's English is written by hand. A placement that a declaration inherits from its module is provisional."}],
   "kind": "para"},
  {"line":
   [{"text":
     "A register record links a claim to a historical attack. Read the whole row: an early status word "},
    {"text": "may stand beside a later repair."}],
   "kind": "para"},
  {"title": "How to read a status",
   "kind": "part",
   "key": "statuses",
   "body":
   [{"lines":
     [[{"status": "proved"},
       {"text": ": a theorem whose proof rests on no planned goal."}],
      [{"status": "modulo"},
       {"text":
        ": a theorem proved from planned goals; it names the goals it rests on."}],
      [{"status": "goal"},
       {"text": ": a planned goal ("},
       {"code": "proof_goal"},
       {"text": "), a statement whose proof is still "},
       {"code": "sorry"},
       {"text": "; a claim whose statement is one."}],
      [{"status": "open"},
       {"text":
        ": a requirement with a node not yet proved, or a part not yet stated as a goal."}],
      [{"status": "refuted"},
       {"text": ": a register record refutes the claim with a theorem."}],
      [{"status": "absent"},
       {"text":
        ": no declaration states the claim yet; its row gives the reason."}],
      [{"status": "assumed"},
       {"text":
        ": the claim is taken from an outside source, with its reason."}],
      [{"status": "missing"},
       {"text": ": in the plan, a name that no node holds."}]],
     "kind": "items"}]},
  {"lines":
   [[{"link": "open/", "label": "Open work"},
     {"text": ": "},
     {"text":
      "The open part of the plan: 11 planned goals, and 26 theorems proved modulo them. "},
     {"text":
      "A goal's docstring, written with its statement, says why its proof waits. A chain shows how a theorem "},
     {"text":
      "reaches a goal. Each step is an edge of the plan, from a node to a node its proof reaches first."}],
    [{"link": "store-typing/", "label": "Store Typing"},
     {"text": ": "},
     {"text":
      "World-indexed semantic value membership (Fits) and store typings. "},
     {"text": "21 claims: "},
     {"text": "20 "},
     {"status": "proved"},
     {"text": ", "},
     {"text": "1 "},
     {"status": "absent"},
     {"text": "."}],
    [{"link": "residual-program-typing/", "label": "Residual Program Typing"},
     {"text": ": "},
     {"text":
      "TypedProg, the protocol-indexed judgment on residual programs. "},
     {"text": "20 claims: "},
     {"text": "19 "},
     {"status": "proved"},
     {"text": ", "},
     {"text": "1 "},
     {"status": "refuted"},
     {"text": "."}],
    [{"link": "scope-lifetime-finalization/",
      "label": "Scope Lifetime & Finalization"},
     {"text": ": "},
     {"text": "Lifetimes, finalizer registration, and LIFO unwinding. "},
     {"text": "16 claims: "},
     {"text": "15 "},
     {"status": "proved"},
     {"text": ", "},
     {"text": "1 "},
     {"status": "goal"},
     {"text": "."}],
    [{"link": "reactive-scheduling/", "label": "Reactive Scheduling"},
     {"text": ": "},
     {"text":
      "Multi-fiber execution, decision steps, and configuration invariants. "},
     {"text": "25 claims: "},
     {"text": "19 "},
     {"status": "proved"},
     {"text": ", "},
     {"text": "4 "},
     {"status": "modulo"},
     {"text": ", "},
     {"text": "2 "},
     {"status": "absent"},
     {"text": "."}],
    [{"link": "exact-codecs/", "label": "Exact Codecs"},
     {"text": ": "},
     {"text": "Invertible embeddings for JSON and Schema representations. "},
     {"text": "19 claims: "},
     {"text": "19 "},
     {"status": "proved"},
     {"text": "."}],
    [{"link": "subtyping-algebra/", "label": "Subtyping Algebra"},
     {"text": ": "},
     {"text": "Preorder laws, normalization, and join-semilattice on CTy. "},
     {"text": "13 claims: "},
     {"text": "13 "},
     {"status": "proved"},
     {"text": "."}],
    [{"link": "initial-algebras-folds/", "label": "Initial Algebras & Folds"},
     {"text": ": "},
     {"text": "Free syntax objects, catamorphisms, and fold uniqueness. "},
     {"text": "33 claims: "},
     {"text": "33 "},
     {"status": "proved"},
     {"text": "."}],
    [{"link": "context-requirements/", "label": "Context Requirements"},
     {"text": ": "},
     {"text": "Graded coeffects, requirement rows, and layer discharge. "},
     {"text": "8 claims: "},
     {"text": "8 "},
     {"status": "proved"},
     {"text": "."}],
    [{"link": "host-session-protocol/", "label": "Host Session Protocol"},
     {"text": ": "},
     {"text":
      "Session automaton, external reply ingestion, and boundary capabilities. "},
     {"text": "12 claims: "},
     {"text": "11 "},
     {"status": "proved"},
     {"text": ", "},
     {"text": "1 "},
     {"status": "assumed"},
     {"text": "."}],
    [{"link": "translation-simulation/", "label": "Translation & Simulation"},
     {"text": ": "},
     {"text": "Semantic preservation, replay relations, and capstone M7. "},
     {"text": "49 claims: "},
     {"text": "41 "},
     {"status": "proved"},
     {"text": ", "},
     {"text": "8 "},
     {"status": "modulo"},
     {"text": "."}],
    [{"link": "applicability/", "label": "Applicability decisions"}],
    [{"link": "placement/", "label": "Placement"},
     {"text": ": "},
     {"text":
      "theorems of the registry's concept-named modules; auxiliary names and planned goals excluded"}],
    [{"link": "plan/", "label": "Plan"},
     {"text": ": "},
     {"text":
      "The requirements and their nodes. A node is a planned goal (a theorem whose body is "},
     {"code": "sorry"},
     {"text": ", declared by "},
     {"code": "proof_goal"},
     {"text": ") or a theorem a requirement names. "},
     {"text": "Its status is derived from its proof, with goals as leaves ("},
     {"code": "tools/ProofGraph/Plan.lean"},
     {"text":
      ", decisions row 203). The status is goal, modulo (proved from the goals it rests on), or proved. "},
     {"text":
      "An edge goes from a node to the nodes its proof reaches first."}],
    [{"link": "acceptance/", "label": "Acceptance programs"},
     {"text": ": "},
     {"text":
      "The rc.112 probe programs as acceptance tests (decisions row 206; "},
     {"code": "Test/Dogfood/README.md"},
     {"text": "). Each row is the "},
     {"code": "stage"},
     {"text":
      " its battery declares, which a guard ties to the battery's own measurement, and the requirements it "},
     {"code": "waitsOn"},
     {"text": ". A slice that moves a program edits both."}]],
   "kind": "items"}]}