Back to results
University of Illinois at Urbana-Champaign
Parametricity as a Notion of Uniformity in Reflexive Graphs
Abstract
dc:description"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."
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Dunphy, Brian Patrick
- Contributors dc:contributor
-
- Uday Reddy
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI3070294
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/86798