English
Related papers

Related papers: Non-wellfounded trees in Homotopy Type Theory

200 papers

We establish proof-theoretic, constructive and coalgebraic foundations for proof search in coinductive Horn clause theories. Operational semantics of coinductive Horn clause resolution is cast in terms of coinductive uniform proofs; its…

Logic in Computer Science · Computer Science 2022-03-16 Henning Basold , Ekaterina Komendantskaya , Yue Li

Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…

Logic in Computer Science · Computer Science 2026-03-16 Yunsong Yang , Simon Guilloud , Viktor Kunčak

For closed oriented manifolds, we establish oriented homotopy invariance of higher signatures that come from the fundamental group of a large class of orientable 3-manifolds, including the ``piecewise geometric'' ones in the sense of…

Algebraic Topology · Mathematics 2007-05-23 Michel Matthey , Hervé Oyono-Oyono , Wolfgang Pitsch

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

These notes, written version of a Bourbaki talk, survey Morel-Voevodsky's motivic homotopy theory over a field, with a focus on computations of motivic homotopy sheaves, both stable and unstable. We also describe Isaksen-Wang-Xu's…

Algebraic Geometry · Mathematics 2025-10-21 Frédéric Déglise

This article presents a bidirectional type system for the Calculus of Inductive Constructions (CIC). It introduces a new judgement intermediate between the usual inference and checking, dubbed constrained inference, to handle the presence…

Programming Languages · Computer Science 2021-04-20 Meven Lennon-Bertrand

In this note we consider different versions of coinduction functors between categories of comodules for corings induced by a morphism of corings. In particular we introduce a new version of the coinduction functor in the case of locally…

Rings and Algebras · Mathematics 2007-05-23 Jawad Abuhlail

We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…

Logic · Mathematics 2013-09-27 Benno van den Berg , Ieke Moerdijk

This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of…

Logic in Computer Science · Computer Science 2017-10-09 Lars Birkedal , Aleš Bizjak , Ranald Clouston , Hans Bugge Grathwohl , Bas Spitters , Andrea Vezzosi

A foundational question in the theory of linear compartmental models is how to assess whether a model is structurally identifiable -- that is, whether parameter values can be inferred from noiseless data -- directly from the combinatorics…

Dynamical Systems · Mathematics 2024-02-19 Cashous Bortner , Elizabeth Gross , Nicolette Meshkat , Anne Shiu , Seth Sullivant

The first part of this work constructs positive-genus real Gromov-Witten invariants of real-orientable symplectic manifolds of odd "complex" dimensions; the present part focuses on their properties that are essential for actually working…

Symplectic Geometry · Mathematics 2018-02-27 Penka Georgieva , Aleksey Zinger

After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…

Logic in Computer Science · Computer Science 2018-04-23 Francesco Dagnino

Let K be a comonad on a model category M. We provide conditions under which the associated category of K-coalgebras admits a model category structure such that the forgetful functor to M creates both cofibrations and weak equivalences. We…

Algebraic Topology · Mathematics 2014-02-26 Kathryn Hess , Brooke Shipley

We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground lambda-term corresponds to some property of…

Logic in Computer Science · Computer Science 2017-03-31 Paweł Parys

We give a new formulation of Turing reducibility in terms of higher modalities, inspired by an embedding of the Turing degrees in the lattice of subtoposes of the effective topos discovered by Hyland. In this definition, higher modalities…

Logic · Mathematics 2024-06-11 Andrew W Swan

Brouwer's constructivist foundations of mathematics is based on an intuitively meaningful notion of computation shared by all mathematicians. Martin-L\"of's meaning explanations for constructive type theory define the concept of a type in…

Logic in Computer Science · Computer Science 2016-06-15 Carlo Angiuli , Robert Harper , Todd Wilson

We build free, bigraded bidifferential algebra models for the forms on a complex manifold, with respect to a strong notion of quasi-isomorphism and compatible with the conjugation symmetry. This answers a question of Sullivan. The resulting…

Algebraic Topology · Mathematics 2024-11-27 Jonas Stelzig

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

Non-wellfounded material sets have been modelled in Martin-L\"of type theory by Lindstr\"om using setoids. In this paper we construct models of non-wellfounded material sets in Homotopy Type Theory (HoTT) where equality is interpreted as…

Logic · Mathematics 2025-09-03 Håkon Robbestad Gylterud , Elisabeth Stenholm , Niccolò Veltri

Homotopy Type Theory may be seen as an internal language for the $\infty$-category of weak $\infty$-groupoids which in particular models the univalence axiom. Voevodsky proposes this language for weak $\infty$-groupoids as a new foundation…

Category Theory · Mathematics 2019-02-20 Egbert Rijke , Bas Spitters