Related papers: Indexed Induction and Coinduction, Fibrationally
We propose an enhancement to inductive types and records in a dependent type theory, namely (co)conditions. With a primitive interval type, conditions generalize the cubical syntax of higher inductive types in homotopy type theory, while…
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to describe diverging evaluations in addition to terminating…
In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…
We introduce the notion of a G\"odel fibration, which is a fibration categorically embodying both the logical principle of traditional Skolemization (we can exchange the order of quantifiers paying the price of a functional) and the…
The homotopy category of $N_\infty$ operads is equivalent to a finite lattice, and as the ambient group varies, there are various image constructions between these lattices. In this paper, we explain how to lift this algebraic structure…
This paper introduces the concept of gluing in a general category, enabling us to define categories that admit glued-up objects. To achieve this, we introduce the notion of a gluing index category. Subsequently, we provide an entirely…
In this paper we study categories $(F,\mathbf{C},\mathbf{D})$ and $(\mathbb{F},\mathbf{C},\mathbf{Set})$ and prove them to be fibred on $\mathbf{C}$. Then we examine Grothendieck construction in the context of an ordinary functor $F:…
The Functional Machine Calculus (FMC, Heijltjes 2022) extends the lambda-calculus with the computational effects of global mutable store, input/output, and probabilistic choice while maintaining confluent reduction and simply-typed strong…
A kind of unstable homotopy theory on the category of associative rings (without unit) is developed. There are the notions of fibrations, homotopy (in the sense of Karoubi), path spaces, Puppe sequences, etc. One introduces the notion of a…
This paper develops an information-theoretic framework for algorithmic complexity under regular identifiable fibering. The central question is: when a decoder is given information about the fiber label in a fibered geometric set, how much…
It is well established that equational algebraic theories, and the monads they generate, can be used to encode computational effects. An important insight of Power and Shkaravska is that comodels of an algebraic theory T -- i.e., models in…
In this work we study the induction (induced and coinduced)theory for Hopf group coalgebra. We define a substructure B of a Hopf group coalgebra $H$, called subHopf group coalgebra. Also, we have introduced the definition of Hopf group…
We study when induction functors (and their adjoints) between categories of Doi-Hopf modules and, more generally, entwined modules are separable, resp. Frobenius. We present a unified approach, leading to new proofs of old results by the…
The algebraic notion of a pivotal module category was developed by Schaumann and Shimizu and is central to the description of boundary conditions in conformal field theory according to a proposal by Fuchs and Schweigert. In this paper, we…
A well-known problem in the theory of dependent types is how to handle so-called nested data types. These data types are difficult to program and to reason about in total dependently typed languages such as Agda and Coq. In particular, it…
In order to avoid well-know paradoxes associated with self-referential definitions, higher-order dependent type theories stratify the theory using a countably infinite hierarchy of universes (also known as sorts), Type$_0$ : Type$_1$ :…
Affine type systems are substructural type systems where copying of information is restricted, but discarding of information is permissible at all types. Such type systems are well-suited for describing quantum programming languages,…
We focus on two factorization systems for opfibrations in the 2-category Fib(B) of fibrations over a fixed base category B. The first one is the internal version of the so called comprehensive factorization, where the right orthogonal class…
We discuss the treatment of initial datatypes and final process types in the wide-spectrum language HasCASL. In particular, we present specifications that illustrate how datatypes and process types arise as bootstrapped concepts using…
The set of integer number lists with finite length, and the set of binary trees with integer labels are both countably infinite. Many inductively defined types also have countably many elements. In this paper, we formalize the syntax of…