Abstract

The aim of this work is to widen ML-type polymorphism to a more comprehensive form. Polymorphic type systems as proposed by Milner and implemented in the programming language Standard ML offer rich types, unobtrusive compile time type checking, and type safety in functional languages. However, straightforward application of such a type system to languages can inhibit seriously the characteristic polymorphic nature of an argument occurring twice or more in a function definition. We describe the problems and present a formal type discipline for polymorphic expressions in the context of a simple programming language, and a compile time type-checking algorithm R which enforces the discipline. The algorithm, which is sound and (we believe) complete, introduces a new operator 2229 for handling conjunction types. We also suggest an idea about a unification algorithm for handling type expressions with or without 2229-operators [gho87b].

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 call

Disclaimer: 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.