CDIP v1.1 — P20-IND v0.2 Recursive Type Universe (IND-ADT Fragment) PlanAST as an Audited Inductive Core Extension
Abstract
We upgrade CDIP v1.1 P20-IND to v0.2 by selecting the PlanAST target fragment and closing three audit-critical obligations: (i) an explicit, computable label-flow firewall that hard- prevents AUX-to-CORE recursive smuggling in type formation; (ii) a pure-function (referential transparency ) constraint for gate evaluation; and (iii) a concrete binding interface to WCCC external anchors (Human or Proof Assistant + DOI), reusing FQC-Merkle semantics. The resulting contract is an inductive, auditable recursive type universe restricted to a first-order ADT fragment (no arrows, no bottom, no higher-order recursion), with an earliest-fail total order and machine-checkable reason codes.
Fields of Study & Subjects
Logic
programming
and type systems
Formal Methods in Verification
Computability
AI Algorithms
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 31 January 2026
- Document type
- Preprint