English
Related papers

Related papers: Typability and Type Inference in Atomic Polymorphi…

200 papers

We prove several theorems relating amenability of groups in various categories (discrete, definable, topological, automorphism group) to model-theoretic invariants (quotients by connected components, Lascar Galois group, G-compactness,…

Logic · Mathematics 2019-01-11 Krzysztof Krupinski , Anand Pillay

Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical…

Programming Languages · Computer Science 2015-07-01 William Lovas , Frank Pfenning

We provide sufficient conditions for a mapping $f:R^{n}\rightarrow R^{n}$ to be a global diffeomorphism in case it is strictly (Hadamard) differentiable. We use classical local invertibility conditions together with the non-smooth critical…

Classical Analysis and ODEs · Mathematics 2015-03-09 Marek Galewski

We give a new proof of the decidability of reachability in alternating pushdown systems, showing that it is a simple consequence of a cut-elimination theorem for some natural-deduction style inference systems. Then, we show how this result…

Logic in Computer Science · Computer Science 2014-10-31 Gilles Dowek , Ying Jiang

All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…

Logic · Mathematics 2023-10-04 Nikolaos Galatos , Gavin St. John

We study the interaction of structural subtyping with parametric polymorphism and recursively defined type constructors. Although structural subtyping is undecidable in this setting, we describe a notion of parametricity for type…

Programming Languages · Computer Science 2023-10-30 Henry DeYoung , Andreia Mordido , Frank Pfenning , Ankush Das

We explore the relationship between subgroups and the possible shifts of finite type (SFTs) that can be defined on the group. In particular, we investigate two group invariants, weak periodicity and strong periodicity, defined via symbolic…

Group Theory · Mathematics 2015-09-15 David Carroll , Andrew Penland

Gapped phases of noninteracting fermions, with and without charge conservation and time-reversal symmetry, are classified using Bott periodicity. The symmetry and spatial dimension determines a general universality class, which corresponds…

Mesoscale and Nanoscale Physics · Physics 2015-05-13 Alexei Kitaev

We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a…

Logic in Computer Science · Computer Science 2019-03-14 Simon Castellan , Pierre Clairambault , Peter Dybjer

The two main theorems proved here are as follows: If $A$ is a finite dimensional algebra over an algebraically closed field, the identity component of the algebraic group of outer automorphisms of $A$ is invariant under derived equivalence.…

Representation Theory · Mathematics 2007-05-23 Birge Huisgen-Zimmermann , Manuel Saorin

We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…

Logic · Mathematics 2026-05-06 Samuel Braunfeld , Michael C. Laskowski

This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…

Category Theory · Mathematics 2014-10-16 Michal R. Przybylek

We present $\lambda_B$, a quantum-control $\lambda$-calculus that refines previous basis-sensitive systems by allowing abstractions to be expressed with respect to arbitrary -- possibly entangled -- bases. Each abstraction and let construct…

Logic in Computer Science · Computer Science 2025-10-24 Alejandro Díaz-Caro , Octavio Malherbe , Rafael Romero

As the groupoid model of Hofmann and Streicher proves, identity proofs in intensional Martin-L\"of type theory cannot generally be shown to be unique. Inspired by a theorem by Hedberg, we give some simple characterizations of types that do…

Logic in Computer Science · Computer Science 2019-03-14 Nicolai Kraus , Martín Escardó , Thierry Coquand , Thorsten Altenkirch

We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type for programs whose execution may raise an exception at top level, and a corruption type for programs…

Programming Languages · Computer Science 2015-07-01 Sylvain Lebresne

We prove for residually finite groups the following long standing conjecture: the number of twisted conjugacy classes of an automorphism of a finitely generated group is equal (if it is finite) to the number of finite dimensional…

Group Theory · Mathematics 2012-05-01 Alexander Fel'shtyn , Evgenij Troitsky

Our goal is to show that the standard model-theoretic concept of types can be applied in the study of order-invariant properties, i.e., properties definable in a logic in the presence of an auxiliary order relation, but not actually…

Logic in Computer Science · Computer Science 2017-01-11 Pablo Barcelo , Leonid Libkin

Reynolds' parametricity originally equips types with proof-irrelevant binary propositional relations over the types. But such relations can also be taken proof-relevant or unary, and described either in an indexed or fibred way.…

Logic in Computer Science · Computer Science 2026-02-16 Hugo Herbelin , Ramkumar Ramachandra

Profinite algebras are exactly those that are isomorphic to inverse limits of finite algebras. Such algebras are naturally equipped with Boolean topologies. A variety $\mathcal V$ is standard if every Boolean topological algebra with the…

Logic · Mathematics 2019-02-20 Anvar M. Nurakunov , Michał M. Stronkowski

If $X$ is a quasi-projective variety over a field $k$ and $\phi$ a birational endomorphism of $X$ that is injective outside a closed subset of codimension $\geq 2$, we prove that $\phi$ is an automorphism. This generalizes an old theorem of…

Algebraic Geometry · Mathematics 2026-02-19 Supravat Sarkar