Related papers: Modular specification of monads through higher-ord…
Type checking algorithms and theorem provers rely on unification algorithms. In presence of type families or higher-order logic, higher-order (pre)unification (HOU) is required. Many HOU algorithms are expressed in terms of…
This paper introduces an inherently strict presentation of categories with products, coproducts, or symmetric monoidal products that is inspired by file systems and directories. Rather than using nested binary tuples to combine objects or…
Initial Semantics aims at characterizing the syntax associated to a signature as the initial object of some category. We present an initial semantics result for typed higher-order syntax together with its formalization in the Coq proof…
Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…
Formalising the pi-calculus is an illuminating test of the expressiveness of logical frameworks and mechanised metatheory systems, because of the presence of name binding, labelled transitions with name extrusion, bisimulation, and…
The paper introduces the notion of a weak bisimulation for coalgebras whose type is a monad satisfying some extra properties. In the first part of the paper we argue that systems with silent moves should be modelled coalgebraically as…
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…
We consider representations of quivers taking values in monads or comonads over a Grothendieck category $\mathcal C$. We treat these as scheme like objects whose ``structure sheaf'' consists of monads or comonads. By using systems of…
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
The category $_{A}\mathbb{S}_{A}$ of bisemimodules over a semialgebra $A,$ with the so called Takahashi's tensor product $-\boxtimes_{A}-,$ is semimonoidal but not monoidal. Although not a unit in $_{A}\mathbb{S}%_{A},$ the base semialgebra…
The simplices and the complexes arsing form the grading of the fundamental (desymmetrized) domain of arithmetical groups and non-arithmetical groups, as well as their extended (symmetrized) ones are described also for oriented manifolds in…
We provide a complete generators and relations presentation of the 2-dimensional extended unoriented and oriented bordism bicategories as symmetric monoidal bicategories. Thereby we classify these types of 2-dimensional extended topological…
Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…
Let $E(z,s)$ be the non-holomorphic Eisenstein series for the modular group $SL(2,{\mathbb Z})$. The classical Kronecker limit formula shows that the second term in the Laurent expansion at $s=1$ of $E(z,s)$ is essentially the logarithm of…
We give a leisurely introduction to our abstract framework for operational semantics based on cellular monads on transition categories. Furthermore, we relate it for the first time to an existing format, by showing that all Positive GSOS…
One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…
Despite extensive research both on the theoretical and practical fronts, formalising, reasoning about, and implementing languages with variable binding is still a daunting endeavour - repetitive boilerplate and the overly complicated…
We develop the formal theory of monads, as established by Street, in univalent foundations. This allows us to formally reason about various kinds of monads on the right level of abstraction. In particular, we define the bicategory of monads…
Automata learning has been successfully applied in the verification of hardware and software. The size of the automaton model learned is a bottleneck for scalability, and hence optimizations that enable learning of compact representations…
We propose a hybrid-dynamic first-order logic as a formal foundation for specifying and reasoning about reconfigurable systems. As the name suggests, the formalism we develop extends (many-sorted) first-order logic with features that are…