A logic for parametric polymorphism with effects

Authors:
Rasmus Ejlers Møgelberg;Alex Simpson
Affiliations:
LFCS, School of Informatics, University of Edinburgh;LFCS, School of Informatics, University of Edinburgh
Venue:
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Year:
2007

Citing 7
Cited 0

Theorems for free!

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Notions of computation and monads

Information and Computation
A Logic for Parametric Polymorphism

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Call-By-Push-Value: A Functional/Imperative Synthesis (Semantics Structures in Computation, V. 2)

Call-By-Push-Value: A Functional/Imperative Synthesis (Semantics Structures in Computation, V. 2)
Categorical models for Abadi and Plotkin's logic for parametricity

Mathematical Structures in Computer Science
Relational Parametricity for Control Considered as a Computational Effect

Electronic Notes in Theoretical Computer Science (ENTCS)
Relational Parametricity for Computational Effects

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a logic for reasoning about parametric polymorphism in combination with arbitrary computational effects (nondeterminism, exceptions, continuations, side-effects etc.). As examples of reasoning in the logic, we show how to verify correctness of polymorphic type encodings in the presence of effects.