The syntax of comprehensions is very close to the syntax of a number of practical database query languages and is, we believe, a better starting point than first-order logic for the development of database languages. We give an informal account of a language based on comprehension syntax that deals uniformly with a variety of collection types; it also includes pattern matching, variant types and function definition. We show, again informally, how comprehension syntax is a natural fragment of structural recursion, a much more powerful programming paradigm for collection types. We also show that a very small äbstract syntax language" can serve as a basis for the implementation and optimization of comprehension syntax.
%0 Journal Article
%1 181564
%A Buneman, Peter
%A Libkin, Leonid
%A Suciu, Dan
%A Tannen, Val
%A Wong, Limsoon
%C New York, NY, USA
%D 1994
%I ACM
%J SIGMOD Rec.
%K comprehension functional language retrieval sigmod
%N 1
%P 87--96
%R http://doi.acm.org/10.1145/181550.181564
%T Comprehension syntax
%U http://portal.acm.org/citation.cfm?id=181550.181564
%V 23
%X The syntax of comprehensions is very close to the syntax of a number of practical database query languages and is, we believe, a better starting point than first-order logic for the development of database languages. We give an informal account of a language based on comprehension syntax that deals uniformly with a variety of collection types; it also includes pattern matching, variant types and function definition. We show, again informally, how comprehension syntax is a natural fragment of structural recursion, a much more powerful programming paradigm for collection types. We also show that a very small äbstract syntax language" can serve as a basis for the implementation and optimization of comprehension syntax.
@article{181564,
abstract = {The syntax of comprehensions is very close to the syntax of a number of practical database query languages and is, we believe, a better starting point than first-order logic for the development of database languages. We give an informal account of a language based on comprehension syntax that deals uniformly with a variety of collection types; it also includes pattern matching, variant types and function definition. We show, again informally, how comprehension syntax is a natural fragment of structural recursion, a much more powerful programming paradigm for collection types. We also show that a very small "abstract syntax language" can serve as a basis for the implementation and optimization of comprehension syntax.},
added-at = {2007-12-17T06:00:28.000+0100},
address = {New York, NY, USA},
author = {Buneman, Peter and Libkin, Leonid and Suciu, Dan and Tannen, Val and Wong, Limsoon},
biburl = {https://www.bibsonomy.org/bibtex/25e15de1de454ccc960d2380b2d9f5613/jhammerb},
description = {Comprehension syntax},
doi = {http://doi.acm.org/10.1145/181550.181564},
interhash = {32a4dc0cdad86b5cb4b1bf4ddeee1520},
intrahash = {5e15de1de454ccc960d2380b2d9f5613},
issn = {0163-5808},
journal = {SIGMOD Rec.},
keywords = {comprehension functional language retrieval sigmod},
number = 1,
pages = {87--96},
publisher = {ACM},
timestamp = {2007-12-17T06:00:28.000+0100},
title = {Comprehension syntax},
url = {http://portal.acm.org/citation.cfm?id=181550.181564},
volume = 23,
year = 1994
}