Open Access
Winter 1996 Strong Normalization and Typability with Intersection Types
Silvia Ghilezan
Notre Dame J. Formal Logic 37(1): 44-52 (Winter 1996). DOI: 10.1305/ndjfl/1040067315

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.

Citation

Download Citation

Silvia Ghilezan. "Strong Normalization and Typability with Intersection Types." Notre Dame J. Formal Logic 37 (1) 44 - 52, Winter 1996. https://doi.org/10.1305/ndjfl/1040067315

Information

Published: Winter 1996
First available in Project Euclid: 16 December 2002

zbMATH: 0859.03007
MathSciNet: MR1379548
Digital Object Identifier: 10.1305/ndjfl/1040067315

Subjects:
Primary: 03B40
Secondary: 03B15 , 03B70 , 68Q55

Rights: Copyright © 1996 University of Notre Dame

Vol.37 • No. 1 • Winter 1996
Back to Top