Skip to main content
Article thumbnail
Location of Repository

Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalising. To appear in: Notre Dame Journal of Formal Logic

By Steffen Van Bakel

Abstract

This paper defines reduction on derivations (cut-elimination) in the Strict Intersection Type Assignment System of [1] and shows a strong normalisation result for this reduction. Using this result, new proofs are given for the approximation theorem and the characterisation of normalisability of terms, using intersection types

Topics: intersection types, lambda calculus, termination, cut-elimination
Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.5500
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://pubs.doc.ic.ac.uk/Bakel... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.