Parametric polymorphism in the SIMPL language

Abstract

This thesis explores parametric polymorphism in the frame of the SIMPL (Simplified Imperative Modular Programming Language) programming language and relates that to the work done in other programming languages. SIMPL introduces hidden parameters inference as a new feature in parametric polymorphism. The thesis discusses new ideas of subtyping by specialization. Moreover, the thesis shows how subtyping by specialization gives power to function overloading and specialization. These ideas are backed with formal proofs. The thesis delves into the scheme of representing and processing the semantic information for every identifier. As a supplement, this research work devises algorithms for subtyping detection, ambiguous overloading rejection, function overloading resolution and hidden parameters inference. Besides, a mathematical representation of SIMPL is portrayed in a type system for this new language.