Termination of System F-bounded: A Complete Proof

Abstract SystemF-bounded is a second-order typedλ-calculus with subtyping which has been defined to carry out foundational studies about the type systems of object-oriented languages. The almost recursive nature of the essential feature of this system makes one wonder whether it retains the strong normalization property, with respect to first- and second-orderβϵreduction of systemF⩽. We prove that this is the case. The proof is carried out to the last detail to allow the reader to be convinced of its correctness.

[1]  John C. Mitchell.  A type-inference approach to reduction properties and semantics of polymorphic expressions (summary) , 1986, LFP '86.

[2]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[3]  Healfdene Goguen.  A typed operational semantics for type theory , 1994 .

[4]  John C. Mitchell,et al.  F-bounded quantification for object-oriented programming , 1989 .

[5]  Kim B. Bruce,et al.  A modest model of records, inheritance and bounded quantification , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[6]  John C. Mitchell,et al.  A type system for prototyping languages , 1994, POPL '94.

[7]  Giorgio Ghelli,et al.  Coherence of Subsumption, Minimum Typing and Type-Checking in F<= , 1992, Math. Struct. Comput. Sci..

[8]  Luca Cardelli,et al.  An Extension of System F with Subtyping , 1991, TACS.

[9]  Kim B. Bruce.  A paradigmatic object-oriented programming language: Design, static typing and semantics , 1994, Journal of Functional Programming.

[10]  Kim B. Bruce,et al.  PolyTOIL: A Type-Safe Polymorphic Object-Oriented Language , 1995, ECOOP.

[11]  John C. Mitchell.  Toward a typed foundation for method specialization and inheritance , 1989, POPL '90.

[12]  J. H. Geuvers.  Logics and type systems , 1993 .

[13]  Scott F. Smith,et al.  Application of OOP Type Theory: State, Decidability, Integragtion , 1994, OOPSLA.

[14]  Martín Abadi,et al.  On Subtyping and Matching , 1995, ECOOP.

[15]  Dinesh Katiyar.  Subtyping F-bounded types , 1992 .

[16]  John C. Mitchell,et al.  Type Systems for Programming Languages , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[17]  Giorgio Ghelli,et al.  Coherence of Subsumption , 1990, CAAP.

[18]  Benjamin C. Pierce,et al.  Simple type-theoretic foundations for object-oriented programming , 1994, Journal of Functional Programming.

[19]  William W. Tait,et al.  Intensional interpretations of functionals of finite type I , 1967, Journal of Symbolic Logic.

[20]  David McAllester,et al.  A Proof of Strong Normalization of F_2, F_omega and Beyond , 1995, Inf. Comput..

[21]  John C. Mitchell,et al.  Notes on Typed Object-Oriented Programming , 1994, TACS.

[22]  Luca Cardelli,et al.  Subtyping recursive types , 1993 .

[23]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.