Related papers: Modules over relative monads for syntax and semant…
The goal of this lecture is to show how modern theorem provers---in this case, the Coq proof assistant---can be used to mechanize the specification of programming languages and their semantics, and to reason over individual programs and…
The book is devoted to two research areas: (1) Designing programming languages along with their denotational models. A denotational model of a language consists of two many-sorted algebras - an algebra of syntax and an algebra of…
We introduce dicodensity monads: a generalisation of pointwise codensity monads generated by functors to monads generated by mixed-variant bifunctors. Our construction is based on the notion of strong dinaturality (also known as Barr…
We consider the 3-category $2\mathfrak{C}at$ whose objects are 2-categories, 1-morphisms are lax functors, 2-morphisms are lax transformations and 3-morphisms are modifications. The aim is to show that it carries interesting…
Mathematical induction is a fundamental tool in computer science and mathematics. Henkin initiated the study of formalization of mathematical induction restricted to the setting when the base case B is set to singleton set containing 0 and…
Many formal languages include binders as well as operators that satisfy equational axioms, such as commutativity. Here we consider the nominal language, a general formal framework which provides support for the representation of binders,…
Our goal is to define an algebraic language for reasoning about non-deterministic computations. Towards this goal, we introduce an algebra of string-to-string transductions. Specifically, it is an algebra of partial functions on words over…
We study lax functors between bicategories as a generalized concept of monads and describe generalized notions and theorems of formal monad theory for lax functors. Our first approach is to use the 2-monad whose lax algebras are lax…
For a monadic sentence psi in the finite vocabulary we show that the spectra, the set of cardinalities of models of psi is almost periodic under reasonable conditions. The first is that every model is so called ``weakly k-decomposable''.…
In this paper we redevelop the foundations of the category theory of quasi-categories (also called infinity-categories) using 2-category theory. We show that Joyal's strict 2-category of quasi-categories admits certain weak 2-limits, among…
Let $R$ be a commutative ring with identity. For a finitely generated $R$-module $M$, the notion of associated prime submodules of $M$ is defined. It is shown that this notion inherits most of essential properties of the usual notion of…
This thesis focuses on topics in 2-category theory: in particular on double categories, pseudomonads and codescent objects. In Chapter 2 we recall all the necessary notions. In Chapter 3 we show that factorization systems can be…
This paper is the first in a series whose goal is to develop a fundamentally new way of constructing theories of physics. The motivation comes from a desire to address certain deep issues that arise when contemplating quantum theories of…
A systematic way of defining variants of a modeling language is useful for adopting the language to domain or project specific needs. Variants can be obtained by adopting the syntax or semantics of the language. In this paper, we take a…
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…
Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various monoids generated by regular operations in language theory…
Fuhrmann introduced Abstract Kleisli structures to model call-by-value programming languages with side effects, and showed that they correspond to monads satisfying a certain equalising condition on the unit. We first extend this theory to…
In recent years, G\"odel's ontological proof and variations of it were formalized and analyzed with automated tools in various ways. We supplement these analyses with a modeling in an automated environment based on first-order logic…
Large pre-trained language models have recently been expanded and applied to programming language tasks with great success, often through further pre-training of a strictly-natural language model--where training sequences typically contain…
We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…