Comprehension syntax
- 1 March 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 23 (1), 87-96
- https://doi.org/10.1145/181550.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.Keywords
This publication has 15 references indexed in Scilit:
- Polymorphism and type inference in database programmingACM Transactions on Database Systems, 1996
- Conservativity of nested relational calculi with internal generic functionsInformation Processing Letters, 1994
- Any algorithm in the complex object algebra with powerset needs exponential space to compute transitive closurePublished by Association for Computing Machinery (ACM) ,1994
- A query language for NCPublished by Association for Computing Machinery (ACM) ,1994
- Comprehending monadsMathematical Structures in Computer Science, 1992
- Converting nested algebra expressions into flat algebra expressionsACM Transactions on Database Systems, 1992
- Database theory columnACM SIGACT News, 1990
- Database programming in Machiavelli---a polymorphic language with static type inferencePublished by Association for Computing Machinery (ACM) ,1989
- Type checking records and variants in a natural extension of MLPublished by Association for Computing Machinery (ACM) ,1989
- Revised report on the algorithmic language ALGOL 68Acta Informatica, 1975