No label defined (Q3746867)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3982494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3982494 |
Statements
1986
0 references
complete partial order
0 references
order topology
0 references
Scott topology
0 references
semantic domains
0 references
complete algebraic cpos
0 references
programming language semantics
0 references
0.7588052749633789
0 references
0.7146976590156555
0 references
0.7130560874938965
0 references
[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.
0 references