ComK may be defined as the (cartesian closed) category of comonoids in chuK , or equivalently as dictionaries D for which any crossword over D has its main diagonal in D. Com2 resembles Top, ordinary topological spaces. Common to both are the Alexandroff posets and the Scott DCPOs, while the topological space R and the dual DCPO {−∞ < . . . < −2 < −1 < 0} jointly witness the incomparability of ...

In domain theory, by a poset model of T1 topological space X we usually mean P such that the subspace Max(P) Scott consisting all maximal points is homeomorphic to X. The models spaces have been extensively studied many authors. this paper investigate another type models: lower topology models. ?(P) on one fundamental intrinsic topologies poset, which generated sets form P\?x, x ? P. A (poset L...

Abstract Working constructively, we study continuous directed complete posets (dcpos) and the Scott topology. Our two primary novelties are a notion of intrinsic apartness sharp elements. Being apart is positive formulation being unequal, similar to how inhabitedness nonemptiness. To exemplify sharpness, note that lower real if only it located. first main result for large class dcpos, Bridges–V...

This is a version from 29 Sept 2003 of the paper published under the same name in Theoretical Computer Science 316 (2004) 297–321. The double powerlocale P(X) (found by composing, in either order, the upper and lower powerlocale constructions PU and PL) is shown to be isomorphic in [Loc,Set] to the double exponential SS X where S is the Sierpiński locale. Further PU (X) and PL(X) are shown to b...

If a locale is presented by a “flat site”, it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is derived for compactness of the locale (and also for its openness). Although its derivation uses impredicative constructions, it is also shown predicatively using the inductive generation of formal topologies. A predicative proof of ...

Abstract We consider the binary supremum function $$\sup :Z\times Z\rightarrow Z$$ sup : Z × → on a sup semilattice Z and its topological properties with respect to Scott topology product topology. It is well known that...

We consider a programming language that can manipulate both classical and quantum information. Our is type-safe designed for variational programming, which hybrid classical-quantum computational paradigm. The subsystem of the Probabilistic FixPoint Calculus (PFPC), lambda calculus with mixed-variance recursive types, term recursion probabilistic choice. first-order linear type system two subsys...

Normann proved that the domains of the game model of PCF (the domains of sequential functionals) need not be dcpos. Sazonov has defined natural domains for a theory of such incomplete domains. This paper further develops that theory. It defines lub-rules that infer natural lubs from existing natural lubs, and lub-rule classes that describe axiom systems like that of natural domains. There is a ...

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 d...

Continuous valuations have been proposed by several authors as a way of modeling probabilistic non-determinism in programming language semantics. Let (X;O) be a topological space. A quasi-simple valuation on X is the sup of a directed family of simple valuations. We show that quasisimple valuations are exactly those valuations that extend to continuous valuations to the Alexandroff topology on ...