Domains for denotational semantics Export

@incollection{citeulike:3753065, abstract = {The purpose of the theory of domains is to give models for spaces on which to define computable functions. The kinds of spaces needed for denotational sematics involve not only spaces of higher type (e.g. function spaces) but also spaces defined recursively (e.g. reflexive domains). Also required are many special domain constructs (or functors) in order to create the desired structures. There are several choices of a suitable category of domains, but the basic one which has the simplest properties is the one sometimes called consistently complete algebraic cpo's. This category of domains is studied in this paper from a new, and it is to be hoped, simpler point of view incorporating the approaches of many authors into a unified presentation. Briefly, the domains of elements are represented set theoretically with the aid of structures called information systems. These systems are very familiar from mathematical logic, and their use seems to accord well with intuition. Many things that were done previously axiomatically can now be proved in a straightfoward way as theorems. The present paper discusses many examples in an informal way that should serve as an introduction to the subject.}, author = {Scott, Dana}, citeulike-article-id = {3753065}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/BFb0012801}, citeulike-linkout-1 = {http://www.springerlink.com/content/w1884k076t5hp233}, comment = {This seems to be the paper (chapter) introducing Information Systems.}, doi = {10.1007/BFb0012801}, journal = {Automata, Languages and Programming}, keywords = {denotational, domains, semantics, types}, pages = {577--610}, posted-at = {2008-12-07 03:58:09}, priority = {0}, title = {Domains for denotational semantics}, url = {http://dx.doi.org/10.1007/BFb0012801}, year = {1982} }

TY - CHAP ID - citeulike:3753065 L3 - citeulike-article-id:3753065 N2 - The purpose of the theory of domains is to give models for spaces on which to define computable functions. The kinds of spaces needed for denotational sematics involve not only spaces of higher type (e.g. function spaces) but also spaces defined recursively (e.g. reflexive domains). Also required are many special domain constructs (or functors) in order to create the desired structures. There are several choices of a suitable category of domains, but the basic one which has the simplest properties is the one sometimes called consistently complete algebraic cpo's. This category of domains is studied in this paper from a new, and it is to be hoped, simpler point of view incorporating the approaches of many authors into a unified presentation. Briefly, the domains of elements are represented set theoretically with the aid of structures called information systems. These systems are very familiar from mathematical logic, and their use seems to accord well with intuition. Many things that were done previously axiomatically can now be proved in a straightfoward way as theorems. The present paper discusses many examples in an informal way that should serve as an introduction to the subject. JF - Automata, Languages and Programming EP - 610 TI - Domains for denotational semantics SP - 577 KW - denotational KW - domains KW - semantics KW - types N1 - This seems to be the paper (chapter) introducing Information Systems. AU - Scott, Dana PY - 1982/// UR - http://dx.doi.org/10.1007/BFb0012801 ER -