Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson  Home/Search
Context Related
| brandeis.edu/~mairson/Paper...HKM.ps.gz brown.edu/pub/techreport...cs9306.ps.Z wwwipd.ira.uka.de/~ggh/pa...HKM96.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brandeis.edu/~mairson/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the expressive power of the typed -calculus when expressing computations over finite structures, i.e., databases. We show that the simply typed -calculus can express various database query languages such as the relational algebra, fixpoint logic, and the complex object algebra. In our embeddings, inputs and outputs are -terms encoding databases, and a program expressing a query is a -term which types when applied to an input and reduces to an output. Our embeddings have the... (Update)
Context of citations to this paper: More
...uniform typed inputs convention, where each input has one fixed simple type. This convention is the literature standard. It is used in [21] to code relational algebra, on finite structure inputs, in TLC = of order 3. If inputs are Church numerals given more complex types...
...application, lambda abstraction, and let abstraction; all typed using fixed order ( 5) functionalities. In this framework, proposed in [21] for arbitrary order functionalities, queries and databases are both typed lambda terms, evaluation is by reduction, and the main...
Cited by: More
A Structural Approach to Reversible Computation - Abramsky (2001) (Correct)
Space Usage in Functional Query Languages - Abiteboul, Hillebrand (1995) (Correct)
An Analysis of the Core-ML Language: Expressive Power .. - Kanellakis.. (1994) (Correct)
Similar documents (at the sentence level):
18.3%: Finite Model Theory in the Simply Typed Lambda Calculus - Hillebrand (1994) (Correct)
Active bibliography (related documents): More All
1.3: Functional Database Query Languages as Typed Lambda.. - Hillebrand, Kanellakis (1994) (Correct)
1.2: On the Expressive Power of Simply Typed and.. - Hillebrand, Kanellakis (1996) (Correct)
0.8: Functional Database Query Languages as Typed Lambda Calculi.. - Hillebrand, al. (1994) (Correct)
Similar documents based on text: More All
0.4: From Hilbert Spaces to Dilbert Spaces: - Context Semantics Made (Correct)
0.3: Functional Programming Formalisms for OODB Methods - Hillebrand, Kanellakis.. (1994) (Correct)
0.3: Reflections on complexity of ML type reconstruction - Wierzbicki (1997) (Correct)
Related documents from co-citation: More All
15: the power of languages for the manipulation of complex objects - Abiteboul, Beeri - 1988
14: Naturally embedded query languages (context) - Breazu-Tannen, Buneman et al. - 1992
12: The Expressiveness of a Family of Finite Set Languages - Immerman, Patnaik et al. - 1991
BibTeX entry: (Update)
G. Hillebrand, P. Kanellakis, and H. Mairson. Database Query Languages Embedded in the Typed Lambda Calculus. In Proceedings of the 8th IEEE LICS (1993), pp. 332--343. http://citeseer.ist.psu.edu/hillebrand93database.html More
@inproceedings{ hillebrand93database,
author = "Gerd G. Hillebrand and Paris C. Kanellakis and Harry G. Mairson",
title = "Database Query Languages Embedded in the Typed Lambda Calculus",
booktitle = "Logic in Computer Science",
pages = "332-343",
year = "1993",
url = "citeseer.ist.psu.edu/hillebrand93database.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
809 A Theory of Type Polymorphism in Programming (context) - Milner - 1978
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
379 The Complexity of Relational Query Languages (context) - Vardi - 1982
325 Towards a Theory of Type Structure (context) - Reynolds - 1974
245 Relational Queries Computable in Polynomial Time - Immerman - 1986
210 Generalized First-Order Spectra and Polynomial-Time Recogniz.. (context) - Fagin - 1974
198 Structure and Complexity of Relational Queries - Chandra, Harel - 1982
189 Computable Queries for Relational Databases - Chandra, Harel - 1980
185 The Calculi of Lambda-Conversion (context) - Church - 1941
185 Principles of Database Systems (context) - Ullman - 1982
152 Semantics of Programming Languages (context) - Gunter - 1992
139 Recursive Functions of Symbolic Expressions and their Comput.. - McCarthy - 1960
129 the Power of Languages for the Manipulation of Complex Objec.. - Abiteboul, Beeri - 1988
124 Datalog Extensions for Database Queries and Updates (context) - Abiteboul, Vianu - 1991
108 Relational Completeness of Database Sublanguages (context) - Codd - 1972
96 A New Recursion-Theoretic Characterization of the Polytime F.. (context) - Bellantoni, Cook - 1992
95 Fixed-point Extensions of First Order Logic (context) - Gurevich, Shelah - 1986
93 Principles of Programming with Complex Objects and Collectio.. - Buneman, Naqvi et al. - 1995
90 Structural Recursion as a Query Language - Breazu-Tannen, Buneman et al. - 1992
90 Horn Clause Queries and Generalizations (context) - Chandra, Harel - 1985
69 The Polynomial-Time Hierarchy (context) - Stockmeyer - 1977
65 Why Not Negation By Fixpoint (context) - Kolaitis, Papadimitriou - 1988
63 Optimal Reductions in the Lambda-Calculus (context) - L'evy - 1980
44 the Expressive Power of Database Queries with Intermediate T.. (context) - Hull, Su - 1991
43 The Definition of Standard ML (context) - Harper, Milner et al. - 1990
39 Bounded Linear Logic: A Modular Approach to Polynomial Time .. (context) - Girard, Scedrov et al. - 1992
39 Algebras of Feasible Functions (context) - Gurevich - 1983
38 The Intrinsic Computational Difficulty of Functions (context) - Cobham - 1964
29 ese de Doctorat d (context) - Girard, et et al. - 1972
27 The Expressiveness of a Family of Finite Set Languages - Immerman, Patnaik et al. - 1991
26 Lambda Calculus Characterizations of Poly-Time (context) - Leivant, Marion - 1993
25 Database Query Languages Embedded in the Typed Lambda Calcul.. - Hillebrand, Kanellakis et al. - 1993
23 An Implementation Technique for Database Query Languages (context) - Buneman, Frankel et al. - 1982
22 The Expressiveness of Simple and Second-Order Type Structure.. (context) - Fortune, Leivant et al. - 1983
21 A Simple Proof of a Theorem of Statman - Mairson - 1992
20 The Typed -Calculus is not Elementary Recursive (context) - Statman - 1979
18 The Inherent Computational Complexity of Theories of Ordered.. (context) - Meyer - 1975
18 the Complexity of Queries in the Logical Data Model - Kuper, Vardi - 1993
17 Possibilities and Limitations of Using Flat Operators in Nes.. (context) - Paredaens, Van Gucht - 1988
16 Database Theory Column: Query Languages for Complex Object D.. (context) - Abiteboul, Kanellakis - 1990
14 Inductive Definitions over Finite Structures (context) - Leivant - 1990
13 Functional Database Query Languages as Typed Lambda Calculi .. - Hillebrand, Kanellakis - 1994
12 Definierbare Funktionen im -Kalkul mit Typen (context) - Schwichtenberg - 1976
8 and -Definability (context) - Statman, Invariance - 1982
8 Finite Model Theory in the Simply Typed Lambda Calculus - Hillebrand - 1994
8 The Hierarchy of Finitely Typed Functional Programs (context) - Kfoury, Tiuryn et al. - 1987
7 Equality between Functionals (context) - Statman - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.brandeis.edu/~mairson/): More
Undecidable Boundedness Problems for Datalog Programs - Hillebrand, Kanellakis.. (1995) (Correct)
Unification and ML Type Reconstruction - Kanellakis, Mairson, Mitchell (1991) (Correct)
Outline of a Proof Theory of Parametricity - Mairson (1991) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC