Gunter, C. (1992) The mixed power domain. Theoretical Computer Science 103 311--334. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Convex Powerdomain over Lattices: its Logic and.. - Alessi, al. (1997) (Correct)
....theory of powerdomains. Different constructions are possible, essentially because of different treatments of the undefined object. In the theory of powerdomains (see [35, 40, 24] and [20] for an elementary presentation) three main constructions have been devised (for other constructions, see e.g. [18, 19, 21]) the lower, upper and convex powerdomains. Roughly speaking, the lower powerdomain identifies those sets which have the same defined objects, while the upper powerdomain identifies with the totally undefined set any set having the undefined object among its elements. The convex powerdomain has a ....
C. Gunter, "The Mixed Powerdomain", Theor. Comp. Sci. 103, 1992, 311-334.
Semantic Representations and Query Languages for Or-Sets - Libkin, Wong (1993) (9 citations) (Correct)
....about some of the or sets, thus reducing the size of the normal form. In [16] a logical language was used, and we would like to see if the idea can be worked out for our languages. There are various sophisticated order theoretic models of partial information in databases sandwiches [6] mixes [11], snacks [19, 28] scones and salads [19, 22] They are used when a real world situation can be approximated from below and above by information in a database. These structures enjoy universality properties and therefore can be incorporated into the programming language syntax [22] We plan to ....
C. Gunter, The mixed powerdomain, Theoret. Comp. Sci. 103(1992), 311--334.
OR-SML: A Functional Database Programming Language for.. - Gunter, Libkin (1994) (2 citations) Self-citation (Gunter) (Correct)
....following: given a set of databases D1 ; Dn and a query q that can not be answered by using information from one of D i s, approximate the answer to q by using information from all D1 ; Dn . These problems have been investigated and they gave rise to a number of theoretical models [5, 10, 21, 15]. Given a query q, the databases are divided into two groups, one giving the upper approximation to the answer to q (that corresponds to possible information) and the other giving the lower approximation (that corresponds to the definite information) Here we demonstarte how OR SML can be used to ....
C. Gunter, The mixed powerdomain, Theoret. Comp. Sci. 103:311--334, 1992.
OR-SML: A Functional Database Programming Language for.. - Gunter, Libkin (1994) (2 citations) Self-citation (Gunter) (Correct)
.... (X,x) Set.ormember(mkboolco(true) orsmap (fn z = compat(z,x) X) in Set.select (fn z = compattoX (R,z) S end; val newcs1 = removeanomaly compatible (emp,cs1) val newcs1 = John , 76) Sally , 120) co Now consider the solution proposed in [3] see also [6]) Given an element x 2 CS1, let y 1 ; yn be those elements in Employees that can be joined with x. Then x 0 = V i (x y i ) is called a promotion of x. Intuitively, it adds all information about x from Employees. The solution to the TA query is to take all promotions of elements in ....
C. Gunter, The mixed powerdomain, Theoret. Comp. Sci. 103:311--334, 1992.
Math. Struct. in Comp. Science (2004), vol. 14, pp.. - Cambridge University Press (Correct)
No context found.
Gunter, C. (1992) The mixed power domain. Theoretical Computer Science 103 311--334.
A Convex Powerdomain over Lattices: its Logic and.. - Alessi, al. (1997) (Correct)
No context found.
C. Gunter, "The Mixed Powerdomain", Theor. Comp. Sci. 103, 1992, 311-334.
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