Generic multiset programming with discrimination-based joins and symbolic Cartesian products
From MaRDI portal
Publication:656874
DOI10.1007/S10990-011-9078-8zbMATH Open1232.68028OpenAlexW2118384863MaRDI QIDQ656874FDOQ656874
Authors: Fritz Henglein, Ken Friis Larsen 
Publication date: 13 January 2012
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10990-011-9078-8
Recommendations
- scientific article; zbMATH DE number 962458
- Multiset variable representations and constraint propagation
- Disjunctive Programs with Set Constraints
- Efficient automated reasoning about sets and multisets with cardinality constraints
- A generalization of join and an algorithmic recognition problem
- A generalized combinatorial nullstellensatz for multisets
- Generalized mapping for multiset rewriting systems
- Generalized multiset theory
- scientific article; zbMATH DE number 1213132
Database theory (68P15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- Title not available (Why is that?)
- Comprehending monads
- Title not available (Why is that?)
- An algorithm for handling many relational calculus queries efficiently.
- Applications of range query theory to relational data base join and selection operations
- Adaptive query processing
- Guarded recursive datatype constructors
- Generic discrimination: sorting and partitioning unshared data in linear time
- Generic top-down discrimination for sorting and partitioning in linear time
- Generic multiset programming with discrimination-based joins and symbolic Cartesian products
- Principles of programming with complex objects and collection types
Cited In (4)
Uses Software
This page was built for publication: Generic multiset programming with discrimination-based joins and symbolic Cartesian products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656874)
