The Expressiveness of a Family of Finite Set Languages (1991)

by Neil Immerman , Sushant Patnaik , David Stemple
Venue:IN PROCEEDINGS OF 10TH ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS
Citations:26 - 3 self

Documents Related by Co-Citation

243 Structure and Complexity of Relational Queries – Ashok Chandra, David Harel - 1982
132 Naturally Embedded Query Languages – Val Breazu-tannen, Peter Buneman, Limsoon Wong - 1992
103 Structural Recursion as a Query Language – Val Breazu-tannen, Peter Buneman, Shamim Naqvi - 1991
530 The complexity of relational query languages – M Y Vardi - 1982
121 On The Power Of Languages For The Manipulation Of Complex Objects – Serge Abiteboul, Catriel Beeri - 1993
63 Logical and Computational Aspects of Programming with Sets/Bags/Lists – Val Breazu-tannen, Ramesh Subrahmanyam - 1991
269 Relational Queries Computable in Polynomial Time – Neil Immerman - 1986
179 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992
152 Datalog extensions for database queries and updates – S Abiteboul, V Vianu - 1991
83 Computable Queries for Relational Databases – Ashok Chandra, Asok K. Cadm, David Harel - 1980
44 On the expressive power of database queries with intermediate types – Richard Hull, Jianwen Su - 1991
1526 V.: Foundations of Databases – S Abiteboul, R Hull, Vianu - 1995
230 Languages That Capture Complexity Classes – Neil Immerman - 1987
25 Database Query Languages Embedded in the Typed Lambda Calculus – Gerd Hillebrand , Paris C. Kanellakis, Harry G. Mairson - 1993
50 Algebras of feasible functions – Yuri Gurevich - 1983
363 Towards a theory of type structure – J C Reynolds - 1974
939 A theory of type polymorphism in programming – Robin Milner - 1978
54 Normal Forms and Conservative Properties for Query Languages over Collection Types – Limsoon Wong - 1993
24 An implementation technique for database query languages – P Buneman - 1982