Talk:Scott domain

From Wikipedia, the free encyclopedia

You have new messages (last change).

The definition given in Chapter 12 of Winskel's "The Formal Semantics of Programming Languages" (1993) requires that a Scott domain be omega-algebraic. This definition may be a little dated, but anyway... In turn, omega-algebraic requires that the set of finite elements of the domain be countable. What, if any, part of the definition (currently) given in the article corresponds to that requirement? It seems to be important, as it's used in the book to show that general function spaces are not Scott (pre)domains. --Malcohol 13:11, 24 April 2006 (UTC)

Retrieved from "http://en.wikipedia.org../../../s/c/o/Talk%7EScott_domain_fccb.html"