Domain Theory in Constructive and Predicative Univalent Foundations
Tom de Jong, Mart\'in H\"otzel Escard\'o

TL;DR
This paper develops domain theory within constructive univalent foundations, constructing models of PCF and the untyped lambda calculus without resizing axioms, and addresses size issues using universes and accessible categories.
Contribution
It extends domain theory in univalent foundations by constructing Scott models without resizing axioms, handling size issues via universes and accessible categories.
Findings
Constructed Scott models of PCF and lambda calculus in univalent foundations.
Addressed size issues by working with type universes and accessible categories.
Demonstrated that large dcpos can be handled within a predicative framework.
Abstract
We develop domain theory in constructive univalent foundations without Voevodsky's resizing axioms. In previous work in this direction, we constructed the Scott model of PCF and proved its computational adequacy, based on directed complete posets (dcpos). Here we further consider algebraic and continuous dcpos, and construct Scott's model of the untyped -calculus. A common approach to deal with size issues in a predicative foundation is to work with information systems or abstract bases or formal topologies rather than dcpos, and approximable relations rather than Scott continuous functions. Here we instead accept that dcpos may be large and work with type universes to account for this. For instance, in the Scott model of PCF, the dcpos have carriers in the second universe and suprema of directed families with indexing type in the first universe…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
