Logical Full Abstraction and PCF (1996)

by John Longley , Gordon Plotkin
Venue:Tbilisi Symposium on Language, Logic and Computation. SiLLI/CSLI
Citations:13 - 5 self

Documents Related by Co-Citation

394 LCF considered as a programming language – G D Plotkin - 1977
191 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
39 Observable Sequentiality and Full Abstraction – Robert Cartwright, Matthias Felleisen - 1992
19 When is a Functional Program Not a Functional Program? – John Longley - 1999
32 A Semantic analysis of control – James David Laird - 1998
49 Fully abstract semantics for observably sequential languages – Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen - 1994
13 Logical reasoning for higher-order functions with local state – Nobuko Yoshida, Kohei Honda, Martin Berger
17 Descriptive and relative completeness for logics for higher-order functions – Kohei Honda, Martin Berger, Nobuko Yoshida - 2006
48 A type-theoretical alternative to ISWIM – D S Scott - 1993
76 A Curry-Howard foundation for functional computation with control – C. -h. L. Ong, C. A. Stewart - 1997
197 On full abstraction for PCF – J M E Hyland, C H L Ong
19 A Uniform Approach to Domain Theory in Realizability Models – John R. Longley, Alex K. Simpson - 1996
60 Realizability Toposes and Language Semantics – J Longley - 1994
52 Sequentiality and Strong Stability – A Bucciarelli, T Ehrhard - 1991
25 Finitary PCF is not decidable – Ralph Loader - 1996
36 The sequentially realizable functionals – John Longley
10 SPCF: its model, calculus, and computational power – R Kanneganti, R Cartwright, M Felleisen - 1993
22 Projecting Sequential Algorithms on Strongly Stable Functions – Thomas Ehrhard - 1993
84 Sequential algorithms on concrete data structures, Theor – G Berry, P-L Curien - 1982