Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (Extended Abstract) (1994)

Cached

Download Links

by Gerd G. Hillebrand , Paris C. Kanellakis
Venue:In Proceedings 13th PODS
Citations:12 - 5 self

Documents Related by Co-Citation

25 Database Query Languages Embedded in the Typed Lambda Calculus – Gerd Hillebrand , Paris C. Kanellakis, Harry G. Mairson - 1993
530 The complexity of relational query languages – M Y Vardi - 1982
26 The typed ^.-calculus is not elementary recursive – R Statman - 1979
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
8 Finite Model Theory In The Simply Typed Lambda Calculus – Gerd G. Hillebrand - 1994
121 On The Power Of Languages For The Manipulation Of Complex Objects – Serge Abiteboul, Catriel Beeri - 1993
320 The Calculi of LambdaConversion – Alonzo Church - 1941
33 The expressiveness of simple and second-order type structures – S Fortune, D Leivant, M O'Donnell
20 A simple proof of a theorem of Statman – Harry G. Mairson - 1992
179 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992
939 A theory of type polymorphism in programming – Robin Milner - 1978
20 The inherent computational complexity of theories of ordered sets – A R Meyer - 1974
132 Naturally Embedded Query Languages – Val Breazu-tannen, Peter Buneman, Limsoon Wong - 1992
269 Relational Queries Computable in Polynomial Time – Neil Immerman - 1986
73 clauses queries and generalizations – Horn - 1985
26 The Expressiveness of a Family of Finite Set Languages – Neil Immerman, Sushant Patnaik, David Stemple - 1991
11 Definierbare funktionen im #-kalkul mit typen – H Schwichtenberg - 1976
50 Algebras of feasible functions – Yuri Gurevich - 1983
38 Lambda calculus characterizations of poly-time – D Leivant, J-Y Marion