English
Related papers

Related papers: W-Types with Reductions and the Small Object Argum…

200 papers

This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly…

Logic in Computer Science · Computer Science 2023-06-22 Marcelo P. Fiore , Andrew M. Pitts , S. C. Steenkamp

Within dependent type theory, we provide a topological counterpart of well-founded trees (for short, W-types) by using a proof-relevant version of the notion of inductively generated suplattices introduced in the context of formal topology…

Logic in Computer Science · Computer Science 2024-02-14 Maria Emilia Maietti , Pietro Sabelli

We present a construction of W-types in the setoid model of extensional Martin-L\"of type theory using dependent W-types in the underlying intensional theory. More precisely, we prove that the internal category of setoids has initial…

Logic · Mathematics 2023-06-22 Jacopo Emmenegger

There is an ``algebraisation'' of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of maps-with-structure, where the…

Category Theory · Mathematics 2007-05-23 Richard Garner

This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of…

Logic in Computer Science · Computer Science 2022-03-15 Marcelo Fiore , Andrew M. Pitts , S. C. Steenkamp

We formulate and prove examples of a conjecture which describes the W-algebras in type A as successive quantum Hamiltonian reductions of affine vertex algebras associated with several hook-type nilpotent orbits. This implies that the affine…

Representation Theory · Mathematics 2025-03-26 Thomas Creutzig , Justine Fasquel , Andrew R. Linshaw , Shigenori Nakatsuka

In this article, we combine Sweedler's classic theory of measuring coalgebras -- by which $k$-algebras are enriched in $k$-coalgebras for $k$ a field -- with the theory of W-types -- by which the categorical semantics of inductive data…

Category Theory · Mathematics 2024-05-24 Lukas Mulder , Paige Randall North , Maximilien Péroux

Most categorical models for dependent types have traditionally been heavily set based: contexts form a category, and for each we have a set of types in said context -- and for each type a set of terms of said type. This is the case for…

Logic in Computer Science · Computer Science 2023-12-25 Greta Coraglia , Jacopo Emmenegger

Algebraic weak factorisation systems (AWFS) refine weak factorisation systems by requiring that the assignations sending a map to its first and second factors should underlie an interacting comonad--monad pair on the arrow category. We…

Category Theory · Mathematics 2015-09-15 John Bourke , Richard Garner

An old theorem of Ad\'amek constructs initial algebras for sufficiently cocontinuous endofunctors via transfinite iteration over ordinals in classical set theory. We prove a new version that works in constructive logic, using "inflationary"…

Logic · Mathematics 2022-11-04 Andrew M. Pitts , S. C. Steenkamp

In this paper we consider the structure of general quantum W-algebras. We introduce the notions of deformability, positive-definiteness, and reductivity of a W-algebra. We show that one can associate a reductive finite Lie algebra to each…

High Energy Physics - Theory · Physics 2009-10-22 P. Bowcock , G Watts

In the present article, we describe constructions of model structures on general bicomplete categories. We are motivated by the following question: given a category $\mathcal{C}$ with a subcategory $w\mathcal{C}$ closed under retracts, when…

Algebraic Topology · Mathematics 2014-09-29 Jean-Marie Droz , Inna Zakharevich

The small object argument is a method for transfinitely constructing weak factorization systems originally motivated by homotopy theory. We establish a variant of the small object argument that is enriched over a cofibrantly generated weak…

Category Theory · Mathematics 2025-05-26 Jan Jurka

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

A basic problem in the study of algebraic morphisms is to determine which sets can be realised as the image of an endomorphism of affine space. This paper extends the results previously obtained by the first author on the question of…

Algebraic Geometry · Mathematics 2023-11-15 Viktor Balch Barth , Tuyen Trung Truong

We construct $W$-types in the category of coalgebras for a cartesian comonad. It generalizes the constructions of $W$-types in presheaf toposes and gluing toposes.

Category Theory · Mathematics 2019-01-23 Taichi Uemura

In this paper, I establish the categorical structure necessary to interpret dependent inductive and coinductive types. It is well-known that dependent type theories \`a la Martin-L\"of can be interpreted using fibrations. Modern theorem…

Logic in Computer Science · Computer Science 2016-02-22 Henning Basold

W-algebras are a class of non-commutative algebras related to the classical universal enveloping algebras. They can be defined as a subquotient of U(g) related to a choice of nilpotent element e and compatible nilpotent subalgebra m. The…

Representation Theory · Mathematics 2015-02-26 Stephen Morgan

Let $W$ be a finite dimensional algebraic structure (e.g. an algebra) over a field $K$ of characteristic zero. We study forms of $W$ by using Deligne's Theory of symmetric monoidal categories. We construct a category $\mathcal{C}_W$, which…

Category Theory · Mathematics 2015-10-16 Ehud Meir

In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is highly challenging to implement this technique in proof…

Logic in Computer Science · Computer Science 2015-09-11 Paolo Torrini , Tom Schrijvers
‹ Prev 1 2 3 10 Next ›