Kripke Logical Relations and PCF

Download PDF
Open Webpage

Peter W. O'Hearn, Jon G. Riecke

Published: 1995, Last Modified: 16 May 2025Inf. Comput. 1995EveryoneRevisionsBibTeXCC BY-SA 4.0
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 for closed terms of up to third-order 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 λ-definability.