Abstract
System F -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 system F ⩽ . 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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have