Comprehension syntax
Peter Buneman, Leonid O. Libkin, Dan Mircea Suciu et al. · ACM SIGMOD Record · 1994
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.
Cited by 210 works. doi:10.1145/181550.181564 Open-access PDF
Authors
References
- A relational model of data for large shared data banks
- A relational model of data for large shared data banks
- Structure and Interpretation of Computer Programs
- The Definition of Standard ML
- Miranda: A non-strict functional language with polymorphic types
- Proceedings of the International Conference on Very Large Data Bases
- Revised Report on the Algorithmic Language Algol 60
- Revised report on the algorithmic language ALGOL 68
- On the power of languages for the manipulation of complex objects
- FAD, a Powerful and Simple Database Language