Polymorphic type inference for the relational algebra in the functional database programming language neon

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Lajos Nagy Florida Institute of Technology
Ryan Stansifer Florida Institute of Technology
Published in:
· Proceeding
ACM-SE 44 Proceedings of the 44th annual Southeast regional conference
Pages 673-678
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-315-8 doi>10.1145/1185448.1185596
Polymorphic type inference for the relational algebra in the functional database programming language neon Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 19
· Downloads (cumulative): 126
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder