Kripke Logical Relations and PCF (1995)
| Venue: | Information and Computation |
| Citations: | 31 - 3 self |
BibTeX
@ARTICLE{O'Hearn95kripkelogical,
author = {Peter W. O'Hearn and Jon G. Riecke},
title = {Kripke Logical Relations and PCF},
journal = {Information and Computation},
year = {1995},
volume = {120},
pages = {107--116}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. To appear in Information and Computation. (Accepted, October 1994) Supported by NSF grant CCR-92110829. 1 Introduction The nature of sequential functional computation has fascinated computer scientists ever since Scott remarked on a curious incompleteness phenomenon when he introduced LCF (Logic for Computable Functions) and its continuous function model in 1969 (Scott, 1993). Scott noted that although the functionals definable by terms in PCF---the term language of LCF---admitted a sequential evaluation strategy, there were functions in the model that seemed to require a parallel evaluation strategy. "Sequen...
