The sequentially realizable functionals

by John Longley
Citations:36 - 9 self

Documents Related by Co-Citation

49 Fully abstract semantics for observably sequential languages – Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen - 1994
39 Observable Sequentiality and Full Abstraction – Robert Cartwright, Matthias Felleisen - 1992
192 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
52 Sequentiality and Strong Stability – A Bucciarelli, T Ehrhard - 1991
395 LCF considered as a programming language – G Plotkin - 1977
60 Realizability Toposes and Language Semantics – J Longley - 1994
21 A Combinatory Algebra for Sequential Functionals of Finite Type – Jaap Van Oosten - 1997
34 On the symmetry of sequentiality – P-L Curien - 1993
59 Hereditarily Sequential Functionals – Hanno Nickau - 1994
200 On full abstraction for PCF – J M E Hyland, C H L Ong
86 Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
22 Projecting Sequential Algorithms on Strongly Stable Functions – Thomas Ehrhard - 1993
32 A Semantic analysis of control – James David Laird - 1998
118 A fully abstract game semantics for general references – S Abramsky, K Honda, G McCusker - 1998
17 Matching typed and untyped realizability – J Longley - 1999
48 A type-theoretical alternative to ISWIM – D S Scott - 1993
59 Hypercoherences: A Strongly Stable Model of Linear Logic – Thomas Ehrhard - 1993
60 Post-graduate lecture notes in advanced domain theory, incorporating the “pisa notes – G S Plotkin - 1981
25 Finitary PCF is not decidable – Ralph Loader - 1996