Difference between revisions 115528819 and 115528820 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)

If ''f'' is a continuous function on a poset ''D'' then it has a least fixed point, given as the least upper bound of all finite iterations of ''f'' on the least element ''0'': V<sub>n in '''N'''</sub> ''f'' <sup>n</sup>(''0'').

==See also==
*[[Scott domain]]
*[[Scott informati
non system]]
*[[Type theory]]
*[[Category theory]]

== Literature ==

Probably one of the most recommendable books on domain theory today, giving a very clear and detailed view on many parts of the basic theory:

(contracted; show full)*{{cite conference | author = Carl Hewitt and Henry Baker | month = August | year = 1977 | title = Actors and Continuous Functionals | booktitle = Proceedings of IFIP Working Conference on Formal Description of Programming Concepts }}

[[Category:Domain theory|Domain theory]]
[[Category:Fixed points]]

[[fr:Théorie des domaines]]
[[ja:領域理論]]
[[zh:域理论]]