Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • THEORETICAL PEARLS: A bargain for intersection types: a simple strong normalization proof

  • PETER MØLLER NEERGAARD
  • Journal:
    Journal of Functional Programming / Volume 15 / Issue 5 / September 2005
    Published online by Cambridge University Press:
    17 June 2005, pp. 669-677
    • Article
      • You have access
    • PDF
    • Export citation

  • This pearl gives a discount proof of the folklore theorem that every strongly $\beta$-normalizing $\lambda$-term is typable with an intersection type. (We consider typings that do not use the empty intersection $\omega$ which can type any term.) The proof uses the perpetual reduction strategy which finds a longest path. This is a simplification over existing proofs that consider any longest reduction path. The choice of reduction strategy avoids the need for weakening or strengthening of type derivations. The proof becomes a bargain because it works for more intersection type systems, while being simpler than existing proofs.