English
Related papers

Related papers: Enriched Lawvere Theories for Operational Semantic…

200 papers

This article tackles categorical coherence within a two-dimensional generalization of Lawvere's functorial semantics. 2-theories, a syntactical way of describing categories with structure, are presented. From the perspective here afforded,…

Category Theory · Mathematics 2007-05-23 Noson S. Yanofsky

We set up a general theory of weak or homotopy-coherent enrichment in an arbitrary monoidal $\infty$-category $\mathcal{V}$. Our theory of enriched $\infty$-categories has many desirable properties; for instance, if the enriching…

Algebraic Topology · Mathematics 2019-11-15 David Gepner , Rune Haugseng

The linguistic applications of the Lambek calculus suggest its semantics over algebras of formal languages. A straightforward approach to construct such semantics indeed yields a brilliant completeness theorem (Pentus 1995). However,…

Logic in Computer Science · Computer Science 2025-10-30 Stepan L. Kuznetsov

We report on work in progress on 'nested term graphs' for formalizing higher-order terms (e.g. finite or infinite lambda-terms), including those expressing recursion (e.g. terms in the lambda-calculus with letrec). The idea is to represent…

Logic in Computer Science · Computer Science 2015-05-28 Clemens Grabmayer , Vincent van Oostrom

In a previous paper, we showed that profinite $L$-algebras (where $L$ is a variety of modal algebras generated by its finite members) are monadic over $\mathbf{Set}$. This monadicity result suggests that profinite $L$-algebras could be…

Logic · Mathematics 2025-11-21 Matteo De Berardinis , Silvio Ghilardi

A foundation is investigated for the application of loosely structured data on the Web. This area is often referred to as Linked Data, due to the use of URIs in data to establish links. This work focuses on emerging W3C standards which…

Logic in Computer Science · Computer Science 2011-08-02 Ross Horne , Vladimiro Sassone

We provide graded extensions of algebraic theories and Lawvere theories that correspond to graded monads. We prove that graded algebraic theories, graded Lawvere theories, and finitary graded monads are equivalent via equivalence of…

Logic in Computer Science · Computer Science 2020-03-05 Satoshi Kura

We develop layered monoidal theories -- a generalisation of monoidal theories combining formal descriptions of a system at different levels of abstraction. Via their representation as string diagrams, monoidal theories provide a graphical…

Logic in Computer Science · Computer Science 2026-02-24 Leo Lobski , Fabio Zanasi

It is known since 1973 that Lawvere's notion of (Cauchy-)complete enriched category is meaningful for metric spaces: it captures exactly Cauchy-complete metric spaces. In this paper we introduce the corresponding notion of Lawvere…

Category Theory · Mathematics 2007-05-23 Maria Manuel Clementino , Dirk Hofmann

Using the description of enriched $\infty$-operads as associative algebras in symmetric sequences, we define algebras for enriched $\infty$-operads as certain modules in symmetric sequences. For $\mathbf{V}$ a symmetric monoidal model…

Algebraic Topology · Mathematics 2025-11-05 Rune Haugseng

This article presents a general description of dynamical systems using the language of enriched functors and enriched natural transformations. This framework is essential to establish the equivalence of three descriptions of dynamics -- a…

Category Theory · Mathematics 2025-09-09 Suddhasattwa Das , Tomoharu Suda

We introduce a general notion of enrichment for homotopy-coherent algebraic structures described by Segal conditions, using the framework of "algebraic patterns" developed in our previous work. This recovers several known examples of…

Category Theory · Mathematics 2023-11-22 Hongyi Chu , Rune Haugseng

Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in…

Logic in Computer Science · Computer Science 2019-08-15 Jiri Adamek , Stefan Milius , Jiri Velebil

The well-known Lawvere category R of extended real positive numbers comes with a monoidal closed structure where the tensor product is the sum. But R has another such structure, given by multiplication, which is *-autonomous. Normed sets,…

Category Theory · Mathematics 2007-05-23 Marco Grandis

We introduce enriched notions of purity depending on the left class $\mathcal E$ of a factorization system on the base $\mathcal V$ of enrichment. Ordinary purity is given by the class of surjective mappings in the category of sets. Under…

Category Theory · Mathematics 2024-12-24 Jiří Rosický , Giacomo Tendas

This paper investigates modal type theories by using a new categorical semantics called change-of-base semantics. Change-of-base semantics is novel in that it is based on (possibly infinitely) iterated enrichment and interpretation of…

Logic in Computer Science · Computer Science 2018-10-26 Yuichi Nishiwaki , Yoshihiko Kakutani , Yuito Murase

We introduce operational semantics into games. And based on the operational semantics, we establish a full algebra of games, including basic algebra of games, algebra of concurrent games, recursion and abstraction. The algebra can be used…

Logic in Computer Science · Computer Science 2019-09-04 Yong Wang

Extending the `metric spaces' of Lawvere, we study `real metrics', with values in the extended real line. Formally, this ordered set is a symmetric monoidal closed category, and our structures are enriched categories on the latter.…

Algebraic Topology · Mathematics 2026-05-14 Marco Grandis

Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes…

Quantum Physics · Physics 2019-05-28 Alessandro Bisio , Paolo Perinotti

This paper examines the characterization and learning of grammars defined with enriched representational models. Model-theoretic approaches to formal language theory traditionally assume that each position in a string belongs to exactly one…

Formal Languages and Automata Theory · Computer Science 2019-06-25 Jane Chandlee , Remi Eyraud , Jeffrey Heinz , Adam Jardine , Jonathan Rawski