C. A. Gunter. Sets and the Semantics of Bounded Non-Determinism. Manuscript, University of Cambridge, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Logical and Computational Aspects of Programming with.. - Breazu-Tannen.. (1991) (10 citations) (Correct)
....has been suggested for reasons of mathematical elegance by Meertens and of efficiency by Sleep . In programming language theory most of the research on issues involving set semantics has concentrated on powerdomains, with the primary motivations coming from studying nondeterminism and concurrency [Gunter 1986]. A powerdomain semantics for relational and complex object databases is discussed in [Buneman et al. 1989] 1.3 Overview In Section 2 we present general results about languages built on top of the simply typed lambda calculus with products, by adding datatype presentations like those in Figure ....
C. A. Gunter. Sets and the Semantics of Bounded Non-Determinism. Manuscript, University of Cambridge, 1986.
Semantic Domains - Gunter, Scott (1990) (115 citations) Self-citation (Gunter) (Correct)
....They were first defined by Plotkin [Plo76] where they are called SFP objects ) and the term bifinite is due to Paul Taylor. Bifinite domains (and various closely related classes of cpo s) have also been discussed under other names such as strongly algebraic [Smy83a, Gun86] and profinite [Gun87] domains. 6.1 Plotkin orders. As we suggested earlier, the image of a finitary projection p : D D on a domain D can be viewed as an approximation to D. A bifinite domain is one which is a directed limit of its finite approximations. But what is this really saying about the structure of D ....
....is a z 2 u such that z v y. Now, given a domain D, we define D to be the domain of ideals over hM(A) i. Theorem 29 If D is bifinite, then so is D . Moreover, if D = D and E is any bifinite domain, then there is a projection p : D E. A full proof of the theorem may be found in [Gun87] We will attempt to offer some hint about how the desired fixed point is obtained. At the first step we take the domain I = f g containing only the single point . At the second step, I , there are elements a = f g) and b = with b a. At the third step there are five elements ....
C. A. Gunter. Sets and the semantics of bounded nondeterminism. Manuscript, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC