Partial Elements and Recursion via Dominances in Univalent Type Theory

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Annual Conference for Computer Science Logic

• Publication date

  2017-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.4230/LIPIcs.CSL.2017.21
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Stack semantics of type theory

  2017cited by this paper
• Notions of Anonymous Existence in Martin-Löf Type Theory

  2016influential reference
• Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive Type

  2016cited by this paper
• LONDON MATHEMATICAL SOCIETY LECTURE NOTE SERIES

  2015cited by this paper
• Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom

  2015cited by this paper
• Quotienting the delay monad by weak bisimilarity

  2015cited by this paper
• Homotopy Type Theory

  2015cited by this paper
• Cubical Type Theory

  2014cited by this paper
• Metric spaces in synthetic topology

  2012cited by this paper
• A Type of Partial Recursive Functions

  2008cited by this paper
• First Steps in Synthetic Computability Theory

  2006cited by this paper
• General recursion via coinductive types

  2005cited by this paper
• Joins in the Frame of Nuclei

  2003cited by this paper
• General Recursion in Type Theory

  2002cited by this paper
• Nested General Recursion and Partiality in Type Theory

  2001cited by this paper
• Axioms and (counter) examples in synthetic domain theory

  2000cited by this paper
• General Synthetic Domain Theory { a Logical Approach (extended Abstract)

  1997cited by this paper
• General synthetic domain theory – a logical approach

  1997cited by this paper
• First steps in synthetic domain theory

  1991cited by this paper
• Classical recursion theory

  1989cited by this paper
• The Effective Topos

  1982cited by this paper
• A note on non-extensional operations in connection with continuity and recursiveness

  1977cited by this paper
• Theory of Recursive Functions and Effective Computability.

  1969cited by this paper
• Introduction to Metamathematics

  1952cited by this paper

• Generalized Decidability via Brouwer Trees

  2026cites this paper
• Incremental Certified Programming

  2025cites this paper
• Initial Algebras of Domains via Quotient Inductive-Inductive Types

  2025cites this paper
• Representing Guardedness in Call-By-Value

  2024cites this paper
• Oracle modalities

  2024cites this paper
• Predicative Aspects of Order Theory in Univalent Foundations

  2021cites this paper
• Uniform Elgot Iteration in Foundations

  2021cites this paper
• Apartness, sharp elements, and the Scott topology of domains

  2021cites this paper
• Size Matters in Univalent Foundations

  2021cites this paper
• On Small Types in Univalent Foundations

  2021cites this paper
• Domain theory in predicative Univalent Foundations

  2020cites this paper
• University of Birmingham Domain theory in constructive and predicative univalent foundations

  2020cites this paper
• Domain Theory in Constructive and Predicative Univalent Foundations

  2020cites this paper
• Church's thesis and related axioms in Coq's type theory

  2020cites this paper
• On Church's Thesis in Cubical Assemblies

  2019influential citation
• Synthetic topology in Homotopy Type Theory for probabilistic programming

  2019influential citation
• The Scott model of PCF in univalent type theory

  2019influential citation
• En Garde! Unguarded Iteration for Reversible Computation in the Delay Monad

  2019cites this paper
• Injective types in univalent mathematics

  2019cites this paper
• Partial functions and recursion in univalent type theory

  2018influential citation
• Partiality and Container Monads

  2017influential citation
• Modalities in homotopy type theory

  2017cites this paper
• University of Birmingham On small types in univalent foundations

  year unknowncites this paper