|
Abstract : |
x 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 additional property that PTIME computable queries are expressible by programs that, when applied to an input, reduce to an output in a PTIME sequence of reduction steps. Under our database input-output conventions, all elementary queries are expressible in the typed-calculus and the PTIME queries are expressible in the order-5 (order-4) fragment, |
