Difference between revisions 115528835 and 115528836 on dewiki

'''Domain theory''' is a   branch of [[mathematics]] that studies special kinds of [[partially ordered set]]s (posets) commonly called '''domains'''. Consequently, domain theory can be considered as a branch of [[order theory]]. The field has major applications in [[computer science]], where it is used to specify [[denotational semantics]], especially for [[functional programming|functional programming languages]]. Domain theory formalizes the intu(contracted; show full)

=== Approximation and finiteness ===

Domain theory is a purely ''qualitative'' approach to modeling the structure of information states. One can say that something contains more information, but the amount of additional information is not specified. Yet, there are some situations in which one wants to speak about elements that are in a sense much 
more simpler (or much more incomplete) than a given state of information. For example, in the natural subset-inclusion ordering on some [[powerset]], any infinite element (i.e. set) is much more "informative" than any of its ''finite'' subsets. 

(contracted; show full)[[Category:Domain theory]]
[[Category:Fixed points]]

[[fa:نظریه حوزه‌ها]]
[[fr:Théorie des domaines]]
[[ko:도메인 이론]]
[[ja:領域理論]]
[[zh:域理论]]