Parametricity as a Notion of Uniformity in Reflexive Graphs

265 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.The strength of this notion of uniformity can be exhibited by way of "representation results". We show that the possible parametric transformations of certain type correspond to the intuitively uniform families of functions of that type. Thus abstract models of polymorphic programming languages are produced. Some programming language features, such as state and recursion, provide modeling complications when combined with polymorphism. We show that representation results are still obtainable for polymorphic programming languages with state or recursion.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD