Search arXivSearch

arXiv · 2607.27387

Extension Types for Free

Abstract

Extension types are a concept in dependent type theory that has appeared in various contexts. The idea is to have types whose terms are partially determined, e.g. via a strict boundary condition. Standard examples are path types of cubical type theories (paths with fixed endpoints), Riehl and Shulman's name-giving extension types (terms fixed on subshapes), as well as the controlled-unfolding mechanism of cooltt and Agda (terms that are fixed if a condition is met). In each case, the type theory is equipped with a (meta-theoretic) face calculus, or shape layer, that governs their rules, and comes with intended semantics. We unify all these occurrences in a single framework where no new axioms or model constructions are needed, namely two-level type theory. This step, too, is free (semantically): the standard models of HoTT are automatically models of 2LTT, and the theory is conservative over HoTT. Extension types are definable, and the definition validates Riehl and Shulman's entire extension-type calculus: the rules hold strictly, and the postulated axioms, such as relative function extensionality, become theorems. In this way, every model of the base theory (HoTT) gives rise to a model of the same theory with extension types; the only genuine assumptions are which maps count as cofibrations. Conservativity makes the framework a tool for comparing type theories. We prove that cubical gluing, in a suitable formulation, is equivalent to univalence. On this basis, we suggest an approach toward the conjecture that cubical type theories are conservative over book HoTT, one of the central open problems of homotopy type theory. All results of the main body of the paper are auto-formalized in Agda --two-level, in a development that combines HoTT-internal arguments with reasoning that is external to HoTT.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicolai Kraus. 2026-07-29. Extension Types for Free. https://arxiv.org/abs/2607.27387

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deciding Predicate Logical Theories of Real-Valued Functions

The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that reason about real-valued functions. This paper defines a first-order predicate language for reasoning about multi-dimensional smooth real-valued functions and their derivatives, and demonstrates that - despite the obvious undecidability barriers - certain positive decidability results for such a language are indeed possible.

cs.LO

Structural Liveness of Conservative Petri Nets

We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jancar and Purser, 2019] holds even for a simple subclass of conservative nets. As our main result, we prove that for structurally live conservative nets, the values of the minimal live markings are at most doubly exponential in the size of the net. This implies the EXPSPACE-completeness of structural liveness for conservative Petri nets. The result also applies to structurally bounded Petri nets, whereas the complexity of the general case remains open. As a proof ingredient of independent interest, we present an extension of known results on the bounds of minimal integer solutions to Boolean combinations of linear equalities, inequalities, and divisibility constraints.

cs.LO

Verifying Numerical Methods with Isabelle/HOL

Modern machine learning pipelines and ODE solvers are built on numerical algorithms. Reliable numerical methods are thus a prerequisite for trustworthy machine learning and cyber-physical systems. We evaluate a framework designed for verifying imperative programs and the Isabelle proof assistant as tools for proving the total correctness of four numerical algorithms: the bisection method, the fixed-point method, the perceptron, and the gradient descent algorithm. Our verifications required subtle extensions and generalisations to Isabelle's version of Taylor's theorem and higher-order derivatives. Finally, we reflect on the framework's automation, friendly syntax, and on further requirements to turn it into a verification tool for numerical methods.

cs.LO