Fully abstract semantics for observably sequential languages (1994)

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

Documents Related by Co-Citation

86 Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
192 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
395 LCF considered as a programming language – G Plotkin - 1977
52 Sequentiality and Strong Stability – A Bucciarelli, T Ehrhard - 1991
53 Full Abstraction for sequential languages: the state of the art – G Berry, P-L Curien, J-J Lévy - 1985
200 On full abstraction for PCF – J M E Hyland, C H L Ong
110 Fully abstract models of typed lambda calculi – R Milner - 1977
62 Full Abstraction for Functional Languages with Control – James Laird - 1997
118 A fully abstract game semantics for general references – S Abramsky, K Honda, G McCusker - 1998
39 Observable Sequentiality and Full Abstraction – Robert Cartwright, Matthias Felleisen - 1992
77 A Curry-Howard foundation for functional computation with control – C. -h. L. Ong, C. A. Stewart - 1997
34 On the symmetry of sequentiality – P-L Curien - 1993
49 Games and full abstraction for a functional metalanguage with recursive types – G McCusker - 1996
103 Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions – Samson Abramsky, Guy McCusker - 1997
67 Stable models of typed lambda-calculi – G Berry - 1978
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
267 Semantics of Programming Languages: Structures and Techniques. Foundations of Computing Series – C Gunter - 1992
210 Games and Full Completeness for Multiplicative Linear Logic – Samson Abramsky, Radha Jagadeesan - 1994
57 Recursive functionals and quantifiers of finite types – Stephen C Kleene - 1959