Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of universal algebra, such as theories of symmetric operads, non-symmetric operads, generalised operads, PROPs, PROs, and monads. These variants of universal algebra are called notions of algebraic theory. In this paper, we develop a unified framework for them. The key observation is that each notion of algebraic theory can be identified with a monoidal category, in such a way that algebraic theories correspond to monoid objects therein. To incorporate semantics, we introduce a categorical structure called metamodel, which formalises a definition of models of algebraic theories. We also define morphisms between notions of algebraic theory, which are a monoidal version of profunctors. Every strong monoidal functor gives rise to an adjoint pair of such morphisms, and provides a uniform method to establish isomorphisms between categories of models in different notions of algebraic theory. A general structure-semantics adjointness result and a double categorical universal property of categories of models are also shown.
The papers by Curien @cite_6 and Hyland @cite_15 concentrate on clones, symmetric operads and non-symmetric operads, and concern primarily the conceptual understanding of the substitution monoidal structures. Via the theory of pseudo-distributive laws @cite_19 , they reduce substitution monoidal structures to certain 2-monads on @math , for example the free cartesian category 2-monad in the case of clones. Their work illuminates the relationship between the notions of algebraic theory they treat and their standard metamodels, because the standard metamodels arise as Eilenberg--Moore algebras of the 2-monad from which the corresponding substitution monoidal structure is induced. On the other hand, monads and generalised operads do not seem to be captured by their framework.
@cite_19 @cite_15 @cite_6
2040355822 1989039217
We give a general category theoretic formulation of the substitution structure underlying the category theoretic study of variable binding proposed by Fiore, Plotkin, and Turi. This general formulation provides the foundation for their work on variable binding, as well as Tanaka's linear variable binding and variable binding for other binders and for mixtures of binders as for instance in the Logic of Bunched Implications. The key structure developed by was a substitution monoidal structure, from which their formulation of binding was derived; so we give an abstract formulation of a substitution monoidal structure, then, at that level of generality, derive the various category theoretic structures they considered. The central construction we use is that of a pseudo-distributive law between 2-monads on Cat, which suffices to induce a pseudo-monad on Cat, and hence a substitution monoidal structure on the free object on 1. We routinely generalise that construction to account for types. We study Kan extensions in three weakenings of the Eilenberg-Moore dou- ble category associated to a double monad, that was introduced by Grandis and Par e. To be precise, given a normal oplax double monad T on a double categoryK, we consider the double categories consisting of pseudo T -algebras, 'weak' vertical T -morphisms, hor- izontal T -morphisms and T -cells, where 'weak' means either 'lax', 'colax' or 'pseudo'. Denoting these double categories by Algw(T ), where w = l, c or ps accordingly, our main result gives, in each of these cases, conditions ensuring that (pointwise) Kan extensions can be lifted along the forgetful double functor Algw(T ) ! K. As an application we recover and generalise a result by Getzler, on the lifting of pointwise left Kan extensions along symmetric monoidal enriched functors. As an application of Getzler's result we prove, in suitable symmetric monoidal categories, the existence of bicommutative Hopf monoids that are freely generated by cocommutative comonoids. An algebraic left Kan extension is a left Kan extension which interacts well with the algebraic structure present in the given situation, and these appear in various subjects such as the homotopy theory of operads and in the study of conformal field theories. In the most interesting examples, the functor along which we left Kan extend goes between categories that enjoy universal properties which express the meaning of the calculation we are trying to understand. These universal properties say that the categories in question are universal examples of some categorical structure possessing some kind of internal structure, and so fall within the theory of internal algebra classifiers described in earlier work of the author. In this article conditions of a monad-theoretic nature are identified which give rise to morphisms between such universal objects, which satisfy the key condition of Guitart-exactness, which guarantees the algebraicness of left Kan extending along them. The resulting setting explains the algebraicness of the left Kan extensions arising in operad theory, for instance from the theory of Feynman categories of Kaufmann and Ward, generalisations thereof, and also includes the situations considered by Batanin and Berger in their work on the homotopy theory of algebras of polynomial monads. There are many category-theoretic notions of algebraic theory, including Lawvere theories, monads, PROPs and operads. The first central notion of this thesis is a common generalisation of these, which we call a proto-theory. In order to define models of a proto-theory in a category, we need a way of relating the arities of the proto-theory with the objects of the category. This leads to our second central notion, that of an interpretation of arities, or aritation for short. We show that every aritation gives rise to a semantics functor sending proto-theories to models. In fact this functor always has an adjoint, giving a structure-semantics adjunction. Furthermore, we show that the semantics of proto-theories generalises the classical semantics of many existing notions of algebraic theory. Another aim of this thesis is to find a convenient category of monads in the following sense. Every right adjoint gives rise to a monad on its codomain, and more generally so does any functor that admits a codensity monad. However, not all functors have codensity monads. This means that the semantics functor for monads on a category, viewed as a functor into the category of all functors into the base category, does not have a left adjoint. We seek a generalisation of monads with a semantics functor that does have a left adjoint. This can be accomplished with proto-theories, but at a cost. The classical semantics functor for monads is full and faithful; this is a kind of completeness theorem, and is highly desirable in a notion of algebraic theory. However, the semantics functor for general proto-theories is not full and faithful. Thus we seek a generalisation of monads and their semantics for which the semantics functor is both full and faithful and has a left adjoint. We show that such a generalisation is given, for suitable base categories, by a certain kind of topological proto-theory. We give a category-theoretic formulation of Engeler-style models for the untyped λ-calculus. In order to do so, we exhibit an equivalence between distributive laws and extensions of one monad to the Kleisli category of another and explore the example of an arbitrary commutative monad together with the monad for commutative monoids. On Set as base category, the latter is the finite multiset monad. We exploit the self-duality of the category Rel, i.e., the Kleisli category for the powerset monad, and the category theoretic structures on it that allow us to build models of the untyped λ-calculus, yielding a variant of the Engeler model. We replace the monad for commutative monoids by that for idempotent commutative monoids, which, on Set, is the finite powerset monad. This does not quite yield a distributive law, so requires a little more subtlety, but, subject to that subtlety, it yields exactly the original Engeler construction. Whereas formal category theory is classically considered within a @math -category, in this paper a double-dimensional approach is taken. More precisely we develop such theory within the setting of hypervirtual double categories, a notion extending that of virtual double category by adding cells with nullary target. [...] After this the notion of weak' Kan extension within a hypervirtual double category is considered, together with three strengthenings. [...] The notion of yoneda embedding is then considered in a hypervirtual double category, and compared to that of a good yoneda structure on a @math -category; the latter in the sense of Street-Walters and Weber. Conditions are given ensuring that a yoneda embedding @math defines @math as the free small cocompletion of @math , in a suitable sense. In the second half we consider formal category theory in the presence of algebraic structures. In detail: to a monad @math on a hypervirtual double category @math several hypervirtual double categories @math of @math -algebras are associated, [...]. This is followed by the study of the creation of, amongst others, left Kan extensions by the forgetful functors @math . The main motivation of this paper is the description of conditions ensuring that yoneda embeddings in @math lift along these forgetful functors, as well as ensuring that such lifted algebraic yoneda embeddings again define free small cocompletions, now in @math . As a first example we apply the previous to monoidal structures on categories, hence recovering Day convolution of presheaves and Im-Kelly's result on free monoidal cocompletion, as well as obtaining a "monoidal Yoneda lemma". We define a monad on the category of complete metric spaces with short maps, which assigns to each space the space of Radon probability measures on it with finite first moment, equipped with the Kantorovich--Wasserstein distance. It is analogous to the Giry monad on the category of Polish spaces, and it extends a construction due to van Breugel for compact and for 1-bounded complete metric spaces. We prove that this Kantorovich monad arises from a colimit construction on finite powers, which formalizes the intuition that probability measures are limits of finite samples. The proof relies on a new criterion for when an ordinary left Kan extension of lax monoidal functors is a monoidal Kan extension. This colimit characterization allows for the development of integration theory and other things, such as the treatment of measures on spaces of measures, completely without measure theory. We also show that the category of algebras of the Kantorovich monad is equivalent to the category of closed convex subsets of Banach spaces with short affine maps as the morphisms. Kleisli bicategories are a natural environment in which the combinatorics involved in various notions of algebraic theory can be handled in a uniform way. The setting allows a clear account of comparisons between such notions. Algebraic theories, symmetric operads and nonsymmetric operads are treated as examples. One main challenge of the theory of computational effects is to understand how to combine various notions of effects in a meaningful way. Here, we study the particular case of the local state monad, which we would like to express as the result of combining together a family of global state monads parametrized by the number of available registers. To that purpose, we develop a notion of indexed monad which refines and generalizes Power's recent notion of indexed Lawvere theory. One main achievement of the paper is to integrate the block structure necessary to encode allocation as part of the resulting notion of indexed state monad. We then explain how to recover the local state monad from the functorial data provided by our notion of indexed state monad. This reconstruction is based on the guiding idea that an algebra of the indexed state monad should be defined as a section of a 2-categorical notion of fibration associated to the indexed state monad by a Grothendieck construction. We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on streams) and of tree relabelling as in attribute evaluation. We propose a generic semantics for extensions of simply typed lambda calculus with context-dependent operations analogous to the Moggi-style semantics for effectful languages based on strong monads. This continues the work in the early 90s by Brookes, Geva and Van Stone on the use of computational comonads in intensional semantics. Applicative functors define an interface to computation that is more general, and correspondingly weaker, than that of monads. First used in parser libraries, they are now seeing a wide range of applications. This paper sets out to explore the space of non-monadic applicative functors useful in programming. We work with a generalization, lax monoidal functors, and consider several methods of constructing useful functors of this type, just as transformers are used to construct computational monads. For example, coends, familiar to functional programmers as existential types, yield a range of useful applicative functors, including left Kan extensions. Other constructions are final fixed points, a limited sum construction, and a generalization of the semi-direct product of monoids. Implementations in Haskell are included where possible. Rewriting logic extends to concurrent systems with state changes the body of theory developed within the algebraic semantics approach. It is both a foundational tool and the kernel language of several implementation efforts (Cafe, ELAN, Maude). Tile logic extends (unconditional) rewriting logic since it takes into account state changes with side effects and synchronization. It is especially useful for defining compositional models of computation of reactive systems, coordination languages, mobile calculi, and causal and located concurrent systems. In this paper, the two logics are defined and compared using a recently developed algebraic specification methodology, membership equational logic. Given a theory T, the rewriting logic of T is the free monoidal 2-category, and the tile logic of T is the free monoidal double category, both generated by T. An extended version of monoidal 2-categories, called 2VH-categories, is also defined, able to include in an appropriate sense the structure of monoidal double categories. We show that 2VH-categories correspond to an extended version of rewriting logic, which is able to embed tile logic, and which can be implemented in the basic version of rewriting logic using suitable internal strategies. These strategies can be significantly simpler when the theory is uniform. A uniform theory is provided in the paper for CCS, and it is conjectured that uniform theories exist for most process algebras. Goerss--Hopkins obstruction theory is a powerful tool for constructing structured ring spectra from purely algebraic data. Using the formalism of model @math -categories, we provide a generalization that applies in an arbitrary presentably symmetric monoidal stable @math -category (such as that of equivariant spectra or of motivic spectra). Fusion laws permit to eliminate various of the intermediate data structures that are created in function compositions. The fusion laws associated with the traditional recursive operators on datatypes cannot, in general, be used to transform recursive programs with effects. Motivated by this fact, this paper addresses the definition of two recursive operators on datatypes that capture functional programs with effects. Effects are assumed to be modeled by monads. The main goal is thus the derivation of fusion laws for the new operators. One of the new operators is called monadic unfold. It captures programs (with effects) that generate a data structure in a standard way. The other operator is called monadic hylomorphism, and corresponds to programs formed by the composition of a monadic unfold followed by a function defined by structural induction on the data structure that the monadic unfold generates. We study fundamental properties of a generalisation of monad called parametric effect monad, and apply it to the interpretation of general effect systems whose effects have sequential composition operators. We show that parametric effect monads admit analogues of the structures and concepts that exist for monads, such as Kleisli triples, the state monad and the continuation monad, Plotkin and Power's algebraic operations, and the categorical ┬┬-lifting. We also show a systematic method to generate both effects and a parametric effect monad from a monad morphism. Finally, we introduce two effect systems with explicit and implicit subeffecting, and discuss their denotational semantics and the soundness of effect systems. I describe the noncommutative Batalin-Vilkovisky geometry as- sociated naturally with arbitrary modular operad. The classical limit of this geometry is the noncommutative symplectic geometry of the corresponding tree-level cyclic operad. I show, in particular, that the algebras over the Feyn- man transform of a twisted modular operad P are in one-to-one correspondence with solutions to quantum master equation of Batalin-Vilkovisky geometry on the affineP manifolds. As an application I give a construction of character- istic classes with values in the homology of the quotient of Deligne-Mumford moduli spaces. These classes are associated naturally with solutions to the quantum master equation on affineS(t) manifolds, where S(t) is the twisted modular Det operad constructed from symmetric groups, which generalizes the cyclic operad of associative algebras. Author(s): Mazel-Gee, Aaron | Advisor(s): Teichner, Peter | Abstract: We develop a theory of model ∞-categories -- that is, of model structures on ∞-categories -- which provides a robust theory of resolutions entirely native to the ∞-categorical context. Using model ∞-categories, we generalize Goerss--Hopkins obstruction theory from spectra to an arbitrary (presentably symmetric monoidal stable) ∞-category. We give a sample application of this generalized obstruction theory in the setting of motivic homotopy theory, where we construct E_∞ structures on the motivic Morava E-theories and compute their automorphism spaces (as E_∞ algebras). Capretta's delay monad can be used to model partial computations, but it has the wrong'' notion of built-in equality, strong bisimilarity. An alternative is to quotient the delay monad by the right''notion of equality, weak bisimilarity. However, recent work by suggests that it is impossible to define a monad structure on the resulting construction in common forms of type theory without assuming (instances of) the axiom of countable choice. Using an idea from homotopy type theory---a higher inductive-inductive type---we construct a partiality monad without relying on countable choice. We prove that, in the presence of countable choice, our partiality monad is equivalent to the delay monad quotiented by weak bisimilarity. Furthermore we outline several applications. The derivatives of the identity functor on spaces in Goodwillie calculus forms an operad in spectra. Antolin-Camarena computed the mod 2 homology of free algebras over this operad for 1-connected spectra. In this present paper we carry out similar computations for mod p homology for odd primes p. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic functions (encryption, exclusive or, ...). The analysis of cryptographic protocols requires a precise understanding of the attacker knowledge. Two standard notions are usually used: deducibility and indistinguishability. Only few results have been obtained (in an ad-hoc way) for equational theories with associative and commutative properties, especially in the case of static equivalence. The main contribution of this paper is to propose a general setting for solving deducibility and indistinguishability for an important class (called monoidal) of these theories. Our setting relies on the correspondence between a monoidal theory E and a semiring SE which allows us to give an algebraic characterization of the deducibility and indistinguishability problems. As a consequence we recover easily existing decidability results and obtain several new ones.