Isolating side effects in sequential languages
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametricity and local variables
Journal of the ACM (JACM)
Monadic state: axiomatization and type safety
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Higher-Order and Symbolic Computation
Reasoning about Idealized ALGOL Using Regular Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
A fibrational framework for possible-world semantics of Algol-like languages
Theoretical Computer Science
Category Theoretic Semantics for Typed Binding Signatures with Recursion
Fundamenta Informaticae - Logic for Pragmatics
Axiomatic criteria for quotients and subobjects for higher-order data types
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Abstraction barrier-observing relational parametricity
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Category Theoretic Semantics for Typed Binding Signatures with Recursion
Fundamenta Informaticae - Logic for Pragmatics
A Semantics For Evaluation Logic
Fundamenta Informaticae
| Hi-index | 0.00 |
J. C. Reynolds suggested that Strachey's intuitive concept of “parametric” (i.e., uniform) polymorphism is closely linked to representation independence, and used logical relations to formalize this principle in languages with type variables and user-defined types. Here, we use relational parametricity to address long-standing problems with the semantics of local-variable declarations, by showing that interactions between local and non-local entities satisfy certain relational criteria.The new model is based on a cartesian closed category of “relation-preserving” functors and natural transformations which is induced by a suitable category of “possible worlds” with relations assigned to its objects and morphisms. The semantic interpretation supports straightforward validations of all the test equivalences that have been proposed in the literature, and encompasses standard methods of reasoning about data representations; however, it is not known whether it is fully abstract.