Kripke logical relations and PCF
From MaRDI portal
Publication:1898483
DOI10.1006/INCO.1995.1103zbMath0912.03008OpenAlexW1965557765WikidataQ56092885 ScholiaQ56092885MaRDI QIDQ1898483
Peter W. O'Hearn, Jon G. Riecke
Publication date: 11 May 1999
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://surface.syr.edu/cgi/viewcontent.cgi?article=1002&context=lcsmith_other
Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30) Combinatory logic and lambda calculus (03B40)
Related Items (17)
Full abstraction for the second order subset of an Algol-like language ⋮ Game-theoretic analysis of call-by-value computation ⋮ Program equivalence in a simple language with state ⋮ Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases ⋮ On phase semantics and denotational semantics in multiplicative-additive linear logic ⋮ A characterization of lambda definability in categorical models of implicit polymorphism ⋮ Cryptographic logical relations ⋮ On phase semantics and denotational semantics: The exponentials ⋮ A stable programming language ⋮ A relational account of call-by-value sequentiality ⋮ Finitary PCF is not decidable ⋮ The sequentially realizable functionals ⋮ Games and full abstraction for FPC. ⋮ Full abstraction for PCF ⋮ Prelogical relations ⋮ Definability and Full Abstraction ⋮ Relative definability of boolean functions via hypergraphs
This page was built for publication: Kripke logical relations and PCF
