SIGN IN
SIGN UP
Functional database query languages as typed lambda calculi of fixed order (extended abstract)
Full Text:
PDF
Buy this Article
Authors:
Gerd G. Hillebrand
Brown University and INRIA Rocquencourt, France
Paris C. Kanellakis
Brown University
Published in:
· Proceeding
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Pages 222-231
ACM
New York, NY
, USA
©1994
table of contents
ISBN:0-89791-642-5
doi>
10.1145/182591.182615
1994 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 12
· Downloads (cumulative): 237
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
lambda calculus and related systems
languages
query languages
query processing
reducibility and completeness
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder