Abstract types have existential type
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proofs and types
Theoretical Computer Science - Special issue: Fourth workshop on mathematical foundations of programming semantics, Boulder, CO, May 1988
Behavioural correctness of data representations
Science of Computer Programming
On the equivalence of data representations
Artificial intelligence and mathematical theory of computation
Relational parametricity and local variables
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of logic in computer science (vol. 2)
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
Correctness of data representations in Algol-like languages
A classical mind
Foundations of programming languages
Foundations of programming languages
An axiomatic system of parametricity
Fundamenta Informaticae - Special issue: typed lambda-calculi and applications, selected papers
Verifiable Programming
The Craft of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Information and Computation
Types, Abstractions, and Parametric Polymorphism, Part 2
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
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
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Logic for Parametric Polymorphism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Specification Refinement with System F - The Higher-Order Case
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Outline of a Proof Theory of Parametricity
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Axiomatic criteria for quotients and subobjects for higher-order data types
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.00 |
A concept of relational parametricity is developed taking into account the encapsulation mechanism inherent in universal types. This is then applied to data types and refinement, naturally giving rise to a notion of simulation relations that compose for data types with higherorder operations, and whose existence coincides with observational equivalence. The ideas are developed syntactically in lambda calculus with a relational logic. The new notion of relational parametricity is asserted axiomatically, and a corresponding parametric per-semantics is devised.