Database query languages embedded in the typed lambda calculus

Database query languages embedded in the typed lambda calculus

It is shown how to naturally embed, in the typed lambda -calculus with equality, many database query languages, including the relational calculus/algebra, inflationary Datalog, and the complex object calculus/algebra. The embeddings considered are such that a database is a lambda -term coding list o...

Full description

Saved in:
Bibliographic Details
Published in:[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science pp. 332 - 343
Main Authors: Hillebrand, G.G., Kanellakis, P.C., Mairson, H.G.
Format: Conference Proceeding
Language:English
Published: IEEE Comput. Soc. Press 1993
Subjects:
Algebra
Calculus
Contracts
Database languages
Embedded computing
Instruments
Polynomials
Relational databases
Robustness
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is shown how to naturally embed, in the typed lambda -calculus with equality, many database query languages, including the relational calculus/algebra, inflationary Datalog, and the complex object calculus/algebra. The embeddings considered are such that a database is a lambda -term coding list of tuples and a query is a lambda -term which when applied to the input database normalizes to the output database. In addition, if the query expressed is a PTIME query, then the normal form can be computed in a number of reduction steps polynomial in the size of the input database. It is also shown that, for all PTIME queries, there is such an embedding in the order-three typed lambda -calculus with equality.< >
ISBN:0818631406
9780818631405
DOI:10.1109/LICS.1993.287575