Abstract
A simple proof is given of the property that the set of strongly normalizing lambda terms coincides with the set of lambda terms typable in certain intersection type assignment systems. © 1996 by the University of Notre Dame. All rights reserved.
Cite
CITATION STYLE
APA
Ghilezan, S. (1996). Strong normalization and typability with intersection types. Notre Dame Journal of Formal Logic, 37(1), 44–52. https://doi.org/10.1305/ndjfl/1040067315
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free