Steffen van Bakel  Home/Search
Context
Related
| doc.ic.ac.uk/~svb/Publi...CutElem.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: doc.ic.ac.uk/~svb/Publications... (more) Homepages: S.van Bakel |
Rate this article:      (best)Comment on this article |
Abstract: This paper defines reduction on derivations in the strict intersection type assignment system of [1], by generalising cut-elimination, 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 using intersection types. (Update)
Active bibliography (related documents): More All
0.6: A lambda calculus for D∞ - Severi, de Vries (2002) (Correct)
0.5: Strongly Normalising Cut-Elimination with Strict Intersection.. - van Bakel (2003) (Correct)
0.5: Characterising Strong Normalisation for Explicit.. - van Bakel.. (2002) (Correct)
Similar documents based on text: More All
0.9: Compositional Characterisations of λ-terms.. -.. (2003) (Correct)
0.9: Normalization Results for Typeable Rewrite Systems - van Bakel, Fernández (1997) (Correct)
0.9: Partial Intersection Type Assignment in Applicative Term.. - van Bakel (1993) (Correct)
BibTeX entry: (Update)
@misc{ bakel-cutelimination,
author = "Steffen van Bakel",
title = "Cut-Elimination in the Strict Intersection Type Assignment System Is Strongly
Normalizing",
url = "citeseer.ist.psu.edu/595499.html" }
Citations (may not include all citations):729 The Lambda Calculus: its Syntax and Semantics (context) - Barendregt - 1984
259 Combinatory Logic (context) - Curry, Feys - 1958
137 A filter lambda model and the completeness of type assignmen.. (context) - Barendregt, Coppo et al. - 1983
133 Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
121 Intensional interpretation of functionals of finite type (context) - Tait - 1967
68 An Extension of the Basic Functionality Theory for the -Cal.. (context) - Coppo, Dezani-Ciancaglini - 1980
64 A type assignment for the strongly normalizable -terms (context) - Pottinger - 1980
54 Principal type schemes for an extended type theory (context) - Della, Venneri - 1984
38 Principal type scheme and unification for intersection type .. (context) - Della - 1988
35 Complete restrictions of the Intersection Type Discipline - van Bakel - 1992
27 Functionality in Combinatory Logic (context) - Curry - 1934
26 Intersection Type Assignment Systems (context) - van Bakel - 1995
22 Strong normalization and typability with intersection types (context) - Ghilezan - 1996
18 Lambda-Calcul -- Types et Mod eles (context) - Krivine - 1990
11 Normal Forms and D1-Lambda-Models (context) - Coppo, Dezani-Ciancaglini et al. - 1987
4 Normalization Results for Typeable Rewrite Systems - van Bakel, andez - 1997
3 intersection types and explicit substitutions (context) - Dougherty, Lescanne - 2001
3 Theoretical Computer Science (context) - van Bakel, Barbanera et al. - 2002
3 Theoretical Computer Science (context) - van Bakel, FernVndez et al. - 2002
2 INRIA Rapport de recherche (context) - Retor, on et al. - 1994
1 Theoretical Computer Science (context) - Dezani-Ciancaglini, Margaria et al. - 1986
1 Characterising Strong Normalisation for Explicit Substitutio.. - van Bakel, Dezani-Ciacaglini - 2002
1 Strongly Normalisation Cut-Elimination with Strict Intersect.. (context) - van Bakel - 2002
Documents on the same site (http://www.doc.ic.ac.uk/~svb/Publications/): More
Comparing Cubes - van Bakel, Liquori, Rocca, Urzyczyn (Correct)
The Minimal Relevant Logic and the Call-by-Value.. - van Bakel.. (1999) (Correct)
Types for Trees - van Bakel, Barbanera.. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC