Abstract types have existential type
ACM Transactions on Programming Languages and Systems (TOPLAS)
A relational approach to strictness analysis for higher-order polymorphic functions
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
Parametricity and local variables
Journal of the ACM (JACM)
The Craft of Programming
Automata, Languages, and Machines
Automata, Languages, and Machines
Fundamental Concepts in Programming Languages
Higher-Order and Symbolic Computation
An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
A New Characterization of Lambda Definability
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Logic for Parametric Polymorphism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
CSL '92 Selected Papers from the Workshop on Computer Science Logic
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Categorical models for Abadi and Plotkin's logic for parametricity
Mathematical Structures in Computer Science
Theoretical Computer Science
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
A categorical outlook on relational modalities and simulations
Information and Computation
Foundations of Algebraic Specification and Formal Software Development
Foundations of Algebraic Specification and Formal Software Development
| Hi-index | 0.00 |
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.