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

233 Structure and Complexity of Relational Queries – Ashok Chandra, David Harel - 1982
118 Naturally Embedded Query Languages – Val Breazu-tannen, Peter Buneman, Limsoon Wong - 1992
100 Structural Recursion as a Query Language – Val Breazu-tannen, Peter Buneman, Shamim Naqvi - 1991
485 The Complexity of Relational Query Languages – M Vardi - 1982
118 On The Power Of Languages For The Manipulation Of Complex Objects – Serge Abiteboul, Catriel Beeri - 1993
62 Logical and Computational Aspects of Programming with Sets/Bags/Lists – Val Breazu-tannen, Ramesh Subrahmanyam - 1991
254 Relational Queries Computable in Polynomial Time – Neil Immerman - 1986
158 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992
138 Datalog extensions for database queries and updates – S Abiteboul, V Vianu
82 Computable Queries for Relational Databases – Ashok Chandra, Asok K. Cadm, David Harel - 1980
42 On the expressive power of database queries with intermediate types – Richard Hull, Jianwen Su - 1991
1267 Foundations of Databases – S Abiteboul, R Hull, V Vianu - 1995
212 Languages That Capture Complexity Classes – Neil Immerman - 1987
23 Database Query Languages Embedded in the Typed Lambda Calculus – Gerd Hillebrand , Paris C. Kanellakis, Harry G. Mairson - 1993
49 Feasible Functions – Yuri Gurevich - 1993
874 A theory of type polymorphism in programming – Robin Milner - 1978
339 Towards a theory of type structure – J C Reynolds
51 Normal Forms and Conservative Properties for Query Languages over Collection Types – Limsoon Wong - 1993
22 An Implementation Technique for Database Query Languages – P Buneman, R E Frankel, N Rishiyur - 1982