Name
Abstract | ||
|---|---|---|
In denotational semantics the meaning of a construct of a programming language is modelled by an element of a (semantic) domain. Domains are essentially ordered sets, in which every element may be approximated by a directed set of compact elements. We propose a new approach to domain construction using directed systems of certain finite subsets of a domain called sprouts. Every element of the domain can be considered as growing out from the sprouts, i.e., it can be uniquely approximated by an element of any given sprout. Sprouts consist only of compact elements and every compact element is contained in some of the sprouts. The directed system of sprouts fits neatly to the usual domain constructions, so we are able to describe the approximations of an element of a composed domain by the corresponding approximations in the component domains very exactly. Furthermore, we get a constructive and less abstract description of profinite domains than given by C. Gunter with one added feature: Given a domain functional t, the inverse limit of the retraction sequence1, t[1,], t2[1,], ... is indeed the least of a certain subset of fixed points of t, namely of those being the vertex of a cone that is “definable” in some sense. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1007/BF00572989 | Acta Informatica |
Keywords | Field | DocType |
Operating System,Data Structure,Communication Network,Information Theory,Computational Mathematic | Data structure,Discrete mathematics,Compact element,Combinatorics,Directed set,Vertex (geometry),Constructive,Denotational semantics,Inverse limit,Fixed point,Mathematics | Conference |
Volume | Issue | ISSN |
27 | 3 | 0001-5903 |
ISBN | Citations | PageRank |
3-540-17219-X | 2 | 0.73 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gunther Schmidt | 1 | 203 | 30.70 |
| Rudolf Berghammer | 2 | 569 | 76.48 |
| Hans Zierer | 3 | 47 | 6.55 |