Powerdomains and nondeterminism in synthetic domain theory
This paper constructs and proves the adequacy of powerdomains in synthetic domain theory for nondeterministic denotational models.
This paper introduces a novel approach to constructing powerdomains in synthetic domain theory, which is different from previous work on powerdomains in other settings.
Before reading this…
Applications
- →Reasoning about operational behaviors of programs
- →Developing a nondeterministic metalanguage
To understand this paper, make sure you know these concepts first:
- Domain theoryfind papers →
- Dependent type theoryfind papers →
Abstract
More Like ThisSynthetic domain theory is an axiomatization of domain theory within a constructive universe of sets such that all definable maps between domains are continuous. In this paper we construct the counterparts to the well-known lower, upper, and convex powerdomains in the setting of synthetic domain theory and prove that they produce computationally adequate denotational models of nondeterminism. By developing the theory of powerdomains in synthetic domain theory, we obtain a nondeterministic metalanguage that directly embeds into dependent type theory, where the latter serves as an expressive logic for reasoning about the metalanguage. Moreover, the computational adequacy results imply that denotational reasoning through the metalanguage may be used to study operational behaviors of actual programs.