| |
| | Topology in Computer Science |
 | | Complete lattices as fixed points of Scott continuous transformations of powersets. |
 | | A basis for the Scott topology on X is given by B = { A, B, C, D where A = { a,b,c,d }, B = { b,d }, C = { c,d }, and D = { d }. |
 | | Ever since domains were introduced by Dana Scott [Sco70] and Yuri Ershov [Ers75], a question in the centre of interest was to find suitable cartesian closed categories of domains and the quest for cartesian closed categories as large as possible, so to be closed under various domain-theoretic constructions. |
| www.informatik.uni-siegen.de /theo/TopCS.html (798 words) |
|