Towards a geometry for syntax
Jonathan Sterling

TL;DR
This paper explores a geometric approach to understanding the properties of free models in type theory, focusing on injectivity laws crucial for proof assistants, inspired by Grothendieck's ideas.
Contribution
It introduces a novel geometric framework to prove injectivity laws in free models of Martin-Löf type theory, integrating modern methods with classical ideas.
Findings
Established a geometric proof of injectivity in free models
Connected type-theoretic properties with Grothendieck's foundational concepts
Enhanced understanding of free model properties for proof assistant implementation
Abstract
It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if is the free monoid on a set , then the scalar multiplication function is injective. Therefore, when reasoning in the formal theory of monoids under , it is possible to use this injectivity law to make sound deductions even about monoids under for which scalar multiplication is not injective -- a principle known in algebra as the permanence of identity. Properties of this kind are of fundamental practical importance to the logicians and computer scientists who design and implement computerized proof assistants like Lean and Coq, as they enable the formal reductions of equational problems that make type checking tractable. As type theories have…
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 · Computability, Logic, AI Algorithms
