English
Related papers

Related papers: Cubical Syntax for Reflection-Free Extensional Equ…

200 papers

We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform, coinductive way. The setup captures rewrite sequences of arbitrary ordinal length, but it has…

Logic in Computer Science · Computer Science 2019-03-14 Jörg Endrullis , Helle Hvid Hansen , Dimitri Hendriks , Andrew Polonsky , Alexandra Silva

We claim that the cube category whose morphisms are the interval-preserving monotone functions between finite Boolean lattices is a convenient general-purpose site for cubical sets. This category is the largest possible concrete…

Category Theory · Mathematics 2025-03-19 Sanjeevi Krishnan , Emily Rudman

The role of types in categorical models of meaning is investigated. A general scheme for how typed models of meaning may be used to compare sentences, regardless of their grammatical structure is described, and a toy example is used as an…

Computation and Language · Computer Science 2013-03-14 Peter Hines

We describe a Martin-L\"of-style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that…

Logic in Computer Science · Computer Science 2019-05-13 Brigitte Pientka , David Thibodeau , Andreas Abel , Francisco Ferreira , Rebecca Zucchini

We prove a refinement of Quillen's Theorem A, providing necessary and sufficient conditions for a functor to be cofinal with respect to diagrams valued in a fixed $\infty$-category. We deduce this from a general duality phenomenon for…

Category Theory · Mathematics 2025-12-17 Shai Keidar , Lior Yanovski

We construct a rational extension of a recently studied nonlinear quantum oscillator model. Our extended model is shown to retain exact solvability, admitting a discrete spectrum and corresponding closed-form solutions that are expressed…

Mathematical Physics · Physics 2015-06-18 Axel Schulze-Halberg , Barnana Roy

We prove the algorithmic canonicity of two classes of $\mu$-inequalities in a constructive meta-theory of normal lattice expansions. This result simultaneously generalizes Conradie and Craig's canonicity for $\mu$-inequalities based on a…

Logic · Mathematics 2016-03-22 Willem Conradie , Andrew Craig , Alessandra Palmigiano , Zhiguang Zhao

We provide a formulation of the univalence axiom in a universe category model of dependent type theory that is convenient to verify in homotopy-theoretic settings. We further develop a strengthening of the univalence axiom, called pointed…

Logic in Computer Science · Computer Science 2025-12-19 Chris Kapulkin , Yufeng Li

We introduce the notion of pre-weight structure on a triangulated category and study the corresponding pseudo-identities. We propose the notion of canonical derived equivalence between algebras that are not necessarily flat, which is…

Representation Theory · Mathematics 2025-11-20 Xiao-Wu Chen

For the lambda-calculus with surjective pairing and terminal type, Curien and Di Cosmo were inspired by Knuth-Bendix completion, and introduced a confluent rewriting system that (1) extends the naive rewriting system, and (2) is stable…

Logic in Computer Science · Computer Science 2018-05-08 Yohji Akama

In their usual form, representation independence metatheorems provide an external guarantee that two implementations of an abstract interface are interchangeable when they are related by an operation-preserving correspondence. If our…

Programming Languages · Computer Science 2025-06-11 Carlo Angiuli , Evan Cavallo , Anders Mörtberg , Max Zeuner

In this work we introduce the notion of higher $\mathbb{E}$-extension groups for an extriangulated category $\mathcal{C}$ and study the quotients $\mathcal{X}_{n+1}^{\vee}/[\mathcal{X}]$ and $\mathcal{X}_{n+1}^{\wedge}/[\mathcal{X}]$ when…

Representation Theory · Mathematics 2023-09-27 Mindy Y. Huerta , Octavio Mendoza , Corina Sáenz , Valente Santiago

It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…

Logic in Computer Science · Computer Science 2023-09-28 Jonathan Sterling

In the Boehm theorem workshop on Crete island, Zoran Petric called Statman's ``Typical Ambiguity theorem'' typed Boehm theorem. Moreover, he gave a new proof of the theorem based on set-theoretical models of the simply typed lambda…

Logic in Computer Science · Computer Science 2009-09-29 Satoshi Matsuoka

We develop category theory within Univalent Foundations, which is a foundational system for mathematics based on a homotopical interpretation of dependent type theory. In this system, we propose a definition of "category" for which equality…

Category Theory · Mathematics 2019-02-20 Benedikt Ahrens , Chris Kapulkin , Michael Shulman

We introduce a single-set axiomatisation of cubical $\omega$-categories, including connections and inverses. We justify these axioms by establishing a series of equivalences between the category of single-set cubical $\omega$-categories,…

Logic in Computer Science · Computer Science 2024-07-08 Philippe Malbos , Tanguy Massacrier , Georg Struth

In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…

We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…

Logic · Mathematics 2021-02-23 Laurent De Rudder , Alessandra Palmigiano

We review the close relationship between abstract machines for (call-by-name or call-by-value) lambda-calculi (extended with Felleisen's C) and sequent calculus, reintroducing on the way Curien-Herbelin's syntactic kit expressing the…

Logic in Computer Science · Computer Science 2010-07-28 Pierre-Louis Curien , Guillaume Munch-Maccagnoni

We consider Abelian extensions of global symmetries of the form $A \to G \to K$, with $A$ finite (and similar higher-group structures). For a quantum field theory $\mathcal{T}$ with symmetry $G$, we compare gauging $G$ directly with gauging…

High Energy Physics - Theory · Physics 2026-03-24 Riccardo Villa