A complete characterization of complete intersection-type preorders

doi:10.1145/601775.601780

A complete characterization of complete intersection-type preorders

Full Text:

Pdf

Buy this Article

Authors:	M. Dezani-Ciancaglini	Università di Torino, Turin, Italy
	F. Honsell	Università di Udine, Udine, Italy
	F. Alessi	Università di Udine, Udine, Italy

Published in:

· Journal

ACM Transactions on Computational Logic (TOCL) TOCL Homepage archive

Volume 4 Issue 1, January 2003
Pages 120 - 147
ACM New York, NY, USA
table of contents doi>10.1145/601775.601780

	2003 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 6 · Downloads (cumulative): 267 · Citation Count: 7

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: completeness denotational semantics intersection types lambda calculus lambda calculus and related systems lambda models languages theory type structure 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 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