Scrap Your Type Applications

Publication Type:
Conference Proceeding
Mathematics of Program Construction Proceedings, 2008, pp. 2 - 27
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2008001768OK.pdf419.28 kB
Adobe PDF
We intoduce System IF, for implicit System F, in which many type applications can be made implicit. It supports decidable type checking and strong normalisation. System IF constitutes a first foray into a new area in the design space of typed lambda calculi, that is interesting in its own right and may prove useful in practice.
Please use this identifier to cite or link to this item: