Abstract
The formal core calculus .FJ has been introduced to model lightweight family polymorphism, a programming style to support reusable yet type-safe mutually recursive classes. This paper clarifies the essence of the features of .FJ, by giving a formal translation from .FJ into a variant of Featherweight GJ with a little extension of F-bounded polymorphism. The extension, which allows self types to appear in mutually recursive constraints on type variables, is significant to achieve a clear correspondence between the two languages without losing type safety. We show that the extended version of Featherweight GJ is type sound and that the formal translation preserves typing and reduction.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
