English
Related papers

Related papers: Higher category models of the pi-calculus

200 papers

Motivated by recent advances in the categorification of quantum groups at prime roots of unity, we develop a theory of 2-representations for 2-categories enriched with a p-differential which satisfy finiteness conditions analogous to those…

Representation Theory · Mathematics 2020-08-18 Robert Laugwitz , Vanessa Miemietz

We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing…

cmp-lg · Computer Science 2016-08-31 Glyn Morrill

We take a utility-based approach to categorization. We construct generalizations about events and actions by considering losses associated with failing to distinguish among detailed distinctions in a decision model. The utility-based…

Artificial Intelligence · Computer Science 2013-03-08 Eric J. Horvitz , Adrian Klein

One of the major advantages of $\infty$-category theory over classical $1$-category theory is its robust and homotopically meaningful framework for taking (co)limits of diagrams of $\infty$-categories. However, it is both subtle and crucial…

Category Theory · Mathematics 2026-01-15 David Barnes , Niall Taggart

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…

Category Theory · Mathematics 2025-06-03 Brandon Shapiro

This paper is a rather informal guide to some of the basic theory of 2-categories and bicategories, including notions of limit and colimit, 2-dimensional universal algebra, formal category theory, and nerves of bicategories. As is the way…

Category Theory · Mathematics 2010-09-10 Stephen Lack

It is well known that classical and quantum theories carry distinct types of representations, each type of representation corresponding to possible values of generalized charges in the classical or quantum context. This paper demonstrates a…

Mathematical Physics · Physics 2026-02-18 Benjamin H. Feintzeig

We present a generic framework that facilitates object level reasoning with logics that are encoded within the Higher Order Logic theorem proving environment of HOL Light. This involves proving statements in any logic using intuitive…

Logic in Computer Science · Computer Science 2021-01-12 Petros Papapanagiotou , Jacques Fleuriot

The modal logic S4 can be used via a Curry-Howard style correspondence to obtain a lambda-calculus. Modal (boxed) types are intuitively interpreted as `closed syntax of the calculus'. This lambda-calculus is called modal type theory ---…

Logic in Computer Science · Computer Science 2013-05-28 Murdoch Gabbay , Aleksandar Nanevski

This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics…

Formal Languages and Automata Theory · Computer Science 2010-11-02 Frédéric Peschanski , Hanna Klaudel , Raymond Devillers

Diagram chasing is not an easy task. The coherence holds in a generalized sense if we have a mechanical method to judge whether given two morphisms are equal to each other. A simple way to this end is to reform a concerned category into a…

Logic in Computer Science · Computer Science 2020-10-09 Ryu Hasegawa

Compact closed categories provide a foundational formalism for a variety of important domains, including quantum computation. These categories have a natural visualisation as a form of graphs. We present a formalism for equational reasoning…

Symbolic Computation · Computer Science 2009-02-04 Lucas Dixon , Ross Duncan

Tuple interpretations are a class of algebraic interpretation that subsumes both polynomial and matrix interpretations as it does not impose simple termination and allows non-linear interpretations. It was developed in the context of…

Logic in Computer Science · Computer Science 2022-07-01 Cynthia Kop , Deivid Vale

We develop representations for bicomplex-valued functions in Hardy classes that generalize the complex holomorphic Hardy spaces. Using these representations, we show these functions have boundary values in the sense of distributions that…

Complex Variables · Mathematics 2025-10-07 William L. Blair

A version of the situation calculus in which situations are represented as first-order terms is presented. Fluents can be computed from the term structure, and actions on the situations correspond to rewrite rules on the terms. Actions that…

Artificial Intelligence · Computer Science 2020-07-02 David A. Plaisted

We present a computer-supported approach for the logical analysis and conceptual explicitation of argumentative discourse. Computational hermeneutics harnesses recent progresses in automated reasoning for higher-order logics and aims at…

Artificial Intelligence · Computer Science 2022-12-12 David Fuenmayor , Christoph Benzmüller

We show that any Abelian module category over the (degenerate or quantum) Heisenberg category satisfying suitable finiteness conditions may be viewed as a 2-representation over a corresponding Kac-Moody 2-category (and vice versa). This…

Representation Theory · Mathematics 2020-11-03 Jonathan Brundan , Alistair Savage , Ben Webster

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…

Category Theory · Mathematics 2015-06-18 Emily Riehl , Dominic Verity

By considering a generalisation of the CPM construction, we develop an infinite hierarchy of probabilistic theories, exhibiting compositional decoherence structures which generalise the traditional quantum-to-classical transition.…

Quantum Physics · Physics 2021-09-14 James Hefford , Stefano Gogioso

This paper presents complexity analysis and variational methods for inference in probabilistic description logics featuring Boolean operators, quantification, qualified number restrictions, nominals, inverse roles and role hierarchies.…

Artificial Intelligence · Computer Science 2012-05-14 Fabio Gagliardi Cozman , Rodrigo Bellizia Polastro