English
Related papers

Related papers: From type theory to setoids and back

200 papers

The Seiberg-Witten map links noncommutative gauge theories to ordinary gauge theories, and allows to express the noncommutative variables in terms of the commutative ones. Its explicit form can be found order by order in the noncommutative…

High Energy Physics - Theory · Physics 2009-11-07 Stephane Fidanza

All formalizations of session types rely on linear types for soundness as session-typed communication channels must change their type at every operation. Embedded language implementations of session types follow suit. They either rely on…

Programming Languages · Computer Science 2023-03-03 Peter Thiemann

System I is a recently introduced simply-typed lambda calculus with pairs where isomorphic types are considered equal. In this work we propose a variant of System I with the type Top, and present a complete formalization of this calculus in…

Logic in Computer Science · Computer Science 2026-03-26 Agustín Séttimo , Cristian Sottile , Cecilia Manzino

Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of 'models', yielding induction and recursion principles for abstract syntax. Zsid\'o proves an initiality result for…

Logic in Computer Science · Computer Science 2015-07-01 Benedikt Ahrens

In this paper we define Martin-L\"{o}f complexes to be algebras for monads on the category of (reflexive) globular sets which freely add cells in accordance with the rules of intensional Martin-L\"{o}f type theory. We then study the…

Logic · Mathematics 2012-05-25 Steve Awodey , Pieter Hofstra , Michael A. Warren

In this note we describe a seemingly new approach to the complex representation theory of the wreath product $G\wr S_d$ where $G$ is a finite abelian group. The approach is motivated by an appropriate version of Schur-Weyl duality. We…

Representation Theory · Mathematics 2017-05-10 Volodymyr Mazorchuk , Catharina Stroppel

We construct two infinite-dimensional irreducible representations for $D(2,1;\alpha)$: a Schr\"odinger model and a Fock model. Further, we also introduce an intertwining isomorphism. These representations are similar to the minimal…

Representation Theory · Mathematics 2021-04-02 Sigiswald Barbier , Sam Claerebout

Matthew Ando produced power operations in the Lubin-Tate cohomology theories and was able to classify which complex orientations were compatible with these operations. The methods used by Ando, Hopkins and Rezk to classify orientations of…

Algebraic Topology · Mathematics 2009-05-04 Barry John Walker

We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…

Logic in Computer Science · Computer Science 2012-08-01 Pablo Arrighi , Alejandro Díaz-Caro , Benoît Valiron

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

Mathematical Physics · Physics 2007-05-23 A. N. Leznov

We present new game semantics of Martin-L\"of type theory (MLTT) equipped with One-, Zero-, N-, Pi-, Sigma- and Id-types. Our game semantics interprets MLTT more accurately than existing ones. Another advantage of our game semantics over…

Logic · Mathematics 2021-06-08 Norihiro Yamada

Intensional computation derives concrete outputs from abstract function definitions; extensional computation defines functions through explicit input-output pairs. In formal semantics: intensional computation interprets expressions as…

Category Theory · Mathematics 2024-09-05 Daniel Quigley

We propose an intersection type system for an imperative lambda-calculus based on a state monad and equipped with algebraic operations to read and write to the store. The system is derived by solving a suitable domain equation in the…

Programming Languages · Computer Science 2022-02-25 Ugo de'Liguoro , Riccardo Treglia

In this paper we present our current development on a new formalization of nominal sets in Agda. Our first motivation in having another formalization was to understand better nominal sets and to have a playground for testing type systems…

Logic in Computer Science · Computer Science 2023-03-24 Miguel Pagano , José E. Solsona

We introduce Displayed Type Theory (dTT), a multi-modal homotopy type theory with discrete and simplicial modes. In the intended semantics, the discrete mode is interpreted by a model for an arbitrary $\infty$-topos, while the simplicial…

Category Theory · Mathematics 2026-01-14 Astra Kolomatskaia , Michael Shulman

We define and develop two-level type theory (2LTT), a version of Martin-L\"of type theory which combines two different type theories. We refer to them as the inner and the outer type theory. In our case of interest, the inner theory is…

Logic in Computer Science · Computer Science 2026-05-27 Danil Annenkov , Paolo Capriotti , Nicolai Kraus , Christian Sattler

We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various properties of the code. The theory has $\Pi$-types, weak and strong $\Sigma$-types, natural numbers, an empty type, and a…

Logic in Computer Science · Computer Science 2026-05-01 Andreas Abel , Nils Anders Danielsson , Oskar Eriksson

We construct motivic cohomology classes attached to Rankin--Selberg convolutions of modular forms of weights $\ge 2$, show that these vary analytically in p-adic families, and relate their image under the p-adic regulator map to values of…

Number Theory · Mathematics 2015-04-10 Guido Kings , David Loeffler , Sarah Livia Zerbes

We introduce an intersection type system for the lambda-mu calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of…

Logic in Computer Science · Computer Science 2019-03-14 Steffen van Bakel , Franco Barbanera , Ugo de'Liguoro

We record a particularly simple construction on top of Lumsdaine's local universes that allows for a Coquand-style universe of propositions with propositional extensionality to be interpreted in a category with subobject classifiers.

Logic in Computer Science · Computer Science 2024-05-24 Xu Huang
‹ Prev 1 8 9 10 Next ›