Principality and decidable type inference for finite-rank intersection types

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: A. J. Kfoury Boston University, Boston, MA
J. B. Wells Heriot-Watt University, EDINBURGH, EH14 4AS, Scotland
Published in:
Cover Image
 
· Proceeding
POPL '99 Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pages 161-174
ACM New York, NY, USA ©1999
table of contents ISBN:1-58113-095-3 doi>10.1145/292540.292556
Principality and decidable type inference for finite-rank intersection types Published by ACM 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 23
· Downloads (cumulative): 284
· Citation Count: 26


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