(Enter summary)
Abstract: Bulk data types such as sets, bags, and lists are an important component of a modern query language. It is
desirable that operations on one bulk data type (such as sets) that have analogous counterparts in other bulk
data types (such as bags and list) be expressed using the same expression. This kind of uniformity is achieved
only to a limited degree in object-oriented languages, as these languages have the type information loss problem.
Languages based on parametric polymorphism achieve this... (Update)
Active bibliography (related documents): More All
0.5: A Proof-Theoretic Assessment of Runtime Type Errors - Gunter, Rémy (1993)
(Correct)
0.5: Principles of Programming with Complex Objects and.. - Buneman, Naqvi, Tannen, .. (1995)
(Correct)
0.3: Tutorial: Languages for Collection Types - Tannen (1994)
(Correct)
Similar documents based on text: More All
0.4: Query Languages for Bags - Expressive Power and Complexity - Grumbach, Libkin, Milo, Wong (1996)
(Correct)
0.4: Normal Forms and Conservative Extension Properties for Query.. - Wong (1995)
(Correct)
0.3: Query Languages for Bags and Aggregate Functions - Libkin, Wong (1997)
(Correct)
BibTeX entry: (Update)
@misc{ wong-polymorphic,
author = "Limsoon Wong",
title = "Polymorphic Queries Across Sets, Bags, and Lists",
url = "citeseer.ist.psu.edu/wong94polymorphic.html" }
Citations (may not include all citations):
729
The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
388
On understanding types (context) - Cardelli, Wegner - 1985
224
Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
134
The relational model with relation-valued attributes (context) - Schek, Scholl - 1986
107
Complete type inference for simple objects (context) - Wand - 1987
106
Naturally embedded query languages (context) - Breazu-Tannen, Buneman et al. - 1992
94
Mathematical Structures in Computer Science (context) - Wadler - 1992
79
Comprehension syntax
- Buneman, Libkin et al. - 1994
78
Nested relational structures (context) - Thomas, Fischer - 1986
56
ML with extended pattern matching and subtypes
- Jategaonkar, Mitchell - 1988
52
The Semantics of Programming Languages: An Elementary Introd.. (context) - Hennessy - 1990
43
A recursive algebra for nested relations (context) - Colby - 1990
39
Converting nested relational algebra expressions into flat a.. (context) - Paredaens, Van Gucht - 1992
38
Recursion equations as a programming language (context) - Turner - 1982
26
Typechecking records and variants in a natural extension of .. (context) - Remy - 1989
15
a polymorphic language with static type inference (context) - Ohori, Buneman et al. - 1989
14
List comprehensions (context) - Wadler - 1987
13
Towards a theory of bulk types
- Watt, Trinder - 1991
9
On two forms of structural recursion
- Suciu, Wong - 1995
8
Any algorithm in the complex object algebra needs exponentia.. (context) - Suciu, Paredaens - 1994
7
Using a query language to integrate biological data (context) - Hart, Wong et al. - 1994
4
Recent Design Trade-offs in SQL (context) - Mattos, DeMichiel - 1994
2
Bulletin of the European Association for Theoretical Compute.. (context) - Gunter, semantic - 1991
1
A uniform calculus for bulk data types (context) - Fegaras - 1994
Documents on the same site (http://sdmc.krdl.org.sg:8080/~limsoon/limsoonpapers.html): More
Lower Bounds for Invariant Queries in Logics with Counting - Libkin, Wong (2002)
(Correct)
Comprehension Syntax - Buneman, Libkin, Suciu, Tannen, Wong (1994)
(Correct)
Some Relationships between the FOIES and ... Arity Hierarchies - Dong, 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