Difference between revisions 115528827 and 115528828 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)

A textbook treatment of domain theory with connections to lambda calculus and types:
*{{cite book | author = Carl A. Gunter | title = Semantics of Programming Languages | year = 1992 | publisher = MIT Press }}

A general, easy-to-read account of order theory, including an introduction to domain theory as well:
*{{cite book | author = B. A. Davey and H. A. Priestley | title = Introduction to Lattices and Order | edition = 2nd 
edition | year = 2002 | publisher =  Cambridge University Press | isbn = 0-521-78451-4 }}

An account of the Laws for Actor systems and how they can be used to justify Scott's continuity criterion:
*{{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]]

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