Related papers: Modular specification of monads through higher-ord…
The goal of this paper is to prove coherence results with respect to relational graphs for monoidal monads and comonads, i.e. monads and comonads in a monoidal category such that the endofunctor of the monad or comonad is a monoidal functor…
Higher-order processes with parameterization are capable of abstraction and application (migrated from the lambda-calculus), and thus are computationally more expressive. For the minimal higher-order concurrency, it is well-known that the…
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…
Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…
Motivated by viewing categories as bimodule monoids over their isomorphism groupoids, we construct monoidal structures called plethysm products on three levels: that is for bimodules, relative bimodules and factorizable bimodules. For the…
We propose a general framework to allow: (a) specifying the operational semantics of a programming language; and (b) stating and proving properties about program correctness. Our framework is based on a many-sorted system of hybrid modal…
In previous work by the first two authors, Frobenius and commutative algebra objects in the category of spans of sets were characterized in terms of simplicial sets satisfying certain properties. In this paper, we find a similar…
This paper introduces the concept of distorted monoidal categories, a generalization of monoidal and braided monoidal categories that supports non-reversible and direction-sensitive tensor structures. Unlike the classical setting, where the…
Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…
Monads are a useful tool for structuring effectful features of computation such as state, non-determinism, and continuations. In the last decade, several generalisations of monads have been suggested which provide a more fine-grained model…
A monoid presentation is called special if the right-hand side of each defining relation is equal to 1. We prove results which relate the two-sided homological finiteness properties of a monoid defined by a special presentation with those…
Let $\Sigma $ be a compact connected and oriented surface with nonempty boundary and let $G$ be a Lie group equipped with a bi-invariant pseudo-Riemannian metric. The moduli space of flat principal $G$-bundles over $\Sigma$ which are…
Graded modal logics generalise standard modal logics via families of modalities indexed by an algebraic structure whose operations mediate between the different modalities. The graded "of-course" modality $!_r$ captures how many times a…
Relational descriptions have been used in formalizing diverse computational notions, including, for example, operational semantics, typing, and acceptance by non-deterministic machines. We therefore propose a (restricted) logical theory…
A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…
We introduce two monads on the category of graphs and prove that their Eilenberg-Moore categories are isomorphic to the category of perfect matchings and the category of partial Steiner triple systems, respectively. As a simple application…
Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…
When studying deformations of an $A$-module $M$, Laudal and Yau showed that one can consider 1-cocycles in the Hochschild cohomology of $A$ with coefficients in the bi-module $End_k(M).$ With this in mind, the use of higher order Hochschild…
In this survey paper we give account of several approaches to the strictification and non-strictification of monoidal categories, which are constructions that turn a monoidal category into a (non-)strict one monoidally equivalent to the…
Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made; in implementations, the choices can be realized…