English
Related papers

Related papers: Oracle modalities

200 papers

We develop synthetic notions of oracle computability and Turing reducibility in the Calculus of Inductive Constructions (CIC), the constructive type theory underlying the Coq proof assistant. As usual in synthetic approaches, we employ a…

Logic in Computer Science · Computer Science 2023-07-31 Yannick Forster , Dominik Kirst , Niklas Mück

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…

Logic in Computer Science · Computer Science 2018-05-02 Thierry Coquand , Simon Huber , Anders Mörtberg

This is the fourth in a series of papers extending Martin-L\"of's meaning explanation of dependent type theory to higher-dimensional types. In this installment, we show how to define cubical type systems supporting a general schema of…

Logic in Computer Science · Computer Science 2018-07-20 Evan Cavallo , Robert Harper

In this paper we combine the principled approach to modalities from multimodal type theory (MTT) with the computationally well-behaved realization of identity types from cubical type theory (CTT). The result -- cubical modal type theory…

Logic in Computer Science · Computer Science 2024-12-18 Frederik Lerbjerg Aagaard , Magnus Baunsgaard Kristensen , Daniel Gratzer , Lars Birkedal

Techniques from higher categories and higher-dimensional rewriting are becoming increasingly important for understanding the finer, computational properties of higher algebraic theories that arise, among other fields, in quantum…

Category Theory · Mathematics 2017-01-04 Amar Hadzihasanovic

Homotopy Type Theory is a new field of mathematics based on the surprising and elegant correspondence between Martin-Lofs constructive type theory and abstract homotopy theory. We have a powerful interplay between these disciplines - we can…

Logic in Computer Science · Computer Science 2014-02-10 Kristina Sojakova

We describe a Martin-L\"of-style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that…

Logic in Computer Science · Computer Science 2019-05-13 Brigitte Pientka , David Thibodeau , Andreas Abel , Francisco Ferreira , Rebecca Zucchini

Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy…

Logic · Mathematics 2020-07-08 Peter LeFanu Lumsdaine , Mike Shulman

Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for…

Logic · Mathematics 2023-03-31 Steve Awodey , Nicola Gambino , Kristina Sojakova

Modalities in homotopy type theory are used to create and access subuniverses of a given type universe. These have significant applications throughout mathematics and computer science, and in particular can be used to create universes in…

Logic in Computer Science · Computer Science 2025-02-03 Mark Damuni Williams

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos $\mathcal{E}$. In contrast to the well-known interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the…

Logic · Mathematics 2017-03-07 Steve Awodey , Kohei Kishida , Hans-Christoph Kotzsch

Coquand's cubical set model for homotopy type theory provides the basis for a computational interpretation of the univalence axiom and some higher inductive types, as implemented in the cubical proof assistant. This paper contributes to the…

Logic in Computer Science · Computer Science 2016-10-19 Bas Spitters

We describe a Martin-L\"of style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that…

Programming Languages · Computer Science 2019-01-14 Brigitte Pientka , Andreas Abel , Francisco Ferreira , David Thibodeau , Rebecca Zucchini

This paper aims to use topological methods to compute $\mathrm{Ext}$ between an irreducible representation of a finite monoid inflated from its group completion and one inflated from its group of units, or more generally coinduced from a…

Representation Theory · Mathematics 2024-04-03 Benjamin Steinberg

Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying…

Logic · Mathematics 2014-01-07 Tarek Sayed Ahmed

We introduce the abstract notions of "monadic operational semantics", a small-step semantics where computational effects are modularly modeled by a monad, and "type-and-effect system", including "effect types" whose interpretation lifts…

Programming Languages · Computer Science 2025-04-15 Francesco Dagnino , Paola Giannini , Elena Zucca

By results of Rognerud, a source algebra equivalence between two $p$-blocks of finite groups induces an equivalence between the categories of cohomological Mackey functors associated with these blocks, and a splendid derived equivalence…

Group Theory · Mathematics 2015-10-07 Markus Linckelmann

In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…

Logic · Mathematics 2024-11-22 Takayuki Kihara , Keng Meng Ng

Following a project of developing conventions and notations for informal type theory carried out in the homotopy type theory book for a framework built out of an augmentation of constructive type theory with axioms governing…

Logic in Computer Science · Computer Science 2018-06-25 Bruno Bentzen

The cohomology theory known as Tmf, for "topological modular forms," is a universal object mapping out to elliptic cohomology theories, and its coefficient ring is closely connected to the classical ring of modular forms. We extend this to…

Algebraic Topology · Mathematics 2015-02-05 Michael Hill , Tyler Lawson
‹ Prev 1 2 3 10 Next ›