Fully abstract semantics for observably sequential languages (1994)

Cached

Download Links

by Robert Cartwright , Robert Cartwright , Pierre-louis Curien , Pierre-louis Curien , Matthias Felleisen , Matthias Felleisen
Venue:Information and Computation
Citations:47 - 4 self

Documents Related by Co-Citation

83 Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
173 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
363 LCF considered as a programming language – Gordon D Plotkin - 1977
34 On the symmetry of sequentiality – P-L Curien - 1993
174 On full abstraction for pcf – M Hyland, L Ong - 2000
105 A fully abstract game semantics for general references. LICS – Samson Abramsky, Kohei Honda, Guy McCusker - 1998
38 Observable Sequentiality and Full Abstraction – Robert Cartwright, Matthias Felleisen - 1992
46 Games and full abstraction for a functional metalanguage with recursive types. Distinguished Dissertation Series – G McCusker - 1998
91 Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions – Samson Abramsky, Guy McCusker - 1997
52 Full abstraction for sequential languages: The state of the art – G Berry, P Curien, J J Levy
56 Hereditarily Sequential Functionals – Hanno Nickau - 1994
22 Projecting Sequential Algorithms on Strongly Stable Functions – Thomas Ehrhard - 1993
197 Games and Full Completeness for Multiplicative Linear Logic – Samson Abramsky, Radha Jagadeesan - 1994
55 Hypercoherences: A Strongly Stable Model of Linear Logic – Thomas Ehrhard - 1993
47 Sequentiality and strong stability – A Bucciarelli, T Ehrhard - 1991
58 Full Abstraction for Functional Languages with Control – James Laird - 1997
67 A Curry-Howard foundation for functional computation with control – C. -h. L. Ong, C. A. Stewart - 1997
36 The sequentially realizable functionals – John Longley
59 Stable models of typed lambda-calculi – G Berry - 1978