Database query languages embedded in the typed lambda calculus
- 31 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Datalog extensions for database queries and updatesJournal of Computer and System Sciences, 1991
- Why not negation by fixpoint?Published by Association for Computing Machinery (ACM) ,1988
- Relational queries computable in polynomial timeInformation and Control, 1986
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Algebras of feasible functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- The Expressiveness of Simple and Second-Order Type StructuresJournal of the ACM, 1983
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- The typed λ-calculus is not elementary recursiveTheoretical Computer Science, 1979
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Definierbare Funktionen imλ-Kalkül mit TypenArchive for Mathematical Logic, 1975