Hereditary permutations for simple types revisited: A baby case for University Algebra
Thorsten Altenkirch
Abstract
It is a classical result that the definable isomorphisms of the simply typed lambda-calculus with function types are exactly the hereditary permutations, and that they are generated by A B C B A C and congruence. We give a new proof of this result that stays inside beta-normal eta-long typed terms and uses no completeness theorem: an induction that descends through both components of an isomorphism at once. We then go one level up and prove a coherence theorem: two derivations of an isomorphism denote the same isomorphism if and only if they are equal modulo an explicit list of equations (groupoid laws, functoriality, involution, naturality and the braid equation), so these equations present the groupoid of isomorphisms, a hereditary version of the Coxeter presentation of the symmetric groups. All results are formalised in Agda, on intrinsically typed syntax with hereditary substitution, without postulates. The work is a case study for the syntactic completeness conjecture of University Algebra, a proposed solution of Tarski's high school algebra problem using dependent types, whose semantic counterpart is open. We explain the motivation and which parts of the method we expect to carry over.
Create a lesson
Related papers
On the semantics of conditional branching
Fredrik Dahlqvist
Invariance and Expressiveness: Modal Variations
Martin Otto
The Necessity of Acceptance & Rejection in Inferential Reasoning
Khashayar Irani
Burnside Problems for Matrix Semigroup Quotients with Applications to Border Complexity
Roland Guttenberg, Nathan Lhote, Mahsa Shirmohammadi et al.
The Density of Interpolants in Modal Logic: First Results
Roman Kontchakov, Louwe Kuijer, Frank Wolter
Variational Trajectory Flow Matching with a Non-Linear Interpolant
Gurjeet Sangra Singh, Frantzeska Lavda, Alexandros Kalousis