A cartesian closed fibration of higher-order regular languages
Preprint
Abstract
We explain how to construct in two different ways a cartesian closed fibration of higher-order regular languages in the sense of Salvati. In the first construction, we use fibrational techniques to derive the cartesian closed fibration from the various categories of regular languages of $λ$-terms associated to finite sets of ground states. In the second construction, we take advantage of the recent notion of profinite $λ$-calculus to define the cartesian closed fibration by a change-of-base from the fibration of clopen subsets over the category of Stone spaces, using an elegant idea coming from Hermida. We illustrate the expressive power of the cartesian closed fibration by generalizing the notion of Brzozowski derivative to higher-order regular languages, using an Isbell-like adjunction in the sense of Melliès and Zeilberger.Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- On duality and model theory for polyadic spacesAnnals of Pure and Applied Logic, 2023
- Monadic Monadic Second Order Logic2023
- Profinite Semigroups and Symbolic Dynamics2020
- A Dialectica-Like Interpretation of a Linear MSO on Infinite Words2019
- A Topological Approach to RecognitionLecture Notes in Computer Science, 2010
- Recognizability in the Simply Typed Lambda-Calculus2009
- Duality and Equational Theory of Regular Languages2008
- Logical Predicates for Intuitionistic Linear Type TheoriesLecture Notes in Computer Science, 1999
- Regular languages and stone dualityTheory of Computing Systems, 1997
- Categories Fibrees et Descente1971