Quadratic type checking for objective type theory
Benno van den Berg, Martijn den Besten

TL;DR
This paper presents a modified type theory that replaces definitional equality with propositional equalities, enabling quadratic time type checking and providing a homotopy-theoretic semantics.
Contribution
It introduces a quadratic time type checking method for a modified Martin-Löf type theory with propositional equalities instead of definitional equality.
Findings
Type checking is quadratic in the modified system.
The system admits a natural homotopy-theoretic semantics.
Elimination of definitional equality simplifies the computational process.
Abstract
We introduce a modification of standard Martin-Lof type theory in which we eliminate definitional equality and replace all computation rules by propositional equalities. We show that type checking for such a system can be done in quadratic time and that it has a natural homotopy-theoretic semantics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Homotopy and Cohomology in Algebraic Topology
