Principles of programming with complex objects and collection types

Theoretical Computer Science

Volumn 149, Issue 1, 1995, Pages 3-48

  Buneman, Peter ^a   Naqvi, Shamim ^b   Tannen, Val ^a   Wong, Limsson ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

^c Institute of Systems Science   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FILE ORGANIZATION; NATURAL LANGUAGE PROCESSING SYSTEMS; QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS;

CATEGORY THEORY; COMPLEX OBJECTS; STRUCTURAL RECURSION;

PROGRAMMING THEORY;

EID: 0029376142     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00024-Q     Document Type: Article

References (64)

1. On the power of languages for the manipulation of complex objects
2. Space usage in functional query languages
3. Fixpoint extensions of first-order logic and Datalog-like languages
4. University of data retrieval languages
5. A powerful and simple database language
6. Structureal recursion as a query language
7. Naturally embedded query languages
8. Logical and computational aspects of programming with Sets/Bags/Lists
9. The fast Fourier transform as a database query
10. An implementation technique for database query languages
11. Comprehension syntax
12. Computable queries for relational databases
13. Structure and complexity of relational queries
14. A relational model for large shared databanks
15. A recursive algebra for nested relations
16. Efficient optimization of iterative queries
17. Towards an effective calculus for object query languages
18. Completeness of many-sorted equational logic
19. An initial algebra approach to the specification, correctness and implementation of abstract data types
20. OR-SML: a functional database programming language for disjunctive information
21. A comparison between algebraic query languages for flat and nested databases
22. The powerset algebra as a natural tool to handle nested database relations
23. A query interface for heterogeneous biological data sources
24. Using a query language to integrate biological data
25. Database query languages embedded in the typed lambda calculus
26. Querying design and planning databases
27. The expressiveness of a family of finite set language
28. Information Processing Systems
29. Remarks on the algebra of non-first-normal-form relations
30. Aspects of partial information in database
31. Approximation in database
32. Semantic representations and query languages for or-sets
33. Aggregate functions, conservative extension, and linear orders
34. Some properties of query languag es for bags
35. Conservativity of nested relational calculi with internal generic functions
36. New techniques for studying set languages, bag languages, and aggregate functions
37. A database management system for document retrieval applications
38. A consideration on normal form of not necessarily normalised relation in the relational data model
39. Algorithmics — towards programming as a mathematical activity
40. Empty types in polymorphic λ-calculus
41. Notions of computation and monads
42. Database programming in Machiavelli a polymorphic language with static type inference
43. Converting nested relational algebra expression into flat algebra expressions
44. Optimizing functional query languages
45. The relational model with relation-valued attributes
46. Fixpoints and bounded fixpoints for complex objects
47. Domain-independent queries on databases with external functions
48. Any algorithm in the complex object algebra with powerset needs exponential space to compute transitive closure
49. A query language for NC
50. On two forms of structural recursion
51. Nested relational structures
52. Comprehesions, a query notation for DBPLs
53. List comprehensions and the relational calculus
54. Comprehending monads
55. Towards a theory of bulk types
56. Normal forms and conservative properties for query languag e over collection types
57. Querying nested collections