Comprehension Syntax (1994)
Cached
Download Links
- [ftp.cis.upenn.edu]
- [sdmc.krdl.org.sg:8080]
- [www.kris-inc.com]
- [lambda.uta.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | SIGMOD RECORD |
| Citations: | 24 - 4 self |
BibTeX
@ARTICLE{Buneman94comprehensionsyntax,
author = {Peter Buneman and Leonid Libkin and Dan Suciu and Val Tannen and Limsoon Wong},
title = {Comprehension Syntax},
journal = {SIGMOD RECORD},
year = {1994},
volume = {23},
pages = {87--96}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
