Corpus

We give a single compositional setting in which gradient-based learning and Hamiltonian-style mechanics appear as functorial semantics. The syntax is an operad Arr whose objects are input-output interfaces (pairs of manifolds) and whose morphisms are *smooth adaptive arrangements*, which consist of a reactive parameter space, a lens given by smooth output and input maps, and a real-valued potential. The main technical result of the paper is what we call *lens internalization*, a lax symmetric monoidal functor Lens(C) $\to$ C associated to any symmetric monoidal closed category C. Using it, we provide two functors $Φ_\text{phase}$, $Φ_\text{conf}$: Arr $\to$ PC into the 2-category of polynomial coalgebras -- input-output discrete dynamical systems -- which we take as the semantics category. $Φ_\text{phase}$ stores both position and momentum, whereas $Φ_\text{conf}$ stores only position. When applied to a parameterized function, $Φ_\text{conf}$ recovers the gradient descent training algorithm, with backpropagation as the lens' backward pass. When applied to harmonic particles wired together -- in series, or according to any finite directed graph -- one diagram yields two different regimes, both of which are governed by the graph Laplacian: $Φ_\text{phase}$ gives the discrete wave equation, which is conservative and second-order, and $Φ_\text{conf}$ gives the discrete heat equation, which is dissipative and first-order. They are two semantics of one adaptive arrangement, e.g. with the same potential in each case. And because Arr is an operad, such diagrams nest -- larger systems wired from smaller ones -- and each semantics assembles a system's dynamics functorially from its parts. These dynamics are moreover executable: a parameterized neural network and a graph of particles both compile, by the same construction, to explicit state machines one can run.

Everywhere one looks, one finds dynamic interacting systems: entities expressing and receiving signals between each other and acting and evolving accordingly over time. In this book, the authors give a new syntax for modeling such systems, describing a mathematical theory of interfaces and the way they connect. The discussion is guided by a rich mathematical structure called the category of polynomial functors. The authors synthesize current knowledge to provide a grounded introduction to the material, starting with set theory and building up to specific cases of category-theoretic concepts such as limits, adjunctions, monoidal products, closures, comonoids, comodules, and bicomodules. The text interleaves rigorous mathematical theory with concrete applications, providing detailed examples illustrated with graphical notation as well as exercises with solutions. Graduate students and scholars from a diverse array of backgrounds will appreciate this common language by which to study interactive systems categorically.

Awodey, later with Newstead, showed how polynomial functors with extra structure (termed ``natural models'') hold within them the categorical semantics for dependent type theory. Their work presented these ideas clearly but ultimately led them outside of the usual category of polynomial functors to a particular \emph{tricategory} of polynomials in order to explain all of the structure possessed by such models. This paper builds off that work -- explicating the categorical semantics of dependent type theory by axiomatizing them entirely in terms of the usual category of polynomial functors. In order to handle the higher-categorical coherences required for such an explanation, we work with polynomial functors in the language of Homotopy Type Theory (HoTT), which allows for higher-dimensional structures to be expressed purely within this category. The move to HoTT moreover enables us to express a key additional condition on polynomial functors -- \emph{univalence} -- which is sufficient to guarantee that models of type theory expressed as univalent polynomials satisfy all higher coherences of their corresponding algebraic structures, purely in virtue of being closed under the usual constructors of dependent type theory. We call polynomial functors satisfying this condition \emph{polynomial universes}. As an example of the simplification to the theory of natural models this enables, we highlight the fact that a polynomial universe being closed under dependent product types implies the existence of a distributive law of monads, which witnesses the usual distributivity of dependent products over dependent sums.

Categories can be identified -- up to isomorphism -- with polynomial comonads on Set. The left Kan extension of a functor along itself is always a comonad -- called the density comonad -- so it defines a category when its carrier is polynomial. We provide a number of generalizations of this to produce new categories from old, as well as from distributive laws of monads over comonads. For example, all Lawvere theories, all product completions of small categories, and the simplicial indexing category $Δ^{op}$ arise in this way. Another, seemingly much less well-known, example constructs a so-called selection category from a polynomial comonad in a way that's somehow dual to the construction of a Lawvere theory category from a monad; we'll discuss this in more detail. Along the way, we will see various constructions of non-polynomial comonads as well.

Hasegawa showed that control flow in programming languages -- while loops and if-then-else statements -- can be modeled using traced cocartesian categories, such as the category $\mathbf{Set}_*$ of pointed sets. In this paper we define an operad $\mathscr{W}$ of wiring diagrams that provides syntax for categories whose control flow moreover includes data transformations, including deleting, duplicating, permuting, and applying pre-specified functions to variables. In the most basic version, the operad underlies $\mathbf{Int}(\mathbf{Poly}_*)$, where $\mathbf{Int}(\mathscr{T})$ denotes the free compact category on a traced category $\mathscr{T}$, as defined by Joyal, Street, and Verity; to do so, we show that $\mathbf{Poly}_*$, as well as any multivariate version of it, is traced. We show moreover that whenever $\mathscr{T}$ is uniform -- a condition also defined by Hasegawa and satisfied by $\mathbf{Int}(\mathscr{T})$ -- the resulting $\mathbf{Int}$-construction extends to a double category $\mathbb{I}\mathbf{nt}(\mathscr{T})$, which is compact in the sense of Patterson. Finally, we define a universal property of the double category $\mathbb{I}\mathbf{nt}(\mathbf{Poly}_*)$ and $\mathbb{I}\mathbf{nt}(\mathbf{Set}_*)$ by which one can track trajectories as they move through the control flow associated to a wiring diagram.

The long-term goal of space networking studies is to provide the foundation needed to support a Solar System Internet (SSI). We anticipate that such an SSI would be composed of science and exploration satellites, ground stations, routing satellites, and ultimately humans and robots on the surfaces of different planets throughout our solar system. Interplanetary communications networks will need to handle the delays, disruptions, and disconnections inherent to space communications. The architecture of Delay Tolerant Networking (DTN) provides protocols and strategies to support these communications plans. At its core, DTN relies on a store-carry-forward approach to provide robust communications in the presence of delays and disruptions.In the past, routing models in DTN have focused on the forwarding aspects of store-carry-forward. Methods such as Contact Graph Routing, Contact Multigraph Routing, and Probabilistic Routing Protocol using the History of Encounters and Transitivity (PRoPHET) provide solutions for how to choose where to forward bundles through a network. However, these routing models often function bundle-by-bundle allowing them to set aside storage needs for each node. In order to bring our vision of a SSI to reality, we will need to be able to predict and incorporate storage needs that satellites and rovers will require. Modeling and predicting storage needs is the first step to being able to optimize storage needs and also optimize communication footprints on the size, mass, and power needs of future satellites.In this paper, we introduce a novel semiring model for contact-based routing protocols that includes a means of determining storage needs. Through proper analysis of the semiring structure, we show how to determine optimal storage structures in satellite networks. In addition, we run our analysis on simulated satellite networks to demonstrate the potential for working with these semiring models in a computational framework. We conclude by indicating future directions for semiring analysis is space communications.

Interviews run on people, programs run on operating systems, voting schemes run on voters, games run on players. Each of these is an example of the abstraction pattern runs on matter. Pattern determines the decision tree that governs how a situation can unfold, while matter responds with decisions at each juncture. In this article, we will give a straightforward and concrete construction of the free monad monad for the category of polynomial functors with the substitution monoidal product. Although the free monad has been well-studied in other contexts, the construction we give is streamlined and explicitly illustrates how the free monad represents terminating decision trees. We will also explore the naturally arising interaction between the free monad and cofree comonad. Again, while the interaction itself is known, the perspective we take is the free monad as a module over the cofree comonad. Lastly, we will give four applications of the module action to interviews, computer programs, voting, and games. In each example, we will see how the free monad represents pattern, the cofree comonad represents matter, and the module action represents runs on.

