English

Relational Parametricity and Control

Programming Languages 2017-01-11 v2 Logic in Computer Science

Abstract

We study the equational theory of Parigot's second-order λμ-calculus in connection with a call-by-name continuation-passing style (CPS) translation into a fragment of the second-order λ-calculus. It is observed that the relational parametricity on the target calculus induces a natural notion of equivalence on the λμ-terms. On the other hand, the unconstrained relational parametricity on the λμ-calculus turns out to be inconsistent with this CPS semantics. Following these facts, we propose to formulate the relational parametricity on the λμ-calculus in a constrained way, which might be called ``focal parametricity''.

Keywords

Cite

@article{arxiv.cs/0606072,
  title  = {Relational Parametricity and Control},
  author = {Masahito Hasegawa},
  journal= {arXiv preprint arXiv:cs/0606072},
  year   = {2017}
}

Comments

22 pages, for Logical Methods in Computer Science