Order, lattices, ordered algebraic structures Domain theory Concept
Scott domain
Summary
A Scott domain is a directed-complete partial order that is algebraic and bounded complete. Algebraic means that every element is the directed supremum of the compact elements below it. Bounded complete means that every subset with an upper bound has a supremum. They come from the work of Dana Scott on the semantics of programming languages and of the lambda calculus. They form a cartesian closed category with Scott-continuous maps.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 1SAAZG46DG |
|---|---|
| URI | m2://1SAAZG46DG |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06B35, 68Q55 |
| Specializes | Directed-complete partial order |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.