We show that the construction due to Leinster and Weber of a generalized Lawvere theory for a familially representable monad on a (co)presheaf category, and the associated ``nerve'' functor from monad algebras to (co)presheaves, have an elegant categorical description in the double category $\mathbb{C}\mathbf{at}^{\#}$ of categories, cofunctors, familial functors, and transformations. In $\mathbb{C}\mathbf{at}^{\#}$, which also arises from comonoids in the category of polynomial functors, both a familial monad and a (co)presheaf it acts on can be modeled as horizontal morphisms; from this perspective, the theory category associated to the monad is built using left Kan extension in the category of endomorphisms, and the nerve functor is modeled by a single composition of horizontal morphisms in $\mathbb{C}\mathbf{at}^{\#}$. For the free category monad $path$ on graphs, this provides a new construction of the simplex category as $Δ:= \lens{path}{path \circ path}$. We also explore the free Eilenberg-Moore completion of $\mathbb{C}\mathbf{at}^{\#}$, in which constructions such as the free symmetric monoidal category monad on $\mathbf{Cat}$ can modeled using the rich language of polynomial functors.

This paper has two purposes. The first is to extend the theory of linearly distributive categories by considering the structures that emerge in a special case: the normal duoidal category $(\mathsf{Poly} ,\mathcal{y}, \otimes, \triangleleft )$ of polynomial functors under Dirichlet and substitution product. This is an isomix LDC which is neither $*$-autonomous nor fully symmetric. The additional structures of interest here are a closure for $\otimes$ and a co-closure for $\triangleleft$, making $\mathsf{Poly}$ a bi-closed LDC, which is a notion we introduce in this paper. The second purpose is to use $\mathsf{Poly}$ as a source of examples and intuition about various structures that can occur in the setting of LDCs, including duals, cores, linear monoids, and others, as well as how these generalize to the non-symmetric setting. To that end, we characterize the linearly dual objects in $\mathsf{Poly}$: every linear polynomial has a right dual which is a representable. It turns out that the linear and representable polynomials also form the left and right cores of $\mathsf{Poly}$. Finally, we provide examples of linear monoids, linear comonoids, and linear bialgebras in $\mathsf{Poly}$.

This is the fourth installment in a series of papers offering models of hierarchical structure for dynamical systems, using the language of polynomial functors. The operad underlying the symmetric monoidal category $(\mathbf{Poly}, \otimes, \mathcal{y})$ can be viewed as defining the behavior of hierarchical delegation. In particular, a morphism $\mathbf{Poly}(p_1 \otimes \cdots \otimes p_m, q)$ turns the outputs of subordinates with interfaces $p_i$ into the output of an agent with interface $q$ and turns a task given to the agent into a task for each of the subordinates. In this article, we extend the framework so that subordinates may be invoked asynchronously depending on the outcomes of other subordinates. We prove that the free (co)monad (co)monad extends to a (co)monad on $\mathbf{Org}$. From the perspective of programs/pattern, this extension implies the existence of a $\mathbf{Cat}$-enriched operad $\mathbf{Org}_\mathfrak{m}$, and from the perspective of behavior/matter, it implies the existence of a $\mathbf{Cat}$-enriched operad $\mathbf{Org}^\mathfrak{c}$. Second, we crispen the relationship between the programmatic and behavioral perspectives via a functor $[-, t] \colon \mathbf{Org}_{\mathfrak{m}}^\textrm{op} \to \mathbf{Org}^\mathfrak{c}$ for any polynomial monad $t$.

Для проведения мониторинга и прогнозирования лавинной активности необхо-дима обработка больших данных, причем формирование данных может происходить из разных источников: метеорологические данные из открытых баз данных (БД) регионального уровня  Национальной гидрометеорологической службы Казахстана, международного уровня  World Weather Information Service, данные спутников Sentinel (Европейского космического агентства), данные с оперативных журналов ТОО «Казселезащита», данные приборов учетов, установленных на лавинных участках, метаданные (фото, видео материалы и 3D-модели склонов) и другие. Важной задачей для дальнейшего прогнозирования лавинной активности является правильное проектирование БД лавиносборов. В данном исследовании спроектирована инфологическая модель БД, что позволит в дальнейшем применять традиционные методы прогнозирования схода лавин и методов машинного обучения. В результате нами были выявлены информационные объекты (сущности) и построена инфологическая модель БД (ЕR-диаграмма), на основе которых спроектирована БД для системы мониторинга и прогнозирования лавинной активности ВКО. Также определены источники данных и технологии получения данных.

Natural organized systems adapt to internal and external pressures and this happens at all levels of the abstraction hierarchy. Wanting to think clearly about this idea motivates our paper, and so the idea is elaborated extensively in the introduction, which should be broadly accessible to a philosophically-interested audience. In the remaining sections, we turn to more compressed category theory. We define the monoidal double category Org of dynamic organizations, we provide definitions of Org-enriched, or dynamic, categorical structures -- e.g. dynamic categories, operads, and monoidal categories -- and we show how they instantiate the motivating philosophical ideas. We give two examples of dynamic categorical structures: prediction markets as a dynamic operad and deep learning as a dynamic monoidal category.

Past work shows that one can associate a notion of Shannon entropy to a Dirichlet polynomial, regarded as an empirical distribution. Indeed, entropy can be extracted from any d:Dir by a two-step process, where the first step is a rig homomorphism out of Dir, the *set* of Dirichlet polynomials, with rig structure given by standard addition and multiplication. In this short note, we show that this rig homomorphism can be upgraded to a rig *functor*, when we replace the set of Dirichlet polynomials by the *category* of ordinary (Cartesian) polynomials. In the Cartesian case, the process has three steps. The first step is a rig functor PolyCart -> Poly sending a polynomial p to (dp)y, where dp is the derivative of p. The second is a rig functor Poly -> Set x Set^op, sending a polynomial q to the pair (q(1),Gamma(q)), where Gamma(q)=Poly(q,y) can be interpreted as the global sections of q viewed as a bundle, and q(1) as its base. To make this precise we define what appears to be a new distributive monoidal structure on Set x Set^op, which can be understood geometrically in terms of rectangles. The last step, as for Dirichlet polynomials, is simply to extract the entropy as a real number from a pair of sets (A,B); it is given by log A - log B^(1/A) and can be thought of as the log aspect ratio of the rectangle.

The category Set_* of sets and partial functions is well-known to be traced monoidal, meaning that a partial function S+U -/-> T+U can be coherently transformed into a partial function S -/-> T. This transformation is generally described in terms of an implicit procedure that must be run. We make this procedure explicit by enriching the traced category in Cat#, the symmetric monoidal category of categories and cofunctors: each hom-category has such procedures as objects, and advancement through the procedures as arrows. We also generalize to traced Kleisli categories beyond Set_*, providing a conjectural trace operator for the Kleisli category of any polynomial monad of the form t+1. The main motivation for this work is to give a formal and graphical syntax for performing sophisticated computations powered by graph rewriting, which is itself a graphical language for data transformation.

We define the monoidal category $(Poly_E,y,\triangleleft)$ of polynomials under composition in any category $E$ with finite limits, including both cartesian and vertical morphisms of polynomials, and generalize to this setting the Dirichlet tensor product of polynomials $\otimes$, duoidality of $\otimes$ and $\triangleleft$, closure of $\otimes$, and coclosures of $\triangleleft$. We also prove that $\triangleleft$-comonoids in $Poly_E$ are precisely the internal categories in $E$ whose source morphism is exponentiable, generalizing a result of Ahman-Uustalu equating categories with polynomial comonads, and show that coalgebras in this setting correspond to internal copresheaves. Finally, the double category of ``typed'' polynomials in $E$ is recovered using $\triangleleft$-bicomodules in $Poly_E$.

We show that the double category $\mathbb{C}\mathbf{at}^\#$ of comonoids in the category of polynomial functors (previously shown by Ahman-Uustalu and Garner to be equivalent to the double category of categories, cofunctors, and prafunctors) contains several formal settings for basic category theory and has subcategories equivalent to both the double category $\mathbb{O}\mathbf{rg}$ of dynamic rewiring systems and the double category $\mathbb{P}\mathbf{oly}_{\mathcal{E}}$ of generalized polynomials in a finite limit category $\mathcal{E}$. Also serving as a natural setting for categorical database theory and generalized higher category theory, $\mathbb{C}\mathbf{at}^\#$ at once hosts models of a wide range of concepts from the theory and applications of polynomial functors and category theory.

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 theory from the ground up, highlighting pictorical techniques and concrete examples to build intuition and provide applications.

In "Backprop as functor", the authors show that the fundamental elements of deep learning -- gradient descent and backpropagation -- can be conceptualized as a strong monoidal functor Para(Euc)$\to$Learn from the category of parameterized Euclidean spaces to that of learners, a category developed explicitly to capture parameter update and backpropagation. It was soon realized that there is an isomorphism Learn$\cong$Para(Slens), where Slens is the symmetric monoidal category of simple lenses as used in functional programming. In this note, we observe that Slens is a full subcategory of Poly, the category of polynomial functors in one variable, via the functor $A\mapsto Ay^A$. Using the fact that (Poly,$\otimes$) is monoidal closed, we show that a map $A\to B$ in Para(Slens) has a natural interpretation in terms of dynamical systems (more precisely, generalized Moore machines) whose interface is the internal-hom type $[Ay^A,By^B]$. Finally, we review the fact that the category p-Coalg of dynamical systems on any $p \in$ Poly forms a topos, and consider the logical propositions that can be stated in its internal language. We give gradient descent as an example, and we conclude by discussing some directions for future work.

We present an elementary introduction to a new logic for reasoning about behaviors that occur over time. This logic is based on temporal type theory. The syntax of the logic is similar to the usual first-order logic; what differs is the notion of truth value. Instead of reasoning about whether formulas are true or false, our logic reasons about temporal landscapes. A temporal landscape may be thought of as representing the set of durations over which a statement is true. To help understand the practical implications of this approach, we give a wide variety of examples where this logic is used to reason about autonomous agents.

Past work shows that one can associate a notion of Shannon entropy to a Dirichlet polynomial, regarded as an empirical distribution. Indeed, entropy can be extracted from any d:Dir by a two-step process, where the first step is a rig homomorphism out of Dir, the *set* of Dirichlet polynomials, with rig structure given by standard addition and multiplication. In this short note, we show that this rig homomorphism can be upgraded to a rig *functor*, when we replace the set of Dirichlet polynomials by the *category* of ordinary (Cartesian) polynomials. In the Cartesian case, the process has three steps. The first step is a rig functor PolyCart -> Poly sending a polynomial p to (dp)y, where dp is the derivative of p. The second is a rig functor Poly -> Set x Set^op, sending a polynomial q to the pair (q(1),Gamma(q)), where Gamma(q)=Poly(q,y) can be interpreted as the global sections of q viewed as a bundle, and q(1) as its base. To make this precise we define what appears to be a new distributive monoidal structure on Set x Set^op, which can be understood geometrically in terms of rectangles. The last step, as for Dirichlet polynomials, is simply to extract the entropy as a real number from a pair of sets (A,B); it is given by log A - log B^(1/A) and can be thought of as the log aspect ratio of the rectangle.

In this document, we collect a list of categorical structures on the category $\mathbf{Poly}$ of polynomial functors. There is no implied claim that this list is in any way complete. It includes: infinitely many monoidal structures, all but one of which is symmetric, closed, and distributes over $+$, several of which interact duoidally; it also includes a right-coclosure and two indexed left coclosures; it also includes various adjunctions of which $\mathbf{Poly}$ is a part, including the free monad and cofree comonad and their interaction with various monoidal structures.

We show how computation of left Kan extensions can be reduced to computation of free models of cartesian (finite-limit) theories. We discuss how the standard and parallel chase compute weakly free models of regular theories and free models of cartesian theories, and compare the concept of "free model" with a similar concept from database theory known as "universal model". We prove that, as algorithms for computing finite free models of cartesian theories, the standard and parallel chase are complete under fairness assumptions. Finally, we describe an optimized implementation of the parallel chase specialized to left Kan extensions that achieves an order of magnitude improvement in our performance benchmarks compared to the next fastest left Kan extension algorithm we are aware of.

Natural organized systems adapt to internal and external pressures and this happens at all levels of the abstraction hierarchy. Wanting to think clearly about this idea motivates our paper, and so the idea is elaborated extensively in the introduction, which should be broadly accessible to a philosophically-interested audience. In the remaining sections, we turn to more compressed category theory. We define the monoidal double category Org of dynamic organizations, we provide definitions of Org-enriched, or dynamic, categorical structures -- e.g. dynamic categories, operads, and monoidal categories -- and we show how they instantiate the motivating philosophical ideas. We give two examples of dynamic categorical structures: prediction markets as a dynamic operad and deep learning as a dynamic monoidal category.

We provide a categorical framework for mathematical objects for which there is both a sort of "independent" and "dependent" composition. Namely we model them as duoidal categories in which both monoidal structures share a unit and the first is symmetric. We construct the free such category and observe that it is a full subcategory of the category of finite posets. Indeed each algebraic expression in the two monoidal operators corresponds to the poset built by taking disjoint unions and joins of the singleton poset. We characterize these "expressible" posets as precisely those which contain no "zig-zags." We then move on to describe categories equipped with $n$-ary operations for each $n$-element finite poset; we refer to them as "dependence categories" since they allow for combinations of objects based on any network of dependencies between them. These structures model various sorts of dependence including the space-like and time-like juxtaposition of weighted probability distributions in relativistic spacetime, which we model using polynomial endofunctors on the category of sets, as well as the runtimes for multiple computer programs run in parallel and series, which we model using the tropical semiring structure on nonnegative real numbers. With these examples in mind, we conclude by describing ways in which morphisms in a partial monoidal category can be "decorated" in a coherent manner by objects in a dependence category, such as labeling a network of parallel programs with their runtimes.

Perception is a critical component of high-integrity applications of robotics and autonomous systems, such as self-driving vehicles. In these applications, failure of perception systems may put human life at risk, and a broad adoption of these technologies requires the development of methodologies to guarantee and monitor safe operation. Despite the paramount importance of perception systems, currently there is no formal approach for system-level monitoring. In this work, we propose a mathematical model for runtime monitoring and fault detection and identification in perception systems. Towards this goal, we draw connections with the literature on diagnosability in multiprocessor systems, and generalize it to account for modules with heterogeneous outputs that interact over time. The resulting temporal diagnostic graphs (i) provide a framework to reason over the consistency of perception outputs –across modules and over time– thus enabling fault detection, (ii) allow us to establish formal guarantees on the maximum number of faults that can be uniquely identified in a given perception system, and (iii) enable the design of efficient algorithms for fault identification. We demonstrate our monitoring system, dubbed PerSyS, in realistic simulations using the LGSVL self-driving simulator and the Apollo Auto autonomy software stack, and show that PerSyS is able to detect failures in challenging scenarios (including scenarios that have caused self-driving car accidents in recent years), and is able to correctly identify faults while entailing a minimal computation overhead (< 5 ms on a single-core CPU).

The third annual International Applied Category Theory Conference (ACT2020) was planned to take place at MIT in Cambridge, Massachusetts USA. However, the global COVID-19 pandemic made the prospect of holding a large in-person meeting impossible, and the event was thus held completely online. Holding the talks online had the new benefits of reducing carbon footprint, being inclusive of people from more parts of the world, and producing higher-quality video talks, which have been posted online for posterity. The ACT2020 contributions spanned a broad spectrum of application areas, including databases, dynamical systems, functional programming, game theory, lenses, neuroscience, probabilistic programming, natural language processing, quantum mechanics, and cyberphysical systems. Papers featured a broad range of categorical techniques. Papers in this Proceedings volume represents about half of the talks presented at ACT2020. Being included in the proceedings vs. not is not an indication of talk quality, but instead almost exclusively the choice of the authors, e.g. to present work already published elsewhere.

A compositional sheaf-theoretic framework for the modeling of complex event-based systems is presented. We show that event-based systems are machines, with inputs and outputs, and that they can be composed with machines of different types, all within a unified, sheaf-theoretic formalism. We take robotic systems as an exemplar of complex systems and rigorously describe actuators, sensors, and algorithms using this framework.

A compositional sheaf-theoretic framework for the modeling of complex event-based systems is presented. We show that event-based systems are machines, with inputs and outputs, and that they can be composed with machines of different types, all within a unified, sheaf-theoretic formalism. We take robotic systems as an exemplar of complex systems and rigorously describe actuators, sensors, and algorithms using this framework.

Mereology is the study of parts and the relationships that hold between them. We introduce a behavioral approach to mereology, in which systems and their parts are known only by the types of behavior they can exhibit. Our discussion is formally topos-theoretic, and agnostic to the topos, providing maximal generality; however, by using only its internal logic we can hide the details and readers may assume a completely elementary set-theoretic discussion. We consider the relationship between various parts of a whole in terms of how behavioral constraints are passed between them, and give an inter-modal logic that generalizes the usual alethic modalities in the setting of symmetric accessibility.

Applications of category theory often involve symmetric monoidal categories (SMCs), in which abstract processes or operations can be composed in series and parallel. However, in 2020 there remains a dearth of computational tools for working with SMCs. We present an "unbiased" approach to implementing symmetric monoidal categories, based on an operad of directed, acyclic wiring diagrams. Because the interchange law and other laws of a SMC hold identically in a wiring diagram, no rewrite rules are needed to compare diagrams. We discuss the mathematics of the operad of wiring diagrams, as well as its implementation in the software package Catlab.

What is ergonomic syntax for relations? In this first paper in a series of two, to answer the question we define regular calculi: a suitably structured functor from a category representing the syntax of regular logic to the category of posets, that takes each object to the poset of relations on that type. We introduce two major classes of examples, regular calculi corresponding to regular theories, and regular calculi corresponding to regular categories. For working in regular calculi, we present a graphical framework which takes as primitive the various moves of regular logic. Our main theorem for regular calculi is a syntax-semantics $2$-dimensional adjunction to regular categories.

There is an analogy that is often made between deep neural networks and actual brains, suggested by the nomenclature itself: the "neurons" in deep neural networks should correspond to neurons (or nerve cells, to avoid confusion) in the brain. We claim, however, that this analogy doesn't even type check: it is structurally flawed. In agreement with the slightly glib summary of Hebbian learning as "cells that fire together wire together", this article makes the case that the analogy should be different. Since the "neurons" in deep neural networks are managing the changing weights, they are more akin to the synapses in the brain; instead, it is the wires in deep neural networks that are more like nerve cells, in that they are what cause the information to flow. An intuition that nerve cells seem like more than mere wires is exactly right, and is justified by a precise category-theoretic analogy which we will explore in this article. Throughout, we will continue to highlight the error in equating artificial neurons with nerve cells by leaving "neuron" in quotes or by calling them artificial neurons. We will first explain how to view deep neural networks as nested dynamical systems with a very restricted sort of interaction pattern, and then explain a more general sort of interaction for dynamical systems that is useful throughout engineering, but which fails to adapt to changing circumstances. As mentioned, an analogy is then forced upon us by the mathematical formalism in which they are both embedded. We call the resulting encompassing generalization deeply interacting learning systems: they have complex interaction as in control theory, but adaptation to circumstances as in deep neural networks.

We study polynomial comonads and polynomial bicomodules. Polynomial comonads amount to categories. Polynomial bicomodules between categories amount to parametric right adjoint functors between corresponding copresheaf categories. These may themselves be understood as generalized polynomial functors. They are also called data migration functors because of applications in categorical database theory. We investigate several universal constructions in the framed bicategory of categories, retrofunctors, and parametric right adjoints. We then use the theory we develop to model database aggregation alongside querying, all within this rich ecosystem.

We introduce a concept called a collective: an interface with a protocol for aggregating contributions and distributing returns. Through such a protocol, many members may participate in a mutual endeavor. We present a variety of real-world examples of collectives to explore the many kinds of things that members can contribute (such as time, work, ideas, or resources) as well as the many ways these contributions can be aggregated and returns distributed. In addition, we illustrate several ways in which new collectives can be constructed from old, alluding to the fact that all these constructions have a natural mathematical description within the category of polynomial functors equipped with a certain monoidal structure.

We show that the category of decomposition spaces and CULF maps is locally a topos. Precisely, the slice category over any decomposition space <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper D"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">D</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {D}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a presheaf topos, namely <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sans-serif upper D sans-serif e sans-serif c sans-serif o sans-serif m sans-serif p Subscript slash script upper D Baseline asymptotically-equals sans-serif upper P sans-serif s sans-serif h left-parenthesis t w script upper D right-parenthesis"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="sans-serif">D</mml:mi> <mml:mi mathvariant="sans-serif">e</mml:mi> <mml:mi mathvariant="sans-serif">c</mml:mi> <mml:mi mathvariant="sans-serif">o</mml:mi> <mml:mi mathvariant="sans-serif">m</mml:mi> <mml:mi mathvariant="sans-serif">p</mml:mi> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo>/</mml:mo> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">D</mml:mi> </mml:mrow> </mml:mrow> </mml:msub> <mml:mo> ≃ </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="sans-serif">P</mml:mi> <mml:mi mathvariant="sans-serif">s</mml:mi> <mml:mi mathvariant="sans-serif">h</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>tw</mml:mi> <mml:mo> ⁡ </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">D</mml:mi> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathsf {Decomp}_{/\mathcal {D}}\simeq \mathsf {Psh}(\operatorname {tw} \mathcal {D})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> .

Abstract We show how the display-map category of finite (symmetric) simplicial complexes can be seen as representing the totality of database schemas and instances in a single mathematical structure. We give a sound interpretation of a certain dependent type theory in this model and show how it allows for the syntactic specification of schemas and instances and the manipulation of the same with the usual type-theoretic operations.

Regular logic can be regarded as the internal language of regular categories, but the logic itself is generally not given a categorical treatment. In this paper, we understand the syntax and proof rules of regular logic in terms of the free regular category FRg(T) on a set T. From this point of view, regular theories are certain monoidal 2-functors from a suitable 2-category of contexts -- the 2-category of relations in FRg(T) -- to that of posets. Such functors assign to each context the set of formulas in that context, ordered by entailment. We refer to such a 2-functor as a regular calculus because it naturally gives rise to a graphical string diagram calculus in the spirit of Joyal and Street. We shall show that every natural category has an associated regular calculus, and conversely from every regular calculus one can construct a regular category.

One can think of power series or polynomials in one variable, such as $P(x)=2x^3+x+5$, as functors from the category $\mathsf{Set}$ of sets to itself; these are known as polynomial functors. Denote by $\mathsf{Poly}_{\mathsf{Set}}$ the category of polynomial functors on $\mathsf{Set}$ and natural transformations between them. The constants $0,1$ and operations $+,\times$ that occur in $P(x)$ are actually the initial and terminal objects and the coproduct and product in $\mathsf{Poly}_{\mathsf{Set}}$. Just as the polynomial functors on $\mathsf{Set}$ are the copresheaves that can be written as sums of representables, one can express any Dirichlet series, e.g.\ $\sum_{n=0}^\infty n^x$, as a coproduct of representable presheaves. A Dirichlet polynomial is a finite Dirichlet series, that is, a finite sum of representables $n^x$. We discuss how both polynomial functors and their Dirichlet analogues can be understood in terms of bundles, and go on to prove that the category of Dirichlet polynomials is an elementary topos.

Polynomial functors are sums of covariant representable functors from the category of sets to itself. They have a robust theory with many applications -- from operads and opetopes to combinatorial species. In this paper, we define a contravariant analogue of polynomial functors: Dirichlet functors. We develop the basic theory of Dirichlet functors, and relate them to their covariant analogues.

Dynamical systems---by which we mean machines that take time-varying input, change their state, and produce output---can be wired together to form more complex systems. Previous work has shown how to allow collections of machines to reconfigure their wiring diagram dynamically, based on their collective state. This notion was called "mode dependence", and while the framework was compositional (forming an operad of re-wiring diagrams and algebra of mode-dependent dynamical systems on it), the formulation itself was more "creative" than it was natural. In this paper we show that the theory of mode-dependent dynamical systems can be more naturally recast within the category Poly of polynomial functors. This category is almost superlatively abundant in its structure: for example, it has \emph{four} interacting monoidal structures $(+,\times,\otimes,\circ)$, two of which ($\times,\otimes$) are monoidal closed, and the comonoids for $\circ$ are precisely categories in the usual sense. We discuss how the various structures in Poly show up in the theory of dynamical systems. We also show that the usual coalgebraic formalism for dynamical systems takes place within Poly. Indeed one can see coalgebras as special dynamical systems---ones that do not record their history---formally analogous to contractible groupoids as special categories.

Regular logic can be regarded as the internal language of regular categories, but the logic itself is generally not given a categorical treatment. In this paper, we understand the syntax and proof rules of regular logic in terms of the free regular category FRg(T) on a set T. From this point of view, regular theories are certain monoidal 2-functors from a suitable 2-category of contexts -- the 2-category of relations in FRg(T) -- to that of posets. Such functors assign to each context the set of formulas in that context, ordered by entailment. We refer to such a 2-functor as a regular calculus because it naturally gives rise to a graphical string diagram calculus in the spirit of Joyal and Street. We shall show that every natural category has an associated regular calculus, and conversely from every regular calculus one can construct a regular category.

Category theory is unmatched in its ability to organize and layer abstractions and to find commonalities between structures of all sorts. No longer the exclusive preserve of pure mathematicians, it is now proving itself to be a powerful tool in science, informatics, and industry. By facilitating communication between communities and building rigorous bridges between disparate worlds, applied category theory has the potential to be a major organizing force. This book offers a self-contained tour of applied category theory. Each chapter follows a single thread motivated by a real-world application and discussed with category-theoretic tools. We see data migration as an adjoint functor, electrical circuits in terms of monoidal categories and operads, and collaborative design via enriched profunctors. All the relevant category theory, from simple to sophisticated, is introduced in an accessible way with many examples and exercises, making this an ideal guide even for those without experience of university-level mathematics.

Category theory is unmatched in its ability to organize and layer abstractions and to find commonalities between structures of all sorts. No longer the exclusive preserve of pure mathematicians, it is now proving itself to be a powerful tool in science, informatics, and industry. By facilitating communication between communities and building rigorous bridges between disparate worlds, applied category theory has the potential to be a major organizing force. This book offers a self-contained tour of applied category theory. Each chapter follows a single thread motivated by a real-world application and discussed with category-theoretic tools. We see data migration as an adjoint functor, electrical circuits in terms of monoidal categories and operads, and collaborative design via enriched profunctors. All the relevant category theory, from simple to sophisticated, is introduced in an accessible way with many examples and exercises, making this an ideal guide even for those without experience of university-level mathematics.

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

A supervised learning algorithm searches over a set of functions <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A\rightarrow B$</tex> parametrised by a space <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$P$</tex> to find the best approximation to some ideal function <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$f:A\rightarrow B$</tex> . It does this by taking examples <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(a, f(a))\in A\times B$</tex> , and updating the parameter according to some rule. We define a category where these update rules may be composed, and show that gradient descent-with respect to a fixed step size and an error function satisfying a certain property-defines a monoidal functor from a category of parametrised functions to this category of update rules. A key contribution is the notion of request function. This provides a structural perspective on backpropagation, giving a broad generalisation of neural networks and linking it with structures from bidirectional programming and open games.

Automata are machines, which receive inputs, accordingly update their internal state, and produce output, and are a common abstraction for the basic building blocks used in engineering and science to describe and design complex systems. These arbitrarily simple machines can be wired together—so that the output of one is passed to another as its input—to form more complex machines. Indeed, both modern computers and biological systems can be described in this way, as assemblies of transistors or assemblies of simple cells. The complexity is in the network, i.e., the connection patterns between simple machines. The main result of this paper is to show that the range of simplicity for parts as compared to the complexity for wholes is in some sense complete: the most complex automaton can be obtained by wiring together direct-output memoryless components. The model we use—discrete-time automata sending each other messages from a fixed set of possibilities—is certainly more appropriate for computer systems than for biological systems. However, the result leads one to wonder what might be the simplest sort of machines, broadly construed, that can be assembled to produce the behaviour found in biological systems, including the brain.

Categorical Query Language is an open-source query and data integration scripting language that can be applied to common challenges in the field of computational science. We discuss how the structure-preserving nature of CQL data migrations protect those who publicly share data from the misinterpretation of their data. Likewise, this feature of CQL migrations allows those who draw from public data sources to be sure only data which meets their specification will actually be transferred. We argue some open problems in the field of data sharing in computational science are addressable by working within this paradigm of functorial data migration. We demonstrate these tools by integrating data from the Open Quantum Materials Database with some alternative materials databases.

We present an elementary introduction to a new logic for reasoning about behaviors that occur over time. This logic is based on temporal type theory. The syntax of the logic is similar to the usual first-order logic; what differs is the notion of truth value. Instead of reasoning about whether formulas are true or false, our logic reasons about temporal landscapes. A temporal landscape may be thought of as representing the set of durations over which a statement is true. To help understand the practical implications of this approach, we give a wide variety of examples where this logic is used to reason about autonomous agents.

Lenses have a rich history and have recently received a great deal of attention from applied category theorists. We generalize the notion of lens by defining a category $\mathsf{Lens}_F$ for any category $\mathcal{C}$ and functor $F\colon \mathcal{C}^{\rm op}\to\mathsf{Cat}$, using a variant of the Grothendieck construction. All of the mathematics in this note is straightforward; the purpose is simply to see lenses in a broader context where some closely-related examples, such as ringed spaces and open continuous dynamical systems, can be included.

Lenses have a rich history and have recently received a great deal of\nattention from applied category theorists. We generalize the notion of lens by\ndefining a category $\\mathsf{Lens}_F$ for any category $\\mathcal{C}$ and\nfunctor $F\\colon \\mathcal{C}^{\\rm op}\\to\\mathsf{Cat}$, using a variant of the\nGrothendieck construction. All of the mathematics in this note is\nstraightforward; the purpose is simply to see lenses in a broader context where\nsome closely-related examples, such as ringed spaces and open continuous\ndynamical systems, can be included.\n

It is common to encounter symmetric monoidal categories $\mathcal{C}$ for which every object is equipped with an algebraic structure, in a way that is compatible with the monoidal product and unit in $\mathcal{C}$. We define this formally and say that $\mathcal{C}$ supplies the algebraic structure. For example, the category $\mathsf{Rel}$ of relations between sets has monoidal structures given by both cartesian product and disjoint union, and with respect to either one it supplies comonoids. We prove several facts about the notion of supply, e.g. that the associators, unitors, and braiding of $\mathcal{C}$ are automatically homomorphisms for any supply, as are the coherence isomorphisms for any strong symmetric monoidal functor that preserve supplies. We also show that any supply of structure in a symmetric monoidal category can be extended to a supply of that structure on its strictification.

Regular logic is the fragment of first order logic generated by $=$, $\top$, $\wedge$, and $\exists$. A key feature of this logic is that it is the minimal fragment required to express composition of binary relations; another is that it is the internal logic of regular categories. The link between these two facts is that in any regular category, one may construct a notion of binary relation using jointly-monic spans; this results in what is known as the bicategory of relations of the regular category. In this paper we provide a direct axiomatization of bicategories of relations, which we term relational po-categories, reinterpreting the earlier work of Carboni and Walters along these lines. Our main contribution is an explicit proof that the 2-category of regular categories is equivalent to that of relational po-categories. Throughout, we emphasize the graphical nature of relational po-categories.

We present an elementary introduction to a new logic for reasoning about behaviors that occur over time. This logic is based on temporal type theory. The syntax of the logic is similar to the usual first-order logic; what differs is the notion of truth value. Instead of reasoning about whether formulas are true or false, our logic reasons about temporal landscapes. A temporal landscape may be thought of as representing the set of durations over which a statement is true. To help understand the practical implications of this approach, we give a wide variety of examples where this logic is used to reason about autonomous systems.

International audience

Category theory is presented as a mathematical modelling framework that highlights the relationships between objects, rather than the objects in themselves. A working definition of model is given, and several examples of mathematical objects, such as vector spaces, groups, and dynamical systems, are considered as categorical models.

Complex systems of systems (SoS) are characterized by multiple interconnected subsystems. Typically, each subsystem is designed and analyzed using methodologies and formalisms that are specific to the particular subsystem model of computation considered --- Petri nets, continuous time ODEs, nondeterministic automata, to name a few. When interconnecting subsystems, a designer needs to choose, based on the specific subsystems models, a common abstraction framework to analyze the composition. In this paper we introduce a new framework for abstraction, composition and analysis of SoS that builds on results and methods developed in sheaf theory, category theory and topos theory. In particular, we will be modeling behaviors of systems using sheaves, leverage category theoretic methods to define wiring diagrams and formalize composition and, by establishing a connection with topos theory, define a formal (intuitionistic/constructive) logic with a sound sheaf semantics

This book is an invitation to discover advanced topics in category theory through concrete, real-world examples. It aims to give a tour: a gentle, quick introduction to guide later exploration. The tour takes place over seven sketches, each pairing an evocative application, such as databases, electric circuits, or dynamical systems, with the exploration of a categorical structure, such as adjoint functors, enriched categories, or toposes. No prior knowledge of category theory is assumed. A feedback form for typos, comments, questions, and suggestions is available here: https://docs.google.com/document/d/160G9OFcP5DWT8Stn7TxdVx83DJnnf7d5GML0_FOD5Wg/edit

This book is an invitation to discover advanced topics in category theory\nthrough concrete, real-world examples. It aims to give a tour: a gentle, quick\nintroduction to guide later exploration. The tour takes place over seven\nsketches, each pairing an evocative application, such as databases, electric\ncircuits, or dynamical systems, with the exploration of a categorical\nstructure, such as adjoint functors, enriched categories, or toposes.\n No prior knowledge of category theory is assumed.\n A feedback form for typos, comments, questions, and suggestions is available\nhere:\nhttps://docs.google.com/document/d/160G9OFcP5DWT8Stn7TxdVx83DJnnf7d5GML0_FOD5Wg/edit\n

Hypergraph categories have been rediscovered at least five times, under various names, including well-supported compact closed categories, dgs-monoidal categories, and dungeon categories. Perhaps the reason they keep being reinvented is two-fold: there are many applications---including to automata, databases, circuits, linear relations, graph rewriting, and belief propagation---and yet the standard definition is so involved and ornate as to be difficult to find in the literature. Indeed, a hypergraph category is, roughly speaking, a "symmetric monoidal category in which each object is equipped with the structure of a special commutative Frobenius monoid, satisfying certain coherence conditions". Fortunately, this description can be simplified a great deal: a hypergraph category is simply a "cospan-algebra". The goal of this paper is to remove the scare-quotes and make the previous statement precise. We prove two main theorems. First is a coherence theorem for hypergraph categories, which says that every hypergraph category is equivalent to an objectwise-free hypergraph category. Second, we prove that the category of objectwise-free hypergraph categories is equivalent to the category of cospan-algebras.

The Pixel Array (PA) Method, originally introduced by Spivak et. al., is a fast method for solving nonlinear or linear systems. One of its distinguishing features is that it presents all solutions within a bounding box, represented by a plot whose axes are the values of "exposed variables." Here we develop a set-theoretic variant of the PA method, named the Pixel Array Solution-Set (PASS) method, that gives PA access to "hidden variables" whose values are not displayed on plot axes. We evaluate the effectiveness of PASS at numerically finding steady states for several partial differential equations. We discretize several one-dimensional solved reaction-diffusion equations, such as the Fisher equation and the Benjamin-Bona-Mohany equation, using finite differences. Then, we run PASS on each equation, and determine whether it successfully finds all boundary conditions for which a numerical steady state might exist. Then we verify whether the steady states found by PASS are correct. Finally, we discuss the benefits and weaknesses of PASS.

The Pixel Array (PA) Method, originally introduced by Spivak et. al., is a\nfast method for solving nonlinear or linear systems. One of its distinguishing\nfeatures is that it presents all solutions within a bounding box, represented\nby a plot whose axes are the values of "exposed variables." Here we develop a\nset-theoretic variant of the PA method, named the Pixel Array Solution-Set\n(PASS) method, that gives PA access to "hidden variables" whose values are not\ndisplayed on plot axes. We evaluate the effectiveness of PASS at numerically\nfinding steady states for several partial differential equations. We discretize\nseveral one-dimensional solved reaction-diffusion equations, such as the Fisher\nequation and the Benjamin-Bona-Mohany equation, using finite differences. Then,\nwe run PASS on each equation, and determine whether it successfully finds all\nboundary conditions for which a numerical steady state might exist. Then we\nverify whether the steady states found by PASS are correct. Finally, we discuss\nthe benefits and weaknesses of PASS.\n

Mereology is the study of parts and the relationships that hold between them. We introduce a behavioral approach to mereology, in which systems and their parts are known only by the types of behavior they can exhibit. Our discussion is formally topos-theoretic, and agnostic to the topos, providing maximal generality; however, by using only its internal logic we can hide the details and readers may assume a completely elementary set-theoretic discussion. We consider the relationship between various parts of a whole in terms of how behavioral constraints are passed between them, and give an inter-modal logic that generalizes the usual alethic modalities in the setting of symmetric accessibility.

Regular logic can be regarded as the internal language of regular categories, but the logic itself is generally not given a categorical treatment. In this paper, we understand the syntax and proof rules of regular logic in terms of the free regular category $\mathsf{FRg}(\mathrm{T})$ on a set $\mathrm{T}$. From this point of view, regular theories are certain monoidal 2-functors from a suitable 2-category of contexts---the 2-category of relations in $\mathsf{FRg}(\mathrm{T})$---to the 2-category of posets. Such functors assign to each context the set of formulas in that context, ordered by entailment. We refer to such a 2-functor as a regular calculus because it naturally gives rise to a graphical string diagram calculus in the spirit of Joyal and Street. Our key aim to prove that the category of regular categories is essentially reflective in that of regular calculi. Along the way, we demonstrate how to use this graphical calculus.

OBJECTIVE: Through intensive experience sampling, we studied the practice and development of mindfulness as a dynamic process in time and context. We focused on role(s) and salutary function(s) of mindfulness and decentering for emotional experience over the course of mindfulness practice and development. METHOD: (SD) = 25.05 (3.26) years, participated in a 1-month, 6-session, Mahasi-based mindfulness-training intervention (Mahasi, 1978). We collected 52 digital experience samples of mindfulness, decentering, and emotional experience, in the context of daily living and meditative states, over the course of the program. RESULTS: Data were analyzed via time-varying effects models (TVEMs) and mixed-linear models (MLMs) within a single-subject, multiple-baseline experimental design. First, over the course of the intervention, participants grew more mindful and decentered in daily living and meditative states. Second, the association between mindfulness and decentering was significant in daily living, although the magnitude of this association was stronger in meditative states. Third, we observed the same contextualized pattern of relations between mindfulness and emotional valence (happy > sad) as well as arousal (calm > nervous). Finally, whereas decentering mediated the effect of mindfulness on reduced emotional arousal in meditative states, it did not similarly mediate the effect of mindfulness on positive emotional valence. CONCLUSIONS: The present findings illustrate the insights that may be gained about mindfulness mechanisms broadly and decentering specifically through the study of mindfulness as a dynamic, contextualized developmental process over time. (PsycINFO Database Record

This book introduces a temporal type theory, the first of its kind as far as we know. It is based on a standard core, and as such it can be formalized in a proof assistant such as Coq or Lean by adding a number of axioms. Well-known temporal logics---such as Linear and Metric Temporal Logic (LTL and MTL)---embed within the logic of temporal type theory. The types in this theory represent "behavior types". The language is rich enough to allow one to define arbitrary hybrid dynamical systems, which are mixtures of continuous dynamics---e.g. as described by a differential equation---and discrete jumps. In particular, the derivative of a continuous real-valued function is internally defined. We construct a semantics for the temporal type theory in the topos of sheaves on a translation-invariant quotient of the standard interval domain. In fact, domain theory plays a recurring role in both the semantics and the type theory.

Databases have been studied category-theoretically for decades.While mathematically elegant, previous categorical models have typically struggled with representing concrete data such as integers or strings.In the present work, we propose an extension of the earlier set-valued functor model, making use of multi-sorted algebraic theories (a.k.a.Lawvere theories) to incorporate concrete data in a principled way.This approach easily handles missing information (null values), and also allows constraints and queries to make use of operations on data, such as multiplication or comparison of numbers, helping to bridge the gap between traditional databases and programming languages.We also show how all of the components of our model including schemas, instances, change-of-schema functors, and queries t into a single double categorical structure called a proarrow equipment (a.k.a.framed bicategory).10 Implementation 612 A Componentwise composition and exponentiation in

For many networks, the connection pattern (often called the topology) can vary in time, depending on the changing state of the modules within the network. This paper addresses the issue of nesting such mode-dependent networks, in which a local network can be abstracted as a single module in a larger network. Each module in the network represents a dynamical system, whose behaviour includes repeatedly updating its communicative mode, and these mode in turn dictate the connection pattern. It is in this way that the dynamics of the modules controls the topology of the networks at all levels. This paper provides a formal semantics, using the category-theoretic framework of operads and their algebras, to capture the nesting property and dynamics of mode-dependent networks. We provide a detailed running example to ground the mathematics.

A new technique for approximating the entire solution set, in any bounding box, for a nonlinear system of relations (nonlinear equations, inequalities, etc. involving algebraic, smooth, or even continuous functions) is presented. The technique is to first plot each function as a pixel matrix, and to then perform a sequence of basic matrix operations, as dictated by how variables are shared by the relations in the system. The result is a pixel matrix graphing the approximated simultaneous solution set for the system.

The goal of this paper is to illustrate the use of category theory (CT) as a basis for the integration of manufacturing service databases. In this paper, we use as our reference prior work by Kulvatunyou et al. (2013, “An Analysis of OWL-Based Semantic Mediation Approaches to Enhance Manufacturing Service Capability Models,” Int. J. Comput. Integr. Manuf., 27(9), pp. 803–823) on the use of web ontology language (OWL)-based semantic web tools to study the integration of different manufacturing service capability (MSC) databases using a generic-model approach that they propose in their paper. We approach the same task using a different set of tools, specifically CT and FQL, a functorial query language based on categorical mathematics. This work demonstrates the potential utility of category-theoretic information management tools and illustrates some advantages of categorical techniques for the integration and evolution of databases. We conclude by making the case that a category-theoretic approach can provide a more flexible and robust approach to integration of existing and evolving information.

It is well known that the category of finite sets and cospans, composed by pushout, contains the universal special commutative Frobenius algebra. In this paper, we observe that the same construction yields also general commutative Frobenius algebras, if just the pushouts are changed to homotopy pushouts.

Jonathan Herzig, Guy Feigenblat, Michal Shmueli-Scheuer, David Konopnicki, Anat Rafaeli, Daniel Altman, David Spivak. Proceedings of the 17th Annual Meeting of the Special Interest Group on Discourse and Dialogue. 2016.

Many systems of interest in science and engineering are made up of interacting subsystems. These subsystems, in turn, could be made up of collections of smaller interacting subsystems and so on. In a series of papers David Spivak with collaborators formalized these kinds of structures (systems of systems) as algebras over presentable colored operads. It is also very useful to consider maps between dynamical systems. This amounts to viewing dynamical systems as objects in an appropriate category. This is the point taken by DeVille and Lerman in the study of dynamics on networks. The goal of this paper is to describe an algebraic structure that encompasses both approaches to systems of systems. To this end we replace the monoidal category of wiring diagrams by a monoidal double category whose objects are surjective submersions. This allows us, on one hand, build new large open systems out of collections of smaller open subsystems and on the other keep track of maps between open systems. As a special case we recover the results of DeVille and Lerman on fibrations of networks of manifolds.

We present a new method, called the pixel array method, for approximating all solutions in a bounding box for an arbitrary nonlinear system of relations. In contrast with other solvers, our approach requires that the user must specify which variables are to be exposed, and which are to be left latent. The entire solution set is then obtained---in terms of these exposed variables---by performing a series of array multiplications on the $n_i$-dimensional plots of the individual relations $R_i$. This procedure introduces no false negatives and is much faster than Newton-based solvers. The key is the unexposed variables, which Newton methods can make no use of. In fact, we found that with even a single unexposed variable our method was more than 10x faster than Julia's NLsolve. Due to its relative simplicity, the pixel array method is also applicable to a broader class of systems than Newton-based solvers are. The purpose of this article is to give an account of this new method.

Abstract. Previous work has demonstrated that categories are useful and expressive models for databases. In the present paper we build on that model, showing that certain queries and constraints correspond to lifting problems, as found in modern approaches to algebraic topology. In our formulation, each so-called SPARQL graph pattern query corresponds to a category-theoretic lifting problem, whereby the set of solutions to the query is precisely the set of lifts. We interpret constraints within the same formalism and then investigate some basic properties of queries and constraints. In particular, to any database pi we can associate a certain derived database Qry(pi) of queries on pi. As an application, we explain how giving users access to certain parts of Qry(pi), rather than direct access to pi, improves ones ability to manage the impact of schema evolution. Contents

Biological materials, such as proteins, often have a hierarchical structure ranging from basic building blocks at the nanoscale (e.g., amino acids) to assembled structures at the macroscale (e.g., fibers). Current software for materials engineering allows the user to specify polypeptide chains and simple secondary structures prior to molecular dynamics simulation, but is not flexible in terms of the geometric arrangement of unequilibrated structures. Given some knowledge of a larger-scale structure, instructing the software to create it can be very difficult and time-intensive. To this end, the present paper reports a mathematical language, using category theory, to describe the architecture of a material, i.e., its set of building blocks and instructions for combining them. While this framework applies to any hierarchical material, here we concentrate on proteins. We implement this mathematical language as an open-source Python library called Matriarch. It is a domain-specific language that gives the user the ability to create almost arbitrary structures with arbitrary amino acid sequences and, from them, generate Protein Data Bank (PDB) files. In this way, Matriarch is more powerful than commercial software now available. Matriarch can be used in tandem with molecular dynamics simulations and helps engineers design and modify biologically inspired materials based on their desired functionality. As a case study, we use our software to alter both building blocks and building instructions for tropocollagen, and determine their effect on its structure and mechanical properties.

We apply the mathematical framework of category theory to articulate the precise relation between the structure and mechanics of a nanoscale system in a macroscopic domain. We maintain the chosen molecular mechanical properties from the nanoscale to the continuum scale. Therein we demonstrate a procedure to 'protoype a model', as category theory enables us to maintain certain information across disparate fields of study, distinct scales, or physical realizations. This process fits naturally with prototyping, as a prototype is not a complete product but rather a reduction to test a subset of properties. To illustrate this point, we use large-scale multi-material printing to examine the scaling of the elastic modulus of 2D carbon allotropes at the macroscale and validate our printed model using experimental testing. The resulting hand-held materials can be examined more readily, and yield insights beyond those available in the original digital representations. We demonstrate this concept by twisting the material, a test beyond the scope of the original model. The method developed can be extended to other methods of additive manufacturing.

We study the data transformation capabilities associated with schemas that are presented by directed multi-graphs and path equations. Unlike most approaches which treat graph-based schemas as abbreviations for relational schemas, we treat graph-based schemas as categories. A schema S is a finitely-presented category, and the collection of all S-instances forms a category, S-inst. A functor F between schemas S and T, which can be generated from a visual mapping between graphs, induces three adjoint data migration functors, Sigma_F : S-inst -> T-inst, Pi_F : S-inst -> T-inst, and Delta_F : T-inst -> S-inst. We present an algebraic query language FQL based on these functors, prove that FQL is closed under composition, prove that FQL can be implemented with the select-project-product-union relational algebra (SPCU) extended with a key-generation operation, and prove that SPCU can be implemented with FQL.

In this paper we describe a functorial data migration scenario about the manufacturing service capability of a distributed supply chain. The scenario is a category-theoretic analog of an OWL ontology-based semantic enrichment scenario developed at the National Institute of Standards and Technology (NIST). The scenario is presented using, and is included with, the open-source FQL tool, available for download at categoricaldata.net/fql.html.

For many networks, the connection pattern (often called the topology) can vary in time, depending on the changing state, or mode, of the modules within the network. For example, "airplane mode" is the name for one communicative mode of a modern cellphone, in which it will not connect with any cellphone towers; thus the topology of the cellular network is dependent on the modes of its modules. This paper addresses the issue of nesting such mode-dependent networks, in which a local network can be abstracted as a single module in a larger network. Each module in the network represents a dynamic system, whose behavior includes repeatedly updating its communicative mode. It is in this way that the dynamics of the modules controls the topology of the networks at all levels. This paper provides a formal semantics, using the category-theoretic framework of operads and their algebras, to capture the nesting property and dynamics of mode-dependent networks. We provide a detailed running example to ground the mathematics.

We define the notion of linguistic structure on a small category, in order to provide a more formal description of ontology logs, also known as ologs, introduced by R. E. Kent and D. I. Spivak in their paper "Ologs: A categorical framework for knowledge representation." In particular, we construct a bicategory $\mathsf{Eng}$, of English noun phrases and verb phrases, endorsed as functional by varying sets of authors. An olog is then defined as a lax functor to $\mathsf{Eng}$. We then present a new notion of linguistic functor, which extends Spivak's notion of meaningful functors. Finally, we discuss the relationship between ologs and databases in this context.

We describe an alternative solution to the impedance-mismatch problem between programming and query languages: rather than embed queries in a programming language, as done in LINQ systems, we embed programs in a query language, and dub the result QINL.

Open dynamical systems are mathematical models of machines that take input, change their internal state, and produce output. For example, one may model anything from neurons to robots in this way. Several open dynamical systems can be arranged in series, in parallel, and with feedback to form a new dynamical system---this is called compositionality---and the process can be repeated in a fractal-like manner to form more complex systems of systems. One issue is that as larger systems are created, their state space grows exponentially. In this paper a technique for calculating the steady states of an interconnected system of systems, in terms of the steady states of its component dynamical systems, is provided. These are organized into "steady state matrices" which generalize bifurcation diagrams. It is shown that the compositionality structure of dynamical systems fits with the familiar monoidal structure for the steady state matrices, where serial, parallel, and feedback composition of matrices correspond to multiplication, Kronecker product, and partial trace operations. The steady state matrices of dynamical systems respect this compositionality structure, exponentially reducing the complexity involved in studying the steady states of composite dynamical systems.

Open dynamical systems are mathematical models of machines that take input,\nchange their internal state, and produce output. For example, one may model\nanything from neurons to robots in this way. Several open dynamical systems can\nbe arranged in series, in parallel, and with feedback to form a new dynamical\nsystem---this is called compositionality---and the process can be repeated in a\nfractal-like manner to form more complex systems of systems. One issue is that\nas larger systems are created, their state space grows exponentially.\n In this paper a technique for calculating the steady states of an\ninterconnected system of systems, in terms of the steady states of its\ncomponent dynamical systems, is provided. These are organized into "steady\nstate matrices" which generalize bifurcation diagrams. It is shown that the\ncompositionality structure of dynamical systems fits with the familiar monoidal\nstructure for the steady state matrices, where serial, parallel, and feedback\ncomposition of matrices correspond to multiplication, Kronecker product, and\npartial trace operations. The steady state matrices of dynamical systems\nrespect this compositionality structure, exponentially reducing the complexity\ninvolved in studying the steady states of composite dynamical systems.\n

In this paper, we use the language of operads to study open dynamical systems.More specifically, we study the algebraic nature of assembling complex dynamical systems from an interconnection of simpler ones.The syntactic architecture of such interconnections is encoded using the visual language of wiring diagrams.We define the symmetric monoidal category W, from which we may construct an operad OW, whose objects are black boxes with input and output ports, and whose morphisms are wiring diagrams, thus prescribing the algebraic rules for interconnection.We then define two W-algebras G and L, which associate semantic content to the structures in W. Respectively, they correspond to general and to linear systems of differential equations, in which an internal state is controlled by inputs and produces outputs.As an example, we use these algebras to formalize the classical problem of systems of tanks interconnected by pipes, and hence make explicit the algebraic relationships among systems at different levels of granularity.

In this paper we describe a simple equational formalism for expressing functorial data migration. A graphical IDE and implementation of this formalism are available at categoricaldata.net/fql.html.

Establishing an assurance claim for a distributed safety critical system has proven extremely difficult. Developing and documenting the evidence needed to support a claim requires diverse models and abstractions of system properties to capture behaviors, understand error propagation, and evaluate the interactions with other systems and humans. The ability to scale and merge these diverse models and abstractions within a sound mathematical framework is the subject of this technical report. Category theory is one promising approach for this mathematical framework. A higher category theory known as operad theory is described and used to evaluate the effects of disruptions and failures of NextGen communication channels on the safe separation of aircraft within the National Airspace (NAS).

Biological materials, such as proteins, often have a hierarchical structure ranging from basic building blocks at the nanoscale (e.g., amino acids) to assembled structures at the macroscale (e.g., fibers). Current software for materials engineering allows the user to specify polypeptide chains and simple secondary structures prior to molecular dynamics simulation, but is not flexible in terms of the geometric arrangement of unequilibrated structures. Given some knowledge of a larger-scale structure, instructing the software to create it can be very difficult and time-intensive. To this end, the present paper reports a mathematical language, using category theory, to describe the architecture of a material, i.e., its set of building blocks and instructions for combining them. While this framework applies to any hierarchical material, here we concentrate on proteins. We implement this mathematical language as an open-source Python library called Matriarch. It is a domain-specific language that gives the user the ability to create almost arbitrary structures with arbitrary amino acid sequences and, from them, generate Protein Data Bank (PDB) files. In this way, Matriarch is more powerful than commercial software now available. Matriarch can be used in tandem with molecular dynamics simulations and helps engineers design and modify biologically inspired materials based on their desired functionality. As a case study, we use our software to alter both building blocks and building instructions for tropocollagen, and determine their effect on its structure and mechanical properties.

We describe our experience implementing a broad category-theory library in Coq. Category theory and computational performance are not usually mentioned in the same breath, but we have needed substantial engineering effort to teach Coq to cope with large categorical constructions without slowing proof script processing unacceptably. In this paper, we share the lessons we have learned about how to represent very abstract mathematical objects and arguments in Coq and how future proof assistants might be designed to better support such reasoning. One particular encoding trick to which we draw attention allows category-theoretic arguments involving duality to be internalized in Coq's logic with definitional equality. Ours may be the largest Coq development to date that uses the relatively new Coq version developed by homotopy type theorists, and we reflect on which new features were especially helpful.

In this paper, we use the language of operads to study open dynamical systems. More specifically, we study the algebraic nature of assembling complex dynamical systems from an interconnection of simpler ones. The syntactic architecture of such interconnections is encoded using the visual language of wiring diagrams. We define the symmetric monoidal category W, from which we may construct an operad O(W), whose objects are black boxes with input and output ports, and whose morphisms are wiring diagrams, thus prescribing the algebraic rules for interconnection. We then define two W-algebras, G and L, which associate semantic content to the structures in W. Respectively, they correspond to general and to linear systems of differential equations, in which an internal state is controlled by inputs and produces outputs. As an example, we use these algebras to formalize the classical problem of systems of tanks interconnected by pipes, and hence make explicit the algebraic relationships among systems at different levels of granularity.

Written to be contributed as the "mathematical modeling" chapter of a book, edited by Elaine Landry, to be titled "Categories for the Working Philosopher". In this chapter, category theory is presented as a mathematical modeling framework that highlights the relationships between objects, rather than the objects in themselves. A working definition of model is given, and several examples of mathematical objects, such as vector spaces, groups, and dynamical systems, are considered as categorical models.

This chapter contains sections titled: 2.1 Sets and functions, 2.2 Commutative diagrams, 2.3 Ologs

This chapter contains sections titled: 3.1 Products and coproducts, 3.2 Finite limits in Set, 3.3 Finite colimits in Set, 3.4 Other notions in Set

This chapter contains sections titled: 5.1 Categories and functors, 5.2 Common categories and functors from pure math, 5.3 Natural transformations, 5.4 Categories and schemas are equivalent, Cat ≃ Sch

This chapter contains sections titled: 4.1 Monoids, 4.2 Groups, 4.3 Graphs, 4.4 Orders, 4.5 Databases: schemas and instances

This chapter contains sections titled: 7.1 Adjoint functors, 7.2 Categories of functors, 7.3 Monads, 7.4 Operads

There are many books designed to introduce category theory to either a mathematical audience or a computer science audience. In this book, our audience is the broader scientific community. We attempt to show that category theory can be applied throughout the sciences as a framework for modeling phenomena and communicating results. In order to target the scientific audience, this book is example-based rather than proof-based. For example, monoids are framed in terms of agents acting on objects, sheaves are introduced with primary examples coming from geography, and colored operads are discussed in terms of their ability to model self-similarity. A new version with solutions to exercises will be available through MIT Press.

Wiring diagrams, as seen in digital circuits, can be nested hierarchically and thus have an aspect of self-similarity. We show that wiring diagrams form the morphisms of an operad $\mcT$, capturing this self-similarity. We discuss the algebra $\Rel$ of mathematical relations on $\mcT$, and in so doing use wiring diagrams as a graphical language with which to structure queries on relational databases. We give the example of circuit diagrams as a special case. We move on to show how plug-and-play devices and also recursion can be formulated in the operadic framework as well. Throughout we include many examples and figures.

We investigate the hierarchical structure of processes using the mathematical theory of operads. Information or material enters a given process as a stream of inputs, and the process converts it to a stream of outputs. Output streams can then be supplied to other processes in an organized manner, and the resulting system of interconnected processes can itself be considered a macro process. To model the inherent structure in this kind of system, we define an operad $\mathcal{W}$ of black boxes and directed wiring diagrams, and we define a $\mathcal{W}$-algebra $\mathcal{P}$ of processes (which we call propagators, after Radul and Sussman). Previous operadic models of wiring diagrams use undirected wires without length, useful for modeling static systems of constraints, whereas we use directed wires with length, useful for modeling dynamic flows of information. We give multiple examples throughout to ground the ideas.

The goal of this class is to prove that category theory is a powerful language for understanding and formalizing common scientific models. The power of the language will be tested by its ability to penetrate into taken-for-granted ideas, either by exposing existing weaknesses or flaws in our understanding, or by highlighting hidden commonalities across scientific fields.

Abstract An important objective in materials design is to develop a systematic methodology for replacing unavailable or expensive material building blocks by simpler and abundant ones, while maintaining or improving the functionality of the material. The mathematical field of category theory provides a formal specification language which lies at the heart of such a methodology. In this paper, we apply material ologs, category‐theoretic descriptions of hierarchical materials, to rigorously define a process by which material building blocks can be replaced by others while maintaining large‐scale properties, to the extent possible. We demonstrate the implementation of this approach by using algebraic techniques to predict concrete conditions needed for building block replacement. As an example, we specify structure–function relationships in two systems: a laminated composite and a structure–function analogue, a fruit salad. In both systems we illustrate how ologs provide us with a mathematical tool that allows us to replace one building block with others to achieve approximately the same functionality, and how to use them to model and design seemingly distinct physical systems with a consistent mathematical framework.

In this paper we introduce the olog, or ontology log, a category-theoretic model for knowledge representation (KR). Grounded in formal mathematics, ologs can be rigorously formulated and cross-compared in ways that other KR models (such as semantic networks) cannot. An olog is similar to a relational database schema; in fact an olog can serve as a data repository if desired. Unlike database schemas, which are generally difficult to create or modify, ologs are designed to be user-friendly enough that authoring or reconfiguring an olog is a matter of course rather than a difficult chore. It is hoped that learning to author ologs is much simpler than learning a database definition language, despite their similarity. We describe ologs carefully and illustrate with many examples. As an application we show that any primitive recursive function can be described by an olog. We also show that ologs can be aligned or connected together into a larger network using functors. The various methods of information flow and institutions can then be used to integrate local and global world-views. We finish by providing several different avenues for future research.

We use monads to relax the atomicity requirement for data in a database. Depending on the choice of monad, the database fields may contain generalized values such as lists or sets of values, or they may contain exceptions such as various types of nulls. The return operation for monads ensures that any ordinary database instance will count as one of these generalized instances, and the bind operation ensures that generalized values behave well under joins of foreign key sequences. Different monads allow for vastly different types of information to be stored in the database. For example, we show that classical concepts like Markov chains, graphs, and finite state automata are each perfectly captured by a different monad on the same schema.

Materials in biology span all the scales from Angstroms to meters and typically consist of complex hierarchical assemblies of simple building blocks. Here we describe an application of category theory to describe structural and resulting functional properties of biological protein materials by developing so-called ologs. An olog is like a "concept web" or "semantic network" except that it follows a rigorous mathematical formulation based on category theory. This key difference ensures that an olog is unambiguous, highly adaptable to evolution and change, and suitable for sharing concepts with other olog. We consider simple cases of beta-helical and amyloid-like protein filaments subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties. We also construct a representation of a social network in which people send text-messages to their nearest neighbors and act as a team to perform a task. We show that the olog for the protein and the olog for the social network feature identical category-theoretic representations, and we proceed to precisely explicate the analogy or isomorphism between them. The examples presented here demonstrate that the intrinsic nature of a complex system, which in particular includes a precise relationship between structure and function at different hierarchical levels, can be effectively represented by an olog. This, in turn, allows for comparative studies between disparate materials or fields of application, and results in novel approaches to derive functionality in the design of de novo hierarchical systems. We discuss opportunities and challenges associated with the description of complex biological materials by using ologs as a powerful tool for analysis and design in the context of materiomics, and we present the potential impact of this approach for engineering, life sciences, and medicine.

Abstract : This report will summarize my progress toward fulfilling the goals of ONR grant N000141010841 (Categorical Information Theory) during the first year performance period, June 15, 2010 through June 15, 2011. During this time, I have been hosted as a postdoctoral associate in the mathematics department at the Massachusetts Institute of Technology under Professor Haynes Miller. The Technical Proposal for this grant can be found online at: http://math.mit.edu/-dspivakk/informatics/technical proposal2010.pdf.

We give a new construction for rigidifying a quasi-category into a simplicial category, and prove that it is weakly equivalent to the rigidification given by Lurie. Our construction comes from the use of necklaces, which are simplicial sets obtained by stringing simplices together. As an application of these methods, we use our model to reprove some basic facts from Lurie [13] about the rigidification process. 55U40; 18G30, 18B99

Abstract Complex hierarchical structures composed of simple nanoscale building blocks form the basis of most biological materials. Here, we demonstrate how analogies between seemingly different fields enable the understanding of general principles by which functional properties in hierarchical systems emerge, similar to an analogy learning process. Specifically, natural hierarchical materials like spider silk exhibit properties comparable to classical music in terms of their hierarchical structure and function. As a comparative tool, here, we apply hierarchical ontology logs that follow a rigorous mathematical formulation based on category theory to provide an insightful system representation by expressing knowledge in a conceptual map. We

We define a simplicial category called the category of derived manifolds. It contains the category of smooth manifolds as a full discrete subcategory, and it is closed under taking arbitrary intersections in a manifold. A derived manifold is a space together with a sheaf of local C∞-rings that is obtained by patching together homotopy zero sets of smooth functions on Euclidean spaces. We show that derived manifolds come equipped with a stable normal bundle and can be imbedded into Euclidean space. We define a cohomology theory called derived cobordism, and use a Pontrjagin-Thom argument to show that the derived cobordism theory is isomorphic to the classical cobordism theory. This allows us to define fundamental classes in cobordism for all derived manifolds. In particular, the intersection A∩B of submanifolds A,B⊂X exists on the categorical level in our theory, and a cup product formula [A]⌣[B]=[A∩B] holds, even if the submanifolds are not transverse. One can thus consider the theory of derived manifolds as a categorification of intersection theory.

In \cite{Spi}, we developed a category of databases in which the schema of a database is represented as a simplicial set. Each simplex corresponds to a table in the database. There, our main concern was to find a categorical formulation of databases; the simplicial nature of the schemas was to some degree unexpected and unexploited. In the present note, we show how to use this geometric formulation effectively on a computer. If we think of each simplex as a polygonal tile, we can imagine assembling custom databases by mixing and matching tiles. Queries on this database can be performed by drawing paths through the resulting tile formations, selecting records at the start-point of this path and retrieving corresponding records at its end-point.

In this paper we present a simple database definition language: that of categories and functors. A database schema is a small category and an instance is a set-valued functor on it. We show that morphisms of schemas induce three "data migration functors", which translate instances from one schema to the other in canonical ways. These functors parameterize projections, unions, and joins over all tables simultaneously and can be used in place of conjunctive and disjunctive queries. We also show how to connect a database and a functional programming language by introducing a functorial connection between the schema and the category of types for that language. We begin the paper with a multitude of examples to motivate the definitions, and near the end we provide a dictionary whereby one can translate database concepts into category-theoretic concepts and vice-versa.

In this paper, we define a category DB, called the category of simplicial databases, whose objects are databases and whose morphisms are data-preserving maps. Along the way we give a precise formulation of the category of relational databases, and prove that it is a full subcategory of DB. We also prove that limits and colimits always exist in DB and that they correspond to queries such as select, join, union, etc. One feature of our construction is that the schema of a simplicial database has a natural geometric structure: an underlying simplicial set. The geometry of a schema is a way of keeping track of relationships between distinct tables, and can be thought of as a system of foreign keys. The shape of a schema is generally intuitive (e.g. the schema for round-trip flights is a circle consisting of an edge from $A$ to $B$ and an edge from $B$ to $A$), and as such, may be useful for analyzing data. We give several applications of our approach, as well as possible advantages it has over the relational model. We also indicate some directions for further research.

Networks are often studied as graphs, where the vertices stand for entities in the world and the edges stand for connections between them. While relatively easy to study, graphs are often inadequate for modeling real-world situations, especially those that include contexts of more than two entities. For these situations, one typically uses hypergraphs or simplicial complexes. In this paper, we provide a precise framework in which graphs, hypergraphs, simplicial complexes, and many other categories, all of which model higher graphs, can be studied side-by-side. We show how to transform a hypergraph into its nearest simplicial analogue, for example. Our framework includes many new categories as well, such as one that models broadcasting networks. We give several examples and applications of these ideas.

We define a simplicial category called the category of derived manifolds. It contains the category of smooth manifolds as a full discrete subcategory, and it is closed under taking arbitrary intersections in a manifold. A derived manifold is a space together with a sheaf of local $C^\infty$-rings that is obtained by patching together homotopy zero-sets of smooth functions on Euclidean spaces. We show that derived manifolds come equipped with a stable normal bundle and can be imbedded into Euclidean space. We define a cohomology theory called derived cobordism, and use a Pontrjagin-Thom argument to show that the derived cobordism theory is isomorphic to the classical cobordism theory. This allows us to define fundamental classes in cobordism for all derived manifolds. In particular, the intersection $A\cap B$ of submanifolds $A,B\subset X$ exists on the categorical level in our theory, and a cup product formula $$[A]\smile[B]=[A\cap B]$$ holds, even if the submanifolds are not transverse. One can thus consider the theory of derived manifolds as a {\em categorification} of intersection theory.

products; for example the zeroset of a smooth function on a manifold is not necessarily a manifold, and the non-transverse intersection of submanifolds is

We present new techniques for finding anomaly-free sets of fermions. Although the anomaly cancellation conditions typically include cubic equations with integer variables that cannot be solved in general, we prove by construction that any chiral set of fermions can be embedded in a larger set of fermions which is chiral and anomaly-free. Applying these techniques to extensions of the standard model, we find anomaly-free models that have arbitrary quark and lepton charges under an additional U(1) gauge group.

We present new techniques for finding anomaly-free sets of fermions. Although the anomaly cancellation conditions typically include cubic equations with integer variables that cannot be solved in general, we prove by construction that any chiral set of fermions can be embedded in a larger set of fermions which is chiral and anomaly-free. Applying these techniques to extensions of the Standard Model, we find anomaly-free models that have arbitrary quark and lepton charges under an additional U(1) gauge group.

Summary The transient behaviour of production from a well with a slotted liner has been solved analytically by the source function method. The unsteady-state pressure response was examined as a function of slot frequency and slot pressure response was examined as a function of slot frequency and slot length, with a penetration ratio of 1:2. The results indicate that limited entry into the well causes skin effects. However, the effects become negligible when three or more slots are distributed around the circumference of the liner. For more than three slots, the well effectively behaves like a continuous-surface cylindrical source (or a line source well, depending on time and location). We conclude that there is likely to be little reduction in flow efficiency in an ideal slotted liner completion, unless some slots are clogged. Introduction A well is completed with a slotted liner when sand problems occur, mainly in unconsolidated formations. The slotted liner is a preperforated tubing. Usually, the slots are milled and machined in vertical rows, parallel to the axis of the pipe. The most common patterns of slot arrangement are staggered vertical, multiple staggered vertical, and horizontal (Fig. 1). Standard spacing of slots is 6 in. between the slots in each vertical row, while their length is usually 1 1/2 to 2 in., depending on their width. The common practice is to specify two rows for each inch of nominal pipe diameter. An analytical solution to the problem of transient pressure response due to production through a liner with staggered vertical rows of slots was found. The technique used was the source function method suggested by Gringarten and Ramey. It applies the use of a line source of finite length that in turn represents one of the systems of slots. The solution technique was verified by comparison with the continuous-surface cylinder solution in the case of a large number of vertical rows of slots. No storage or damaged zone effects were considered. Problem Description Problem Description Consider an infinite, homogeneous, and isotropic porous medium. The transient (unsteady-state) flow of a slightly compressible fluid is governed by the diffusivity equation ............................(1) where = is the diffusivity term. The solution to a particular problem is determined by the initial and boundary conditions. One of the problem is determined by the initial and boundary conditions. One of the most well-known solutions is Kelvin's instantaneous point source function, ............................(2) Eq. 2 represents the pressure drop created at Point M in a reservoir of infinite extent by an instantaneous point source of strength q at Point P, distance d from Point M (Fig. 2). JPT p. 1366

The problem which I essayed to solve can be better understood if I recite the course of reasoning I followed: A man weighing 150 pounds is placed on a certain diet and he gains 10 pounds. The question arises, How can we locate the gain? In other words: How have the 10 pounds distributed themselves over the body? Have they spread themselves uniformly through the body or not? If the additional mass has not been distributed uniformly, is there a definite relative increase in the various sections of the body? Have 3 pounds been added to the upper extremity and 7 pounds to the lower extremity or vice versa? The same question is, of course, applicable to a man who has lost 10 pounds. As far as I could trace in the available literature, not only has there never been made an attempt to solve this problem, but it has