Generic multiset programming with discrimination-based joins and symbolic Cartesian products
From MaRDI portal
Publication:656874
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
Cites work
- scientific article; zbMATH DE number 1952947 (Why is no real title available?)
- scientific article; zbMATH DE number 2021404 (Why is no real title available?)
- Adaptive query processing
- An algorithm for handling many relational calculus queries efficiently.
- Applications of range query theory to relational data base join and selection operations
- Comprehending monads
- Generic discrimination: sorting and partitioning unshared data in linear time
- Generic multiset programming with discrimination-based joins and symbolic Cartesian products
- Generic top-down discrimination for sorting and partitioning in linear time
- Guarded recursive datatype constructors
- Principles of programming with complex objects and collection types
Cited in
(4)
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)