Affiliation:
1. University of Pennsylvania, Department of Computer and Information Science, 200 South 33rd Street , Philadelphia PA
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
123 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Comprehending queries over finite maps;International Symposium on Principles and Practice of Declarative Programming;2023-10-22
2. A Formalization of SQL with Nulls;Journal of Automated Reasoning;2022-07-27
3. Lifecycle in CS1;Proceedings of the 27th ACM Conference on on Innovation and Technology in Computer Science Education Vol. 1;2022-07-07
4. Iterating on multiple collections in synchrony;Journal of Functional Programming;2022
5. Monads for Measurable Queries in Probabilistic Databases;Electronic Proceedings in Theoretical Computer Science;2021-12-29