On program equivalence in languages with ground-type references

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 108-117

  Murawski, Andrzej S ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CONTEXT FREE LANGUAGES; SET THEORY; THEOREM PROVING; ALGOL (PROGRAMMING LANGUAGE); CALCULATIONS; COMPUTATIONAL LINGUISTICS; COMPUTER GAMES; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; GAME THEORY; LABORATORIES; SEMANTICS;

PROGRAM EQUIVALENCE;

SEMANTICS; CONTEXT FREE LANGUAGES;

CALCULUS; CONTEXT-FREE; GAME SEMANTICS; LOGIC; PROGRAM EQUIVALENCE; RECURSIVELY ENUMERABLE LANGUAGES;

EID: 0041466319     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. S. Abramsky, K. Honda, and G. McCusker. Fully abstract game semantics for general references. In Proceedings of IEEE Symposium on Logic in Computer Science. Computer Society Press, 1998.
2. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Information and Computation, 163:409-470, 2000.
3. S. Abramsky and G. McCusker. Call-by-value games. In Proceedings of CSL, volume 1414 of Lecture Notes in Computer Science, pages 1-17. Springer-Verlag, 1997.
4. S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In P. W. O'Hearn and R. D. Tennent, editors, Algol-like languages. Birkhaüser, 1997.
5. S. Abramsky and G. McCusker. Game semantics. In H. Schwichtenberg and U. Berger, editors, Logic and Computation. Springer-Verlag, 1998. Proceedings of the 1997 Marktoberdorf Summer School.
6. S. Abramsky and G. McCusker. Full abstraction for Idealized Algol with passive expressions. Theoretical Computer Science, 227:3-42, 1999.
7. D. R. Ghica. Regular-language semantics for a call-by-value programming language. In Proceedings of MFPS, volume 45 of Electronic Notes in Computer Science. Elsevier, 2001.
8. D. R. Ghica and G. McCusker. Reasoning about idealized algol using regular expressions. In Proceedings of ICALP, volume 1853 of Lecture Notes in Computer Science, pages 103-115. Springer-Verlag, 2000.
9. K. Honda and N. Yoshida. Game-theoretic analysis of call-by-value computation (extended abstract). In Proceedings of ICALP, volume 1256 of Lecture Notes in Computer Science, pages 225-236. Springer-Verlag, 1997.
10. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
11. J. M. E. Hyland and C.-H. L. Ong. On Full Abstraction for PCF: I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. Information and Computation, 163(2):285-408, 2000.
12. J. Laird. A semantic analysis of control. PhD thesis, University of Edinburgh, 1998.
13. R. Loader. Finitary PCF is not decidable. Theoretical Computer Science, 266(1-2):341-364, 1997.
14. M. L. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, 1967.
15. E. Moggi. Notions of computation and monads. Information and Computation, 93:55-92, 1991.
16. H. Nickau. Hereditarily Sequential Functional: A Game-Theoretic Approach to Sequentiality, PhD thesis, Universität-Gesamthochschule-Siegen, 1996.
17. C.-H. L. Ong. Observational equivalence of 3rd-order Idealized Algol is decidable. In Proceedings of IEEE Symposium on Logic in Computer Science. Computer Society Press, 2002.
18. J. C. Reynolds. The essence of Algol. In J. W. de Bakker and J. van Vliet, editors, Algorithmic Languages, pages 345-372. North Holland, 1978.
19. C. Stirling. Decidability of DPDA equivalence. Theoretical Computer Science, 255:1-31, 2001.