ACM SIGMOD Record · 1994 · 213 citations · 22 references
ComputingComputer ScienceDatabasesProgramming LanguagesSyntaxDatabase ManagementQuery ProcessingRecursion TheoryStructured Query LanguageSyntax AnalysisSyntax-semantics InterfaceAbstract Syntax ModelingCollection TypesLanguage SyntaxPattern MatchingRecursionRecursion In SyntaxRecursive Queries
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.
22
A relational model of data for large shared data banks
E. F. Codd · Communications of the ACM · 1970 · 5.2K citations · Full text
A relational model of data for large shared data banks
E. F. Codd · Communications of the ACM · 1983 · 4.8K citations
Revised report on the algorithmic language ALGOL 68
B. J. Mailloux, J. E. L. Peck, M. Sintzoff et al. · Acta Informatica · 1975 · 233 citations · Full text
Type checking records and variants in a natural extension of ML
Didier Rémy · 1989 · 205 citations · Full text
Computing, Computer Science, Natural Language Processing +12