Non-trivial power types can't be subtypes of polymorphic types
Proceedings of the Fourth Annual Symposium on Logic in computer science
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Foundations of programming languages
Foundations of programming languages
An axiomatic system of parametricity
Fundamenta Informaticae - Special issue: typed lambda-calculi and applications, selected papers
Types, Abstractions, and Parametric Polymorphism, Part 2
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
A Logic for Parametric Polymorphism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Polymorphism is Set Theoretic, Constructively
Category Theory and Computer Science
Parametricity as a notion of uniformity in reflexive graphs
Parametricity as a notion of uniformity in reflexive graphs
Theoretical Computer Science - Logic, semantics and theory of programming
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Relational Parametricity for Control Considered as a Computational Effect
Electronic Notes in Theoretical Computer Science (ENTCS)
A fibrational framework for possible-world semantics of Algol-like languages
Theoretical Computer Science
Relational parametricity for references and recursive types
Proceedings of the 4th international workshop on Types in language design and implementation
Extensional Universal Types for Call-by-Value
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
HasCasl: Integrated higher-order specification and program development
Theoretical Computer Science
From parametric polymorphism to models of polymorphic fpc
Mathematical Structures in Computer Science
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational parametricity and separation logic
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Bootstrapping types and cotypes in HASCASL
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A logic for parametric polymorphism with effects
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Interpreting polymorphic FPC into domain theoretic models of parametric polymorphism
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We propose a new category-theoretic formulation of relational parametricity based on a logic for reasoning about parametricity given by Abadi and Plotkin (Plotkin & Abadi 1993). The logic can be used to reason about parametric models, such that we may prove consequences of parametricity that to our knowledge have not been proved before for existing category-theoretic notions of relational parametricity. We provide examples of parametric models and describe a way of constructing parametric models from given models of the second-order lambda calculus.