See this document in CiteSeerX!

A Proof of Strong Normalization for ... and Beyond  (Make Corrections)  
D. McAllester, J. Kucan, D.F. Otth



  Home/Search   Context   Related

 
View or download:
att.com/~dmac/strong.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  att.com/~dmac/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present an evaluation technique for proving strong normalization (SN). We use the technique to give SN proofs for F 2 , F -bounded quantification, subtypes, and F! . The evaluation technique derives SN as a corollary of the soundness of the typing rules under an appropriate evaluation semantics. The evaluation semantics yields simpler type sets than those used in the earlier SN proofs. The type sets discussed here form a complete lattice under classical union and intersection. The simplified ... (Update)

Active bibliography (related documents):   More   All
0.1:   Appendix 1: Product Types in F ! - In This Section   (Correct)
0.1:   Modified Realizability Toposes and Strong Normalization Proofs.. - Hyland, Ong (1993)   (Correct)
0.1:   New Notions of Reduction and Non-Semantic Proofs of Strong.. - Kfoury, Wells (1995)   (Correct)

Similar documents based on text:   More   All
0.4:   Unified Cardelli-Mitchell's Polymorphic Calculus with Subtyping.. - Vorobyov   (Correct)
0.2:   Metatheorems about Convertibility in Typed Lambda Calculi.. - Kucan (1997)   (Correct)
0.2:   Retraction Approach to CPS Transform - Kucan   (Correct)

BibTeX entry:   (Update)

@misc{ mcallester-proof,
  author = "D. McAllester and J. Kucan and D.F. Otth",
  title = "A Proof of Strong Normalization for ... and Beyond",
  url = "citeseer.ist.psu.edu/241956.html" }
Citations (may not include all citations):
325   Towards a theory of type structure (context) - Reynolds - 1974
43   Candidats de Reductibilit'e (context) - Gallier - 1990
42   A realizability interpretation of the theory of species (context) - Tait - 1975
41   Complete restrictions of the intersection type discipline - van Bakel - 1992
40   Interpr'etation fonctionelle et 'elimination des coupures da.. (context) - Girard - 1972
38   A type inference approach to reduction properties and semant.. (context) - Mitchell - 1986
8   Normalization revisited (context) - Scedrov - 1987
1   Available by anonymous ftp or on WWW as ftp://ftp (context) - Ghelli, system - 1993
1   Available by ftp or on WWW as ftp://ftp (context) - Gallier, correspondence et al. - 1993

Documents on the same site (http://www.research.att.com/~dmac/index.html):   More
Automatic Recognition of Tractability in Inference Relations - McAllester (1993)   (Correct)
Natural Language Based Inference Procedures applied to.. - Givan, McAllester.. (1991)   (Correct)
Walther Recursion - McAllester, Arkoudas (1996)   (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