Theoretical Computer Science
Totally bounded spaces and compact ordered spaces as domains of computation
Topology and category theory in computer science
Handbook of logic in computer science (vol. 3)
Elements of generalized ultrametric domain theory
Theoretical Computer Science
Continuity spaces: reconciling domains and metric spaces
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
Generalized metric spaces: completion, topology, and power domains via the Yoneda embedding
Theoretical Computer Science
The essence of ideal completion in quantitative form
Theoretical Computer Science
Quasi Uniformities: Reconciling Domains with Metric Spaces
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
Towards "dynamic domains": Totally continuous cocomplete Q-categories
Theoretical Computer Science
Fundamental study: Complete and directed complete Ω-categories
Theoretical Computer Science
Continuity in quantitative domains
Fuzzy Sets and Systems
Quantitative domains via fuzzy sets: Part I: Continuity of fuzzy directed complete posets
Fuzzy Sets and Systems
The limit–colimit coincidence theorem for -categories
Mathematical Structures in Computer Science
The formal ball model for -categories
Mathematical Structures in Computer Science
Two cartesian closed subcategories of fuzzy domains
Fuzzy Sets and Systems
A Duality Between Ω-categories and Algebraic Ω-categories
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
This paper is about a generalization of Scott's domain theory in such a way that its definitions and theorems become meaningful in quasimetric spaces. The generalization is achieved by a change of logic: the fundamental concepts of original domain theory (order, way-below relation, Scott-open sets, continuous maps, etc.) are interpreted as predicates that are valued in an arbitrary completely distributive Girard quantale (a CDG quantale). Girard quantales are known to provide a sound and complete semantics for commutative linear logic, and complete distributivity adds a notion of approximation to our setup. Consequently, in this paper we speak about domain theory based on commutative linear logic with some additional reasoning principles following from approximation between truth values. Concretely, we: (1) show how to define continuous Q-domains, i.e. continuous domains over a CDG quantale Q; (2) study their way-below relation, and (3) study the rounded ideal completion of Q-abstract bases. As a case study, we (4) demonstrate that the domain-theoretic construction of the Hoare, Smyth and Plotkin powerdomains of a continuous dcpo can be straightforwardly adapted to yield corresponding constructions for continuous Q-domains.