Domain theory in univalent foundations I: Directed complete posets and Scott's $D_\infty$
Tom de Jong

TL;DR
This paper develops domain theory within univalent foundations, demonstrating that constructions of dcpos and Scott's $D_$ model are predicatively feasible and formalized in Agda without assuming classical axioms.
Contribution
It provides a predicative, constructive approach to domain theory in univalent foundations, including a formalization of Scott's $D_$ model in Agda.
Findings
Predicative constructions of dcpos are possible with universe tracking.
Scott's $D_$ model can be reconstructed predicatively.
Formalization in Agda confirms the feasibility of the approach.
Abstract
We develop domain theory in constructive and predicative univalent foundations (also known as homotopy type theory). That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive in the sense that we do not rely on excluded middle or the axiom of (countable) choice. Domain theory studies so-called directed complete posets (dcpos) and Scott continuous maps between them and has applications in a variety of fields, such as programming language semantics, higher-type computability and topology. A common approach to deal with size issues in a predicative foundation is to work with information systems, abstract bases or formal topologies rather than dcpos, and approximable relations rather than Scott continuous functions. In our type-theoretic approach, we instead accept that dcpos may be large and work with type universes to…
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.
Taxonomy
TopicsRings, Modules, and Algebras · Algebraic structures and combinatorial models · Polynomial and algebraic computation
