Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.


Comprehensive parametric polymorphism : categorical models and type theory

Ghani, Neil and Nordvall Forsberg, Fredrik and Simpson, Alex (2016) Comprehensive parametric polymorphism : categorical models and type theory. In: Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science, 9634 . Springer Berlin/Heidelberg, pp. 3-19. ISBN 978-3-662-49630-5

Text (Ghani-etal-FOSSACS2016-comprehensive-parametric-polymorphism-categorical-models-type-theory)
Ghani_etal_FOSSACS2016_comprehensive_parametric_polymorphism_categorical_models_type_theory.pdf - Accepted Author Manuscript

Download (423kB) | Preview


This paper combines reflexive-graph-category structure for relational parametricity with fibrational models of impredicative polymorphism. To achieve this, we modify the definition of fibrational model of impredicative polymorphism by adding one further ingredient to the structure: comprehension in the sense of Lawvere. Our main result is that such comprehensive models, once further endowed with reflexive-graph-category structure, enjoy the expected consequences of parametricity. This is proved using a type-theoretic presentation of the category-theoretic structure, within which the desired consequences of parametricity are derived. The formalisation requires new techniques because equality relations are not available, and standard arguments that exploit equality need to be reworked.