Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
422349 | Electronic Notes in Theoretical Computer Science | 2014 | 32 Pages |
Abstract
In his seminal paper on “Types, Abstraction and Parametric Polymorphism,” John Reynolds called for homomorphisms to be generalized from functions to relations. He reasoned that such a generalization would allow type-based “abstraction” (representation independence, information hiding, naturality or parametricity) to be captured in a mathematical theory, while accounting for higher-order types. However, after 30 years of research, we do not yet know fully how to do such a generalization. In this article, we explain the problems in doing so, summarize the work carried out so far, and call for a renewed attempt at addressing the problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics