Fixpoint constructions in focused orthogonality models of linear logic
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Department of Computer Science and Technology
https://doi.org/10.46298/entics.12302
Department of Computer Science and Technology
https://doi.org/10.46298/entics.12302
Abstract
Description
Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems. It was given a general treatment with the concept of orthogonality category, of which numerous models of linear logic are instances, by Hyland and Schalk. This paper considers the subclass of focused orthogonalities. We develop a theory of fixpoint constructions in focused orthogonality categories. Central results are lifting theorems for initial algebras and final coalgebras. These crucially hinge on the insight that focused orthogonality categories are relational fibrations. The theory provides an axiomatic categorical framework for models of linear logic with least and greatest fixpoints of types. We further investigate domain-theoretic settings, showing how to lift bifree algebras, used to solve mixed-variance recursive type equations, to focused orthogonality categories. Comment: 17 pages, MFPS 2023
EPSRC grant EP/V002309/1
EPSRC grant EP/V002309/1