Partial elements and recursion via dominances in univalent type theory

DOI10.4230/LIPICS.CSL.2017.21zbMATH Open1434.03037OpenAlexW2760547725MaRDI QIDQ5111189FDOQ5111189

Authors: Martín Escardo, Cory M. Knapp 

Publication date: 26 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.CSL.2017.21

Recommendations

• Recursion on the partial continuous functionals
• The Scott model of PCF in univalent type theory
• Partial univalence in \(n\)-truncated type theory
• Partial functions in type theory
• A Type of Partial Recursive Functions

zbMATH Keywords

dominancecomputability theoryrecursion theoryhomotopy type theorypartial functionunivalent type theory

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Constructive and recursive analysis (03F60) Type theory (03B38)

Cited In (10)

• Synthetic topology in Homotopy Type Theory for probabilistic programming
• Partiality and Container Monads
• On Small Types in Univalent Foundations
• Apartness, sharp elements, and the Scott topology of domains
• Partiality, Revisited
• On Church’s thesis in cubical assemblies
• Untyped Recursion Schemes and Infinite Intersection Types
• Injective types in univalent mathematics
• Title not available (Why is that?)
• The Scott model of PCF in univalent type theory

This page was built for publication: Partial elements and recursion via dominances in univalent type theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111189)