Abstract for "Kripke Logical Relations and PCF"
Kripke Logical Relations and PCF
Peter W. O'Hearn and Jon G. Riecke. Appeared in Information and Computation, 120(1), pages 107-116, July 1995.

Abstract: Sieber has described a model of PCF consisting of continuous functions that are invariant under certain (finitary) logical relations, and shown that it is fully abstract up to rank three types. We show that one may achieve full abstraction at all types using a form of ``Kripke logical relations'' introduced by Jung and Tiuryn to characterize lambda-definability.