Decidable By Construction: Design-Time Verification for Truly Fearless Systems

arXiv:2603.25414 · cs.PL, cs.AI, cs.LG, cs.LO · Submitted 2026-03-26 · Read on arXiv

cs.PL, cs.AI, cs.LG, cs.LO

Submitted: 2026-03-26

Updated: 2026-10-15

Terminology

• Hypergraph — 1× in this paper · explained in 2 episodes
• Sparsity — 1× in this paper · explained in 4 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• Dimensional Type Systems and Deterministic Memory Management: Design-Time Semantic Preservation in Native Compilation
• Gradients without Backpropagation
• The Program Hypergraph: Multi-Way Relational Structure for Geometric Algebra, Spatial Compute, and Physics-Aware Compilation
• Negative and Fractional Types in the Fidelity Framework
• Adaptive Domain Models: Bayesian Evolution, Warm Rotation, and Principled Training for Geometric and Neuromorphic AI
• Hierarchical Reasoning Model
• The $\mathbf{Y}$-Combinator for LLMs: Solving Long-Context Rot with $\lambda$-Calculus
• Fixed-Point Scaffolding in the Clef Programming Language
• Beyond Backpropagation: Optimization with Multi-Tangent Forward Gradients
• Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models
• Position: Categorical Deep Learning is an Algebraic Theory of All Architectures

Related papers

• Language-Based Agent Control
• ANEForge: Python for direct computation on the Apple Neural Engine
• Volition Elicitation: Operational Semantics for People and Their Machines
• Griotte: Verified Compartmentalisation via Capabilities
• GraphMend: Code Transformations for Fixing Graph Breaks in PyTorch 2
• Two Birds One Stone: Effective Static Detection of Resource and Communication Deadlocks in Rust Programs