Related papers: Algebraic Presentations of Type Dependency
It is a well-known fact that endomorphisms of $B(H)$ are intimately connected with families of mutually orthogonal isometries, i.e. with representations of the so-called Toeplitz $C^*$-algebras. In this paper we consider a natural…
The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework…
We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
Cubical type theory is an extension of Martin-L\"of type theory recently proposed by Cohen, Coquand, M\"ortberg and the author which allows for direct manipulation of $n$-dimensional cubes and where Voevodsky's Univalence Axiom is provable.…
An algebraic theory, sometimes called an equational theory, is a theory defined by finitary operations and equations, such as the theories of groups and of rings. It is well known that algebraic theories are equivalent to finitary monads on…
A equivalence relation, preserving the Chern-Weil form, is defined between connections on a complex vector bundle. Bundles equipped with such an equivalence class are called Structured Bundles, and their isomorphism classes form an abelian…
We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The…
Cyclic systems of dichotomous random variables have played a prominent role in contextuality research, describing such experimental paradigms as the Klyachko-Can-Binicoglu-Shumovky, Einstein-Podolsky-Rosen-Bell, and Leggett-Garg ones in…
In this paper we introduce a new kind of topological space, called 'structured space', which locally resembles various kinds of algebraic structures. This can be useful, for instance, to locally study a space that cannot be globally endowed…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
The aim of this paper is two-fold: (1) introduce four systems of equations called M-systems and dual M-systems of types $A_{n}$ and $B_{n}$ respectively; (2) make a connection between M-systems (dual M-systems) and cluster algebras and…
Typed operational semantics is a method developed by H. Goguen to prove meta-theoretic properties of type systems. This paper studies the metatheory of a type system with dependent record types, using the approach of typed operational…
We construct a C-space associated with every closed 3-form on a spacetime $M$ and show that it depends on the class of the form in $H^3(M, Z)$. We also demonstrate that C-spaces have a relation to generalized geometry and to gerbes.…
Cartan-Eilenberg systems play an prominent role in the homological algebra of filtered and graded differential groups and (co)chain complexes in particular. We define the concept of Cartan-Eilenberg systems of abelian groups over a poset.…
Following Eilenberg-Steenrod axiomatic approach we construct the universal ordinary homology theory for any homological structure on a given category by representing ordinary theories with values in abelian categories. For a convenient…
Recent works have shown that defining a behavioural equivalence that matches the observational properties of a quantum-capable, concurrent, non-deterministic system is a surprisingly difficult task. We explore coalgebras over distributions…
We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of all dependent sequent calculi, and exhibiting it as the category of algebras for a monad on a presheaf…
Originally inspired by categorical quantum mechanics (Abramsky and Coecke, LiCS'04), the categorical compositional distributional model of natural language meaning of Coecke, Sadrzadeh and Clark provides a conceptually motivated procedure…
We introduce "synchronous algebras", an algebraic structure tailored to recognize automatic relations (aka. synchronous relations, or regular relations). They are the equivalent of monoids for regular languages, however they conceptually…