scientific article; zbMATH DE number 3982494

From MaRDI portal
Publication:3746867





[For the entire collection see Zbl 0595.00023.] The Scott topology is useful in analyzing traditional semantic domains, i.e., consistently complete algebraic cpos with bottom elements. However, if the definition of a semantic domain is weakened to include cpos without bottom elements, then there is a family of topologies which are potentially useful in studying programming language semantics. These topologies are the order consistent topologies. We investigate these topologies in terms of their subbasic open sets, and we define a calculus for building cpos with accompanying topologies.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3746867)