English
Related papers

Related papers: Algebraic Presentations of Type Dependency

200 papers

In order to study the axiomatization of the if-then-else construct over possibly non-halting programs and tests, the notion of $C$-sets was introduced in the literature by considering the tests from an abstract $C$-algebra. This paper…

Logic in Computer Science · Computer Science 2017-02-21 Gayatri Panicker , K. V. Krishna , Purandar Bhaduri

This is the first of a pair of papers where we construct and investigate a closed monoidal structure on the category of generalized algebraic theories (in the sense of Cartmell). In the present text, as a starting point, we define the…

Category Theory · Mathematics 2025-11-18 Daniel Almeida

The T-systems and Y-systems are classes of algebraic relations originally associated with quantum affine algebras and Yangians. Recently the T-systems were generalized to quantum affinizations of a wide class of quantum Kac-Moody algebras…

Quantum Algebra · Mathematics 2010-01-15 Atsuo Kuniba , Tomoki Nakanishi , Junji Suzuki

We give a new syntax independent definition of the notion of a generalized algebraic theory as an initial object in a category of categories with families (cwfs) with extra structure. To this end we define inductively how to build a valid…

Category Theory · Mathematics 2021-03-17 Marc Bezem , Thierry Coquand , Peter Dybjer , Martín Escardó

We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…

Logic in Computer Science · Computer Science 2020-07-01 Nathanael Arkor , Marcelo Fiore

We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…

Logic · Mathematics 2017-05-26 Luca Mauri

It is possible to translate a modified version of K. Worytkiewicz's combinatorial semantics of CCS (Milner's Calculus of Communicating Systems) in terms of labelled precubical sets into a categorical semantics of CCS in terms of labelled…

Algebraic Topology · Mathematics 2010-07-01 Philippe Gaucher

We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…

K-Theory and Homology · Mathematics 2015-10-23 Marius Dadarlat , Ralf Meyer

Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…

Category Theory · Mathematics 2019-11-28 Soichiro Fujii

Cluster algebras were introduced by S. Fomin and A. Zelevinsky in connection with dual canonical bases. Let U be a cluster algebra of type A_n. We associate to each cluster C of U an abelian category Cat_C such that the indecomposable…

Representation Theory · Mathematics 2014-04-09 Philippe Caldero , Frederic Chapoton , Ralf Schiffler

We present a new method, involving monads and comonads from category theory, to help establish a certain type of equivalence of subcategories. As a case study we consider the category of topological gradings of $C^*$-algebras over a fixed…

Operator Algebras · Mathematics 2025-12-09 Erik Bédos , S. Kaliszewski , John Quigg

This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the…

Logic in Computer Science · Computer Science 2023-06-22 Filippo Bonchi , Ana Sokolova , Valeria Vignudelli

In this paper we consider the class of l-bijective C-systems, i.e., C-systems for which the length function is a bijection. The main result of the paper is a construction of an isomorphism between two categories - the category of…

Logic · Mathematics 2015-12-29 Vladimir Voevodsky

Recent discoveries have been made connecting abstract homotopy theory and the field of type theory from logic and theoretical computer science. This has given rise to a new field, which has been christened "homotopy type theory". In this…

Logic · Mathematics 2012-10-23 Álvaro Pelayo , Michael A. Warren

While behavioural equivalences among systems of the same type, such as Park/Milner bisimilarity of labelled transition systems, are an established notion, a systematic treatment of relationships between systems of different type is…

Logic in Computer Science · Computer Science 2025-02-07 Pedro Nora , Jurriaan Rot , Lutz Schröder , Paul Wild

For a root system of type $B$ we study an algebra similar to a graded Hecke algebra, isomorphic to a subalgebra of the rational Cherednik algebra. We introduce principal series modules over it and prove an irreducibility criterion for these…

Representation Theory · Mathematics 2007-05-23 C. Dezelee

For separable $C^*$-algebras $A$ and $B$, we define a topology on the set $[[A, B]]$ consisting of homotopy classes of asymptotic morphisms from $A$ to $B$. This gives an enrichment of the Connes--Higson asymptotic category over topological…

Operator Algebras · Mathematics 2024-10-21 José R. Carrión , Christopher Schafhauser

We study the logic of comparative concept similarity $\CSL$ introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative similarity comparison. In this logic we can formulate assertions of the form " objects…

Artificial Intelligence · Computer Science 2009-02-06 Régis Alenda , Nicola Olivetti , Camilla Schwind

The Sheaf-Theoretic Contextuality (STC) theory developed by Abramsky and colleagues is a very general account of whether multiply overlapping subsets of a set, each of which is endowed with certain "local'" structure, can be viewed as…

Quantum Physics · Physics 2023-04-11 Ehtibar N. Dzhafarov

We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape "Gamma |- A : B", our systems just have judgments of shape "A : B". A key feature is that we distinguish free…

Logic in Computer Science · Computer Science 2010-09-16 Herman Geuvers , Robbert Krebbers , James McKinna , Freek Wiedijk