Leonid Libkin  Home/Search
Context Related
| belllabs.com/cm/cs/who/li...lupd.ps.gz upenn.edu/pub/papers/lib...eatcs92.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: belllabs.com/cm/cs/who/li...publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper is an algebraic cpo with bottom. Given a domain D, denotes its order and (Update)
Context of citations to this paper: More
.... and or sets [20] When this language is endowed with a new primitive which is essentially an isomorphism between iterated powerdomains [18], it becomes sufficiently rich to express a large number of queries on sets and or sets. Since monads arise from adjunctions, above them we...
.... Libkin uses minimal representatives for the Smyth powerdomain in order to prove that the Smyth and Hoare powerdomain constructions commute [5]. The powerdomain itself is defined using a different completion method than ideal completion, namely chain completion (see also [9, 11]...
Cited by: More
Semantic Representations and Query Languages for Or-Sets - Libkin, Wong (1993) (Correct)
A Semantics-based Approach to Design of Query Languages for.. - Libkin (1994) (Correct)
Normalizing Incomplete Databases - Libkin (1995) (Correct)
Active bibliography (related documents): More All
0.2: Information Systems for Continuous Posets - Vickers (1993) (Correct)
0.2: Algebraic Characterization of Edible Powerdomains - Libkin (1993) (Correct)
0.2: An Upper Power Domain Construction in terms of Strongly Compact.. - Heckmann (1998) (Correct)
Similar documents based on text: More All
0.3: 2-Stage Fixed-Point Iteration in a Modified Plotkin Powerdomain - Mogensen (1997) (Correct)
0.3: A Convex Powerdomain over Lattices: its Logic and.. - Alessi, al. (1997) (Correct)
0.3: Hausdorff's Theorem for posets that satisfy the finite.. - Abraham, Bonnet (Correct)
Related documents from co-citation: More All
7: Incomplete information in relational databases (context) - Imielinski, Lipski - 1984
7: A semantics for complex objects and approximate answers (context) - Buneman, Davidson et al. - 1991
7: Incomplete objects --- a data model for design and planning applications (context) - Imielinski, Naqvi et al. - 1991
BibTeX entry: (Update)
L. Libkin, An elementary proof that upper and lower powerdomain constructions commute, Bulletin of the EATCS, 48 (1992), 175-- 177. http://citeseer.ist.psu.edu/libkin92elementary.html More
@article{ libkin92elementary,
author = "L. Libkin",
title = "An elementary proof that upper and lower powerdomain constructions commute",
journal = "Bulletin of the European Association for Theoretical Computer Science",
volume = "48",
pages = "175--177",
year = "1992",
url = "citeseer.ist.psu.edu/libkin92elementary.html" }
Citations (may not include all citations):117 Semantic domains - Gunter, Scott - 1990
8 Hoare and Smyth power domain constructors commute under comp.. (context) - Flannery, Martin - 1990
8 Lower and upper power domain constructions commute on all cp.. - Heckmann - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.bell-labs.com/cm/cs/who/libkin/publ.html): More
Direct Decompositions of Atomistic Algebraic Lattices - Libkin (1995) (Correct)
Models of Approximation in Databases - Libkin (Correct)
A Query Language for Multidimensional Arrays: Design.. - Libkin, Machlin, Wong (1996) (Correct)
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