Foundations of Substructural Dependent Type Theory (2401.15258v1)
Abstract: This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems possessing either syntax or semantics inclusive of certain practical applications, but has struggled to combine these all in one and the same system. Toward resolving this difficulty, I propose a novel categorical interpretation of substructural dependent types, analogous to the use of monoidal categories as models of linear and ordered logic, that encompasses a wide class of mathematical and computational examples. On this basis, I develop a general framework for substructural dependent type theories, and proceed to prove some essential metatheoretic properties thereof. As an application of this framework, I show how it can be used to construct a type theory that satisfactorily addresses the problem of effectively representing cut admissibility for linear sequent calculus in a logical framework.
- Robert Atkey “The Syntax and Semantics of Quantitative Type Theory” In LICS ’18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, July 9–12, 2018, Oxford, United Kingdom, 2018 DOI: 10.1145/3209108.3209189
- “A Linear Logical Framework” In Information and Computation 179.1, 2002, pp. 19–75 DOI: https://doi.org/10.1006/inco.2001.2951
- N.G. de Bruijn “Telescopic mappings in typed lambda calculus” In Information and Computation 91.2, 1991, pp. 189–204 DOI: https://doi.org/10.1016/0890-5401(91)90066-B
- Jean-Yves Girard “Linear logic” In Theoretical Computer Science 50.1, 1987, pp. 1–101 DOI: https://doi.org/10.1016/0304-3975(87)90045-4
- “Multimodal Dependent Type Theory”, LICS ’20 Saarbrücken, Germany: Association for Computing Machinery, 2020, pp. 492–506 DOI: 10.1145/3373718.3394736
- Bart Jacobs “Comprehension categories and the semantics of type dependency” In Theoretical Computer Science 107.2, 1993, pp. 169–207 DOI: https://doi.org/10.1016/0304-3975(93)90169-T
- Neelakantan R. Krishnaswami, Pierre Pradic and Nick Benton “Integrating Linear and Dependent Types” In Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’15 Mumbai, India: Association for Computing Machinery, 2015, pp. 17–30 DOI: 10.1145/2676726.2676969
- Per Martin-Löf “An Intuitionistic Theory of Types: Predicative Part” In Logic Colloquium ’73 80, Studies in Logic and the Foundations of Mathematics Elsevier, 1975, pp. 73–118 DOI: https://doi.org/10.1016/S0049-237X(08)71945-1
- David Jaz Myers and Matteo Cappucci “The Para Construction as a Distributive Law” Talk given at Virtual Double Categories Workshop, 2022 URL: https://bryceclarke.github.io/virtual-double-categories-workshop/slides/david-jaz-myers.pdf
- Conor McBride “I Got Plenty o’ Nuttin”’ In A List of Successes That Can Change the World: Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday Cham: Springer International Publishing, 2016, pp. 207–233 DOI: 10.1007/978-3-319-30936-1˙12
- “Effective Quantum Certification via Linear Homotopy Types”, 2023 URL: https://ncatlab.org/schreiber/files/QPinLHOTT-ExtendedAbstract-230315.pdf
- Jason Reed “A Hybrid Logical Framework”, 2009
- Mitchell Riley “A Bunched Homotopy Type Theory for Synthetic Stable Homotopy Theory”, 2022 DOI: https://doi.org/10.14418/wes01.3.139
- “Normalization for Cubical Type Theory” In 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, pp. 1–15 DOI: 10.1109/LICS52264.2021.9470719