Parametricity as a Notion of Uniformity in Reflexive Graphs
Dunphy, Brian Patrick
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/86798
Description
Title
Parametricity as a Notion of Uniformity in Reflexive Graphs
Author(s)
Dunphy, Brian Patrick
Issue Date
2002
Doctoral Committee Chair(s)
Uday Reddy
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
"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."
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.