Untyped sets, invention, and computable queries
- 29 March 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 347-359
- https://doi.org/10.1145/73721.73755
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Why not negation by fixpoint?Published by Association for Computing Machinery (ACM) ,1988
- Possibilities and limitations of using flat operators in nested algebra expressionsPublished by Association for Computing Machinery (ACM) ,1988
- The powerset algebra as a result of adding programming constructs to the nested relational algebraPublished by Association for Computing Machinery (ACM) ,1988
- Semantic database modeling: survey, applications, and research issuesACM Computing Surveys, 1987
- Sets and negation in a logic data base language (LDL1)Published by Association for Computing Machinery (ACM) ,1987
- GALILEO: a strongly-typed, interactive conceptual languageACM Transactions on Database Systems, 1985
- A calculus for complex objectsPublished by Association for Computing Machinery (ACM) ,1985
- Making smalltalk a database systemPublished by Association for Computing Machinery (ACM) ,1984
- A new approach to database logicPublished by Association for Computing Machinery (ACM) ,1984
- A relational model of data for large shared data banksCommunications of the ACM, 1970