Batanin and Markl's operadic categories are in which each map is endowed with a finite collection of “abstract fibres”—also objects the same category—subject to suitable axioms. We give reconstruction data axioms terms décalage comonad D on small categories. A simple case involves unary categories—ones wherein has exactly one abstract fibre—which exhibited as are, first all, coalgebras for D, a...

A propositional logic program P may be identified with a PfPf -coalgebra on the set of atomic propositions in the program. The corresponding C(PfPf )-coalgebra, where C(PfPf ) is the cofree comonad on PfPf , describes derivations by resolution. Using lax semantics, that correspondence may be extended to a class of first-order logic programs without existential variables. The resulting extension...

It is well known that type constructors of incomplete trees (trees with variables) carry the structure of a monad with substitution as the extension operation. Less known are the facts that the same is true of type constructors of incomplete cotrees (=non-wellfounded trees) and that the corresponding monads exhibit a special structure. We wish to draw attention to the dual facts which are as me...

Motivated by a new approach in the categorical semantics of linear logic, we investigate some speciic categories of coalgebras. They all arise from the canonical comonad that one has on a category of algebras. We obtain a very simple model of linear logic where linear formulas are complete lattices and intuitionistic formulas are just sets. Also, in another, domain theoretic example, we give a ...

Probabilistic coherence spaces yield a model of linear logic and lambda-calculus with a linear algebra flavor. Formulas/types are associated with convex sets of R -valued vectors, linear logic proofs with linear functions and λ-terms with entire functions, both mapping the convex set of their domain into the one of their codomain. Previous results show that this model is particularly precise in...

In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comonads. We explore the viability and value of similar modeling of cellular automata. We identify local behaviors of cellular automata with coKleisli maps of the exponent comonad on the category of uniform spaces and unifo...

We show that an adjoint functor between quasi-categories may be extended to a simplicially enriched functor whose domain is an explicitly presented “homotopy coherent adjunction”. This enriched functor encapsulates both the coherent monad and the coherent comonad generated by the adjunction. Furthermore, because its domain is cofibrant, this data can be used to construct explicit quasi-categori...

homotopy theory C.1. Lifting properties, weak factorization systems, and Leibniz closure C.1.1. Lemma. Any class of maps characterized by a right lifting property is closed under composition, product, pullback, retract, and limits of towers; see Lemma C.1.1. Proof. For now see [17, 11.1.4] and dualize. On account of the dual of Lemma C.1.1, any set of maps in a cocomplete category “cellularly g...

Let A be a ring and MA the category of right A-modules. It is well known in module theory that any A-bimodule B is an A-ring if and only if the functor − ⊗A B : MA → MA is a monad (or triple). Similarly, an A-bimodule C is an A-coring provided the functor − ⊗A C : MA → MA is a comonad (or cotriple). The related categories of modules (or algebras) of −⊗A B and comodules (or coalgebras) of − ⊗A C...

Let A be a ring and MA the category of A-modules. It is well known in module theory that for any A-bimodule B, B is an A-ring if and only if the functor − ⊗A B : MA → MA is a monad (or triple). Similarly, an A-bimodule C is an A-coring provided the functor − ⊗A C : MA → MA is a comonad (or cotriple). The related categories of modules (or algebras) of −⊗A B and comodules (or coalgebras) of − ⊗A ...