Related papers: Functoriality of Enriched Data Types
This monograph is a study of the category of polynomial endofunctors on the category of sets and its applications to modeling interaction protocols and dynamical systems. We assume basic categorical background and build the categorical…
We construct recursion categories from categories of coalgebras. Let $F$ be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category $\textbf{Set}_F$ of $F$-coalgebras is complete. The…
A graph property (i.e., a set of graphs) is induced-hereditary or additive if it is closed under taking induced-subgraphs or disjoint unions. If $\cP$ and $\cQ$ are properties, the product $\cP \circ \cQ$ consists of all graphs $G$ for…
In this paper, we generalize the principle of the Long-Moody construction for representations of braid groups to other groups, such as mapping class groups of surfaces. Namely, we introduce endofunctors over a functor category that encodes…
In functional programming languages, generalized algebraic data types (GADTs) are very useful as the unnecessary pattern matching over them can be ruled out by the failure of unification of type arguments. In dependent type systems, this is…
We define the phrase `category enriched in an fc-multicategory' and explore some examples. An fc-multicategory is a very general kind of 2-dimensional structure, special cases of which are double categories, bicategories, monoidal…
Ludics is a logical framework in which types/formulas are modelled by sets of terms with the same computational behaviour. This paper investigates the representation of inductive data types and functional types in ludics. We study their…
The notion of term graph encodes a refinement of inductively generated syntax in which regard is paid to the the sharing and discard of subterms. Inductively generated syntax has an abstract expression in terms of initial algebras for…
Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…
We present a construction of W-types in the setoid model of extensional Martin-L\"of type theory using dependent W-types in the underlying intensional theory. More precisely, we prove that the internal category of setoids has initial…
In this dissertation we examine enrichment relations between categories of dual structure and we sketch an abstract framework where the theory of fibrations and enriched category theory are appropriately united. We initially work in the…
We generalize the notion of a bornology by omitting the condition that a one-point-subset is bounded and obtain a complete and co-complete generalization of the category of bornological coarse spaces. Then we imitate the construction of…
Given commutative, unital rings $A$ and $B$ with a ring homomorphism $A\to B$ making $B$ free of finite rank as an $A$-module, we can ask for a "trace" or "norm" homomorphism taking algebraic data over $B$ to algebraic data over $A$. In…
In this expository paper we describe an unifying approach for many known entropies in Mathematics. First we recall the notion of semigroup entropy h_S in the category S of normed semigroups and contractive homomorphisms, recalling also its…
We introduce algebraic dynamical systems, which consist of an action of a right LCM semigroup by injective endomorphisms of a group. To each algebraic dynamical system we associate a C*-algebra and describe it as a semigroup C*-algebra. As…
In a previous work, we proved that an important part of the Calculus of Inductive Constructions (CIC), the basis of the Coq proof assistant, can be seen as a Calculus of Algebraic Constructions (CAC), an extension of the Calculus of…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
We provide an explicit Dynkin diagrammatic description of the c-vectors and the d-vectors (the denominator vectors) of any cluster algebra of finite type with principal coefficients and any initial exchange matrix. We use the surface…