The regular-language semantics of second-order idealized ALGOL

Theoretical Computer Science

Volumn 309, Issue 1-3, 2003, Pages 469-502

  Ghica, Dan R ^a   McCusker, Guy ^b  

^a QUEEN S UNIVERSITY   (Canada)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

ALGOL like languages; Game semantics; Regular languages

Indexed keywords

ALGOL (PROGRAMMING LANGUAGE); AUTOMATION; COMPUTABILITY AND DECIDABILITY; GAME THEORY; MATHEMATICAL MODELS; SET THEORY;

GAME SEMANTICS;

SEMANTICS;

EID: 0242523914     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00315-3     Document Type: Article

References (36)

1. S. Abramsky, G. McCusker, Linearity, sharing and state: a fully abstract game semantics for idealized Algol with active expressions (extended abstract), in: Proc. of 1996 Workshop on Linear Logic, Vol. 3, Electronic notes in Theoretical Computer Science, Elsevier, Amsterdam, 1996 (also as Chap. 20 of [22]).
2. S. Abramsky, G. McCusker, Game semantics, Lecture Notes, Marktoberdorf summer school, 1997 (available from http://web.comlab.ox.ac.uk/oucl/work/samson.abramsky/mdorf97.ps.gz ).
3. S. Brookes, Full abstraction for a shared variable parallel language, in: Proc. 8th Annual IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, Montreal, Canada, 1993, pp. 98-109 (published also as Chap. 21 of [22]).
4. Bruijn N. Lambda calculus notation with namefree formulas involving symbols that represent reference transforming mappings. Indag. Math. 40(3):1979;348-356.
5. D.R. Ghica, A regular-language model for Hoare-style correctness statements, in: Proc. of the Verification and Computational Logic 2001 Workshop, Florence, Italy, 2001.
6. D.R. Ghica, Regular language semantics for a call-by-value programming language, in: Proc. of the 17th Annual Conf. on Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science, Elsevier, Aarhus, Denmark, 2001, pp. 85-98.
7. D.R. Ghica, A games-based foundation for compositional software model checking, Ph.D. Thesis, Queen's University School of Computing, Kingston, Ontario, Canada; also available as Oxford University Computing Laboratory Research Report RR-02-13, November 2002.
8. D.R. Ghica, A games-based foundation for compositional software model checking, Ph.D. Thesis, Queen's University School of Computing, Kingston, Ontario, Canada; also available as Oxford University Computing Laboratory Research Report RR-02-13, November 2002.
9. D.R. Ghica, G. McCusker, Reasoning about Idealized ALGOL using regular languages, in: Proc. of 27th Internat. Coll. on Automata, Languages and Programming ICALP 2000, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, pp. 103-116.
10. C. Hankin, P. Malacaria, Generalised flowcharts and games, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998.
11. C. Hankin, P. Malacaria, A new approach to control flow analysis, Lecture Notes in Computer Science, Vol. 1383, Springer, Berlin, 1998.
12. D. Harel, First-order dynamic logic, Lecture Notes in Computer Science, Vol. 68, Springer, New York, NY, USA, 1979 (rev. version of the author's thesis, MIT, 1978).
13. R. Harmer, G. McCusker, A fully abstract game semantics for finite nondeterminism, in: 14th Symp. on Logic in Computer Science (LICS'99), IEEE, Washington, Brussels, Tokyo, 1999, pp. 422-430.
14. Jantzen M. Extending regular expressions with iterated shuffle. Theoret. Comput. Sci. 38(2-3):1985;223-247.
15. Jones N.D., Muchnick S.S. Even simple programs are hard to analyze. J. Assoc. Comput. Mach. 24(2):1977;338-350.
16. McCusker G. Games and Full Abstraction for a Functional Metalanguage with Recursive Types, Distinguished Dissertations. 1998;Springer, Berlin.
17. A.R. Meyer, K. Sieber, Towards fully abstract semantics for local variables: preliminary report, in: Conf. Record of the 15th Annual ACM Symp. on Principles of Programming Languages, ACM, New York, San Diego, CA, 1988, pp. 191-203 (reprinted as Chap. 7 of [22]).
18. A. Murawski, On program equivalence in languages with ground-type references, in: Proc. of IEEE Symp. on Logic in Computer Science, 2003, to appear.
19. O'Hearn P.W., Power A.J., Takeyama M., Tennent R.D. Syntactic control of interference revisited. Theoret. Comput. Sci. 228:1999;175-210. (preliminary version reprinted as Chap. 18 of [22]).
20. P.W. O'Hearn, U.S. Reddy, Objects, interference and the Yoneda embedding, in: S. Brookes, M. Main, A. Melton, M. Mislove (Eds.), Mathematical Foundations of Programming Semantics, 11th Annual Conference, Electronic Notes in Theoretical Computer Science, Vol. 1, Elsevier Science, Tulane University, New Orleans, Louisiana, 1995.
21. O'Hearn P.W., Reynolds J.C. From Algol to polymorphic linear lambda-calculus. J. Assoc. Comput. Mach. 47(1):2000;167-223.
22. P.W. O'Hearn, R.D. Tennent, Relational parametricity and local variables, in: Conf. Record of the 20th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, ACM, New York, Charleston, South Carolina, 1993, pp. 171-184 (a version also published as Chap. 16 of [22]).
23. P.W. O'Hearn, R.D. Tennent (Eds.), ALGOL-like Languages, Progress in Theoretical Computer Science, Birkhäuser, Boston, 1997, two volumes.
24. F.J. Oles, A category-theoretic approach to the semantics of programming languages, Ph.D. Thesis, Syracuse University, Syracuse, NY, 1982.
25. F.J. Oles, Functor categories and store shapes, in: P.W. O'Hearn, R.D. Tennent (Eds.), ALGOL-like Languages, Progress in Theoretical Computer Science, Birkhäuser, Boston, 1997, Chap. 11, pp. 3-12.
26. C.-H.L. Ong, Observational equivalence of third-order idealized Algol is decidable, in: Proc. of IEEE Symp. on Logic in Comp. Science, 2002, pp. 245-256.
27. A.M. Pitts, Reasoning about local variables with operationally-based logical relations, in: 11th Annual Symp. on Logic in Computer Science, IEEE Computer Society Press, Washington, 1996, pp. 152-163 (a version also published as Chap. 17 of [22]).
28. Reddy U.S. Global state considered unnecessary. introduction to object-based semantics LISP Symbolic Comput. 9(1):1996;7-76. (published also as Chap. 19 of [22]).
29. J.C. Reynolds, Syntactic control of interference, in: Conf. Record of the 5th Annual ACM Symp. on Principles of Programming Languages, ACM, New York, Tucson, Arizona, 1978, pp. 39-46.
30. J.C. Reynolds, The essence of ALGOL, in: J.W. de Bakker, J.C. van Vliet (Eds.), Algorithmic Languages, Proc. Internat. Symp. on Algorithmic Languages, North-Holland, Amsterdam, 1981, pp. 345-372 (reprinted as Chap. 3 of [22]).
31. Reynolds J.C. The Craft of Programming. 1981;Prentice-Hall International, London.
32. Reynolds J.C. Theories of Programming Languages. 1998;Cambridge University Press, Cambridge, MA.
33. Schmidt D.A. On the need for a popular formal semantics. ACM SIGPLAN Notices. 32(1):1997;115-116.
34. D.S. Scott, C. Strachey, Toward a mathematical semantics for computer languages, in: J. Fox (Ed.), Proc. of the Symp. on Computers and Automata, Microwave Research Institute Symposia Series, Vol. 21, Polytechnic Institute of Brooklyn Press, New York, 1971, pp. 19-46; also Technical Monograph PRG-6, Oxford University Computing Laboratory, Programming Research Group, Oxford.
35. D.S. Scott, C. Strachey, Toward a mathematical semantics for computer languages, in: J. Fox (Ed.), Proc. of the Symp. on Computers and Automata, Microwave Research Institute Symposia Series, Vol. 21, Polytechnic Institute of Brooklyn Press, New York, 1971, pp. 19-46; also Technical Monograph PRG-6, Oxford University Computing Laboratory, Programming Research Group, Oxford.
36. K. Sieber, Full abstraction for the second order subset of an ALGOL-like language, in: Mathematical Foundations of Computer Science, Vol. 841, Lecture Notes in Computer Science, Springer, Berlin, Kǒsice, Slovakia, 1994, pp. 608-617 (a version also published as Chap. 15 of [22]).