Abstract

We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a #-calculus with recursive types and impredicative universal and existential types. Our development builds on the step-indexed PER model of recursive types presented by Appel and McAllester. We have discovered that a direct proof of transitivity of that model does not go through, leaving the "PER" status of the model in question. We show how to extend the Appel-McAllester model to obtain a logical relation that we can prove is transitive, as well as sound and complete with respect to contextual equivalence. We then augment this model to support relational reasoning in the presence of quantified types.

Citations

221	Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII - Girard - 1972
190	Intentional Interpretations of Functionals of Finite Type I - Tait - 1967
92	Relational properties of domains - Pitts - 1996
72	Parametric polymorphism and operational equivalence - Pitts - 2000
34	Lambda-definability and logical relations. Memorandum SAIRM-4 - Plotkin - 1973
31	Existential types: Logical relations and operational equivalence - Pitts - 1998
21	Logical Relations and the Typed λ-calculus - Statman - 1985