Library / First Principles Framework (FPF) - Core Conceptual Specification
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 11:52:20 UTC · snapshot created 2026-10-03 11:53:41 UTC · last check 2026-10-03 12:15:10 UTC

G.4:4.2 - CAL Pack@CG-Frame surface (kit governed by this pattern)

CAL Pack@CG-Frame is the CG‑Frame’s published CAL Pack. Minimally, it provides:

  • CAL.Charter — identification and assumption basis for this CAL pack:

    • cites the exact CGFrameId, EntityOfConcernRef, and ReferencePlane,
    • cites the governance and legality records (CNSpecRef, CGSpecRef) by edition,
    • records the assumption envelope on which the acceptance predicates rely without minting another governance or legality record.
  • TaskMap — the conditional G.4 handoff record to G.5 when CAL gates are current; one exact edition names the task, cites the already constituted C.22 TaskSignatureRef and exact charter edition, and cites the acceptance-clause, operator, flow, and evidence-profile refs that selection actually consumes. It does not constitute the TaskSignature or contain threshold values.

  • CAL.Operator[] — UTS‑published typed operation declarations governed by A.6.1; a card declares possible arguments, result kinds, and conditions but does not assert that an operation ran:

    • explicit signature over CHR types,
    • explicit preconditions/postconditions (incl. legality guard macros references),
    • explicit provenance/evidence hooks (by ids/pins, not by tool behavior).
  • CAL.Acceptance[] — typed predicate declarations whose use is bounded by the declared ClaimScope, evaluation window, and any separate qualification window; a clause declares how an actual application is judged but is not itself a verdict:

    • binds to CHR characteristic ids and to exact A.6.1 argument declarations for admissible C.16 measurement-result epistemes (and, when inducing numeric comparison or aggregation, to CG‑Spec.characteristic ids),
    • keeps the exact current result episteme in the later application binding rather than in the reusable clause,
    • exposes unknown handling and failure behavior via policy pins.

Each resultInputDeclarationRef resolves an A.6.1 ArgumentDeclaration whose meaning names the C.16 measurement-result episteme expected by the clause, whose exact ValueKind and binding designation rule are explicit, and whose admissibility conditions require the named Characteristic and result shape. A deliberately one-off clause may also cite an already existing episteme in fixedResultEpistemeRefs[]?; mark that clause one-off instead of presenting it as reusable.

  • CAL.Flow[] — legality‑checked declarations of possible operator composition; a declared DAG is not performed work:

    • declares result kind (scalar only when lawful; selected-set / set-result when partial orders remain partial orders),
    • records which acceptance clauses gate which flows.
  • CAL.EvidenceProfiles — evidence wiring surface:

    • lane tags (F/G/R) / provenance anchors / policy pins needed for SCR and audit surfaces,
    • explicit freshness/decay hooks (freshness window + decay/Γ_time selectors) as pinned policies/refs (not prose).
    • explicit ReferencePlane and any used penalty-policy refs (Φ(CL), Ψ(CL^k), Φ_plane); the ProofLedger supplies the receiving quantity, scale, input meanings, assumptions, and derivation or calibration. Monotonicity and boundedness alone do not justify a numerical loss.
  • Optional CAL.NQD[] — QD/OEE‑related calculus surfaces when declared:

    • descriptor/distance/insertion artifacts are pinned by ids/editions,
    • semantics are governed by method‑specific governing definitions (e.g., C.18, C.19) and not redefined by CAL. A CAL clause that consumes G.7 calibration states its exact receiving use and premises. A locally justified CL threshold is an additional policy condition; the ProofLedger and named authority must support that condition. It does not replace the bounded-use claim, target classification or reliance result. A policy waiver changes only the authorized policy condition.
  • CAL.ProofLedger — a proof/justification ledger:

    • links operator/flow/clause ids to their needed legality and soundness results; a numerical support fold includes the B.3/C.2.2 receiving model, compatible scales and inputs, dependence assumptions, and boundary behavior.
  • Publication artifacts:

    • UTS Name Cards (twin labels) for all public ids,
    • RSCR tests ids and Worked‑Examples ids,
    • deprecation notices and edition bump notes as public-id continuity records.

Boundary discipline (normative):

  • No shadow specs: CAL artefacts cite CN‑Spec/CG‑Spec and do not introduce competing “local specs” (delegated; see CC‑GCORE‑CN‑CG‑1 via CC‑G4‑CoreRef).
  • Shipping boundary: G.10 governs shipping; see CC-GCORE-SKP-1 via CC-G4-CoreRef.
  • Refresh boundary: CAL publishes pins/payload for refresh; G.11 governs refresh orchestration.

Minimal schema fragments (notation‑independent; fields for citation, not an implementation schema):

CAL.Charter :=
  ⟨ charterId, charterEdition, cgFrameId, entityOfConcernRef, referencePlaneRef,
    CNSpecRef.edition, CGSpecRef.edition, assumptionEnvelope ⟩
CALCharterRef := <charterId, charterEdition>

TaskMap :=
  ⟨ taskMapId, taskMapEdition, charterRef := CALCharterRef,
    taskRef, taskSignatureRef := TaskSignatureRef,
    acceptanceClauseRefs[], operatorRefs[], flowRefs[], evidenceProfileRefs[] ⟩
TaskMapRef := <taskMapId, taskMapEdition>

CAL.Pack@CG-Frame :=
 ⟨ calPackId, charterRef, taskMapRef, operatorIds[], acceptanceClauseIds[], flowIds[],
 evidenceProfileIds[], proofLedgerId, nqdIds[]?,
    utsRowIds[], workedExampleIds[], rscrTestIds[], publicIdContinuityNoteIds[] ⟩

CAL.Operator :=
  ⟨ operatorId(UTS), signature(CHR-typed), preconditions[], postconditions[],
  evidenceProfileRefs[]?, failureBehaviorRef?, crossingRefs[]? ⟩

CAL.Acceptance :=
  ⟨ clauseId(UTS), characteristicRefs[], resultInputDeclarationRefs[],
    fixedResultEpistemeRefs[]?,              // deliberately one-off clause only
    cgSpecCharacteristicRefs[]?, predicateRef, claimScopeRef,
    evaluationWindow, qualificationWindow?, unknownHandlingRef,
    failureBehaviorRef, evidenceProfileRefs[]?, crossingRefs[]? ⟩

CAL.Flow :=
  ⟨ flowId(UTS), dag(operatorIds, edges), gateClauses(acceptanceClauseIds),
    resultKind, decisionAidPolicyRef? ⟩

CAL.EvidenceProfile :=
  ⟨ evidenceProfileId(UTS), lanes(F/G/R), anchors(A.10)[],
    freshnessPolicyPins[]?, penaltyPolicyPins[]?, ΓFoldRef.edition? ⟩

CALCharterRef and TaskMapRef each resolve one immutable edition. A changed charter, task, TaskSignature edition, clause, operator, flow, evidence profile, or edition-bearing cited list creates a new taskMapEdition; an old TaskMapRef continues to resolve its old values. The C.22 TaskSignature remains a separately constituted episteme. The map relates that exact signature to the CAL declarations used by selection but neither derives the signature nor duplicates their thresholds.

When CAL authoring relies on SoTA coverage, consume G.2’s pack CoverageJudgementRef with its HarvestPolicy basis and receiving question. Preserve the distinction between family coverage and lineage/material-entry plurality. A CAL clause does not turn a combined method/generator count into method-only coverage.