Bad variables under control

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4646 LNCS, Issue , 2007, Pages 558-572

  Murawski, Andrzej S ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CONTROL THEORY; MATHEMATICAL MODELS; SEMANTICS;

GAME SEMANTICS; NONDETERMINISTIC VARIANTS; OBSERVATIONAL EQUIVALENCE; PROBABILISTIC VARIANTS;

GAME THEORY;

EID: 38049091061     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74915-8_41     Document Type: Conference Paper

References (16)

1. Reynolds, J.C.: The essence of Algol. In: de Bakker, J.W., van Vliet, J. (eds.) Algorithmic Languages, pp. 345-372. North Holland, Amsterdam (1978)
2. O'Hearn, P.W., Tennent, R.D. (eds.).: Algol-like Languages. Progress in Theoretical Computer Science. Birkhäuser, Boston (1997) (Two volumes)
3. Reddy, U.S.: Global state considered unnecessary: An introduction to object-based semantics. Lisp and Symbolic Computation 9, 7-76 (1996)
4. Abramsky, S., McCusker, G.: Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In: O'Hearn, P.W., Tennent, R.D. (eds.) Algol-like languages, Birkhaüser, pp. 297-329 (1997)
5. Burstall, R.M., Popplestone, R.J.: Pop-2 reference manual. Machine Intelligence 2, 205-246 (1968)
6. Reynolds, J.C.: GEDANKEN-A simple typeless language based on principle of completeness and reference concept. CACM 13, 308-319 (1970)
7. McCusker, G.: On the semantics of Idealized Algol without the bad-variable constructor. In: Proceedings of MFPS'03, ENTCS 83,
8. Cartwright, R., Felleisen, M.: Observable sequentiality and full abstraction (preliminary version). In: Proceedings of POPL'92
9. Laird, J.: Full abstraction for functional languages with control. In: Proceedings of LICS'97
10. Abramsky, S., Ghica, D.R., Murawski, A.S., Ong, C.H.L., Stark, I.D.B.: Nominal games and full abstraction for the nu-calculus. In: Proceedings of LICS'04
11. Laird, J.: A game semantics of local names and good variables. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, Springer, Heidelberg (2004)
12. Abramsky, S., McCusker, G.: Game semantics. In: Schwichtenberg, H., Berger, U. (eds.) Logic and Computation. Proceedings of the 1997 Marktoberdorf Summer School, Springer, Heidelberg (1998)
13. Hyland, J.M.E., Ong, C.H.L.: On Full Abstraction for PCF. Information and Computation 163(2), 285-408 (2000)
14. Harmer, R., McCusker, G.: A fully abstract game semantics for finite nondeterminism. In: Proceedings of LICS'99
15. Danos, V., Harmer, R.: Probabilistic game semantics. In: Proceedings of LICS'00
16. Murawski, A.S., Ouaknine, J.: On probabilistic program equivalence and refinement. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, Springer, Heidelberg (2005)