English
Related papers

Related papers: Idempotents in intensional type theory

200 papers

We present a typing system with non-idempotent intersection types, typing a term syntax covering three different calculi: the pure {\lambda}-calculus, the calculus with explicit substitutions {\lambda}S, and the calculus with explicit…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bernadet , Stéphane Jean Lengrand

One may formulate the dependent product types of Martin-L\"of type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the…

Logic · Mathematics 2011-10-17 Richard Garner

Markov categories have recently turned out to be a powerful high-level framework for probability and statistics. They accommodate purely categorical definitions of notions like conditional probability and almost sure equality, as well as…

Probability · Mathematics 2026-02-12 Tobias Fritz , Tomáš Gonda , Antonio Lorenzin , Paolo Perrone , Dario Stein

We show that an idempotent lies in the center if it commutes with the other idempotents in the ring. Next, we introduce a partition of the set of idempotents and show that the automorphisms of the ring act transitively on each equivalence…

Rings and Algebras · Mathematics 2023-11-16 Vineeth Chintala

Indexed Linear Logic has been introduced by Ehrhard and Bucciarelli, it can be seen as a logical presentation of non-idempotent intersection types extended through the relational semantics to the full linear logic. We introduce an…

Logic in Computer Science · Computer Science 2024-02-16 Flavien Breuvart , Federico Olimpieri

We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…

Logic in Computer Science · Computer Science 2020-10-28 Rafaël Bocquet

Idempotent elements play a fundamental role in ring theory, as they encode significant information about the underlying algebraic structure. In this paper, we study idempotent matrices from two perspectives. First, we analyze the partially…

Rings and Algebras · Mathematics 2025-10-13 Sen-Peng Eu , Yong-Siang Lin , Wei-Liang Sun

Suppose that G is a locally compact abelian group, and write M(G) for the algebra of bounded, regular, complex-valued measures under convolution. A measure \mu in M(G) is said to be idempotent if \mu * \mu = \mu, or alternatively if the…

Classical Analysis and ODEs · Mathematics 2010-04-02 Ben Green , Tom Sanders

This paper provides answers to several open problems about equational theories of idempotent semifields. In particular, it is proved that (i) no equational theory of a non-trivial class of idempotent semifields has a finite basis; (ii)…

Logic · Mathematics 2024-12-09 George Metcalfe , Simon Santschi

It is a well-known theorem of homotopy type theory, originally due to Voevodsky, that function extensionality holds inside any univalent universe. We consider a weaker variant of the univalence axiom, asserting that the wild category formed…

Logic in Computer Science · Computer Science 2026-05-04 Evan Cavallo , Jonas Höfer

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

We study the concept of idempotence for relative monads, which exhibits several subtleties not present for non-relative monads. In particular, there is a bifurcation of notions of idempotence in the relative setting, which are…

Category Theory · Mathematics 2025-09-10 Nathanael Arkor , Andrew Slattery

In this paper, we extend the study of graded equivalences to the case of general idempotent graded rings. We prove that the existence of a graded equivalence between two categories of graded torsion-free unital modules may be characterized…

Rings and Algebras · Mathematics 2026-04-15 Mikhailo Dokuchaev , Juan Jacobo Simón

Revisiting a classic result from M. Hofmann's dissertation, we give a direct proof of Morita equivalence, in the sense of V. Isaev, between extensional type theory and intensional type theory extended by the principles of functional…

Logic · Mathematics 2025-12-23 Chris Kapulkin , Yufeng Li

In this note we present examples of localization functors (in the category of spaces) whose composition with certain cellularization functors is not idempotent, and vice versa.

Algebraic Topology · Mathematics 2009-12-23 Ramon Flores

It is known that any finite idempotent algebra that satisfies a nontrivial Maltsev condition must satisfy the linear one-equality Maltsev condition (a variant of the term discovered by M. Siggers and refined by K. Kearnes, P. Markovi\'c,…

Rings and Algebras · Mathematics 2018-07-25 Alexandr Kazda

We contribute XTT, a cubical reconstruction of Observational Type Theory which extends Martin-L\"of's intensional type theory with a dependent equality type that enjoys function extensionality and a judgmental version of the unicity of…

Logic in Computer Science · Computer Science 2021-04-20 Jonathan Sterling , Carlo Angiuli , Daniel Gratzer

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

Logic in Computer Science · Computer Science 2023-06-22 Daniel Gratzer , G. A. Kavvos , Andreas Nuyts , Lars Birkedal

Evidential reasoning is cast as the problem of simplifying the evidence-hypothesis relation and constructing combination formulas that possess certain testable properties. Important classes of evidence as identifiers, annihilators, and…

Artificial Intelligence · Computer Science 2013-04-11 Yizong Cheng , Rangasami L. Kashyap

Metric Temporal Logic $\mathsf{MTL}[\until_I,\since_I]$ is one of the most studied real time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of…

Logic in Computer Science · Computer Science 2014-04-29 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh Pandya