English
Related papers

Related papers: Normalization for Cubical Type Theory

200 papers

According to recent results, the Gell-Mann - Low function \beta(g) of four-dimensional \phi^4 theory is non-alternating and has a linear asymptotics at infinity. According to the Bogoliubov and Shirkov classification, it means possibility…

Mathematical Physics · Physics 2013-09-30 I. M. Suslov

Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

We generalize the Generic Model Theorem for equivariant presheaves of structures; extending the results of Macintyre and Caicedo. We also introduce a new class of generic cohomologies and show how, for some examples, they simplify to non…

Logic · Mathematics 2016-04-28 Gabriel Padilla , Andres Villaveces

Cubical type theories are designed around an abstract unit interval from which types of paths, used to represent equalities, are defined. Varying the operations available on this interval yields different type theories. A reversal is an…

Logic in Computer Science · Computer Science 2026-05-15 Evan Cavallo , Christian Sattler

We show that the endomorphism ring of each cluster tilting object in a tubular cluster category is a finite dimensional Jacobian algebra which is tame of polynomial growth. Moreover, these Jacobian algebras are given by a quiver with a…

Rings and Algebras · Mathematics 2016-01-07 Christof Geiss , Raúl González-Silva

We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and…

Logic in Computer Science · Computer Science 2016-03-27 Stefan Hetzl , Lutz Straßburger

This paper contains a complete proof of a fundamental theorem on the normalizers of unipotent subgroups in semisimple algebraic groups.

Algebraic Geometry · Mathematics 2007-05-23 B. Weisfeiler

In the category of monoids we characterize monomorphisms that are normal, in an appropriate sense, to internal reflexive relations, preorders or equivalence relations. The zero-classes of such internal relations are first described in terms…

Category Theory · Mathematics 2022-10-10 Nelson Martins-Ferreira , Manuela Sobral

In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof…

Logic in Computer Science · Computer Science 2019-07-23 Pablo Barenbaum , Gonzalo Ciruelos

A new approach is demonstrated that QFTs can be UV finite if they are viewed as the low energy effective theories of a fundamental underlying theory (that is complete and well-defined in all respects) according to the nowaday's standard…

High Energy Physics - Theory · Physics 2008-02-03 Jifeng Yang

The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…

Logic in Computer Science · Computer Science 2012-03-06 Barbara Petit

A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…

Logic in Computer Science · Computer Science 2024-02-09 Vincent Moreau , Lê Thành Dũng Nguyên

The lambda-calculus with de Bruijn indices assembles each alpha-class of lambda-terms in a unique term, using indices instead of variable names. Intersection types provide finitary type polymorphism and can characterise normalisable…

Logic in Computer Science · Computer Science 2010-01-26 Daniel Ventura , Mauricio Ayala-Rincón , Fairouz Kamareddine

In previous work ("From signatures to monads in UniMath"), we described a category-theoretic construction of abstract syntax from a signature, mechanized in the UniMath library based on the Coq proof assistant. In the present work, we…

Programming Languages · Computer Science 2021-12-15 Benedikt Ahrens , Ralph Matthes , Anders Mörtberg

By using the decomposition of the decoherence-free subalgebra N(T) in direct integrals of factors, we obtain a structure theorem for every uniformly continuous QMSs. Moreover we prove that, when there exists a faithful normal invariant…

Quantum Physics · Physics 2021-01-14 Emanuela Sasso , Veronica Umanità

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

We generalize cubic norm structures to cubic norm pairs and extend hermitian cubic norm structures to arbitrary commutative unital rings. For the associated ``skew dimension one structurable algebra" of these pairs, we construct a…

Rings and Algebras · Mathematics 2025-09-05 Michiel Smet

We give a new criterion for solvability of group equations, providing proofs of various generalizations of the Kervaire-Laudenbach conjecture for Connes-embeddable groups.

Group Theory · Mathematics 2021-09-27 Martin Nitsche , Andreas Thom

Our main result establishes functorial desingularization of noetherian quasi-excellent schemes over $\bfQ$ with ordered boundaries. A functorial embedded desingularization of quasi-excellent schemes of characteristic zero is deduced.…

Algebraic Geometry · Mathematics 2017-02-22 Michael Temkin

We show that bounded type implies finite type for a constructible subcategory of the module category of a finitely generated algebra over a field, which is a variant of the first Brauer-Thrall conjecture. A full subcategory is constructible…

Representation Theory · Mathematics 2025-07-31 Kevin Schlegel , Andres Fernandez Herrero
‹ Prev 1 8 9 10 Next ›