2026-09-20T21:39:22Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/86798 2023-07-11 col_2142_5131 col_2142_16340 com_2142_5130 com_2142_16339 com_2142_8903

Uday Reddy Dunphy, Brian Patrick 2015-09-28T15:19:35Z 2015-09-28T15:19:35Z 10000-01-01 2002 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." Made available in DSpace on 2015-09-28T15:19:35Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3070294.pdf: 10764644 bytes, checksum: 7abe5c81ea87fb7105fde1f18b265f2e (MD5) Previous issue date: 2002 Embargo set by: Seth Robbins for item 88079 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 265 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002. http://hdl.handle.net/2142/86798 (MiAaPQ)AAI3070294 eng Computer Science Parametricity as a Notion of Uniformity in Reflexive Graphs text Mathematics Mathematics University of Illinois at Urbana-Champaign Dissertation Ph.D.