Metraipolis › archive › dc_37d4dbdd9d3e
A Theory of a Two-Dimensional Typed Lambda Calculus — arXiv:2609.19479
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19479
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T05:44:50.343Z
- SHA-256 of the archived text
74e4b6fbad397c904ea91216b2f76a634d4ed9dc7dfa974d7405172345b8f09a- Stable URL of this page
https://metraipolis.com/documento/dc_37d4dbdd9d3e
How to cite
A Theory of a Two-Dimensional Typed Lambda Calculus — arXiv:2609.19479 — arXiv (en), https://arxiv.org/abs/2609.19479 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_37d4dbdd9d3e (Metraipolis archive dc_37d4dbdd9d3e, sha256 74e4b6fbad397c904ea91216b2f76a634d4ed9dc7dfa974d7405172345b8f09a)
BibTeX
@misc{dc37d4dbdd9d3e,
title = {A Theory of a Two-Dimensional Typed Lambda Calculus — arXiv:2609.19479},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19479},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_37d4dbdd9d3e; sha256 74e4b6fbad397c904ea91216b2f76a634d4ed9dc7dfa974d7405172345b8f09a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19479. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present a typed two-dimensional $\lambda$-calculus whose equality evidence is \emph{computational}: a path between two terms is an explicit finite sequence of one-step conversions (the $\beta$- and $\eta$-contractions, the congruences, and the structural rules), and every property of paths is proved \emph{by recursion over that sequence}, with any step as a base case --- in deliberate contrast with Martin-Löf type theory, where identity is generated by reflexivity alone and all properties go through the non-computational $J$-eliminator. The higher structure is imported from the $2\beta$- and $2\eta$-conversions of the theory of an arbitrary higher $\lambda$-model: we obtain 2-dimensional coherence laws, computable naturality of homotopies (via inductive homotopies and their explicit evaluations), a 2-dimensional path type with transport, and a parity invariant that proves the system consistent and \emph{really intensional}: the $\beta$- and $\eta$-contractions are provably distinct evidence, while in the native syntax of Idris (core MLTT) they are identified by definitional equality. Commutative diagrams accompany the main constructions, and the theory is fully formalized in Idris 2. A parallel Lean formalization is published in the Palomar registry \cite{palomar2026lean}. A philosophical reading closes the paper: constructivism in the BHK sense, proof-relevant intensionality, and the boundary between syntax and semantics, drawn relative to MLTT and HoTT.}
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in cs.LO).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.19479 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T05:08:21.097Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).