Principles of programming with complex objects and collection types
From MaRDI portal
Publication:672333
DOI10.1016/0304-3975(95)00024-QzbMath0874.68092OpenAlexW2130872776MaRDI QIDQ672333
Peter Buneman, Limsoon Wong, Val Tannen, Shamim Naqvi
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00024-q
Related Items
Strongly-Normalizing Higher-Order Relational Queries, Semantic subtyping with an SMT solver, Comprehending Ringads, Database query languages and functional logic programming, Well-definedness and semantic type-checking for the nested relational calculus, A query language for NC, Capability-based localization of distributed and heterogeneous queries, Expressivity and Complexity of MongoDB Queries, Models of approximation in databases, Domain-independent queries on databases with external functions, Bounded fixpoints for complex objects, Iterating on multiple collections in synchrony, Expressive power of SQL., Incremental recomputation in local languages., Generic multiset programming with discrimination-based joins and symbolic Cartesian products, The foundation of self-developing blob machines for spatial computing, Query lifting. Language-integrated query for heterogeneous nested collections, MGS, Unnamed Item, Structural recursion as a query language on lists and ordered trees, A descriptive type foundation for RDF Schema, Fragments of Bag Relational Algebra: Expressiveness and Certain Answers, Provenance as dependency analysis, Local properties of query languages, The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads, A formalization of SQL with nulls
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of computation and monads
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The relational model with relation-valued attributes
- Computable queries for relational data bases
- A comparison between algebraic query languages for flat and nested databases
- The powerset algebra as a natural tool to handle nested database relations
- Conservativity of nested relational calculi with internal generic functions
- Direct decompositions of atomistic algebraic lattices
- Structure and complexity of relational queries
- Database query languages embedded in the typed lambda calculus
- Comprehending monads
- A relational model of data for large shared data banks
