Bibliography

1

S. Abramsky.
Algorithmic game semantics: a tutorial introduction.
To appear in Proceedings of 2001 Marktoberdorf International Summer School, 2002.

2

S. Abramsky, K. Honda, and G. McCusker.
Fully abstract game semantics for general reference.
In Proceedings of IEEE Symposium on Logic in Computer Science, 1998. Computer Society Press, 1998.

3

S. Abramsky, R. Jagadeesan, and P. Malacaria.
Full abstraction for PCF.
Information and Computation, 163, 2000.

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

E. M. Clarke, O. Grumberg, and D. Peled.
Model Checking.
MIT Press, 1999.

6

V. Danos and R. Harmer.
Probabilistic game semantics.
In Proc. IEEE Symposium on Logic in Computer Science, Santa Barbara, June, 2000. Computer Science Society, 2000.

7

D. R. Ghica and G. McCusker.
Reasoning about Idealized Algol using regular languages.
In Proceedings of 27th International Colloquium on Automata, Languages and Programming ICALP 2000, pages 103-116. Springer-Verlag, 2000.
LNCS Vol. 1853.

8

S. Ginsberg and S. Greibach.
Deterministic context-free languages.
Information and Control, pages 620-648, 1966.

9

R. Harmer and G. McCusker.
A fully abstract game semantics for finite nondeterminism.
In Proceedings of Fourteenth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1999.

10

D. H. D. Hughes.
Games and definability for System F.
In Proceedings of 12th IEEE Symposium on Logic in Computer Science. IEEE Computer Science Society, 1997.

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:285-408, 2000.

12

A. D. Ker, H. Nickau, and C.-H. L. Ong.
A universal innocent game model for the Böhm tree lambda theory.
In Computer Science Logic: Proceedings of the 8th Annual Conference on the EACSL Madrid, Spain, September 1999, pages 405 - 419. Springer-Verlag, 1999.
LNCS Volume 1683.

13

A. D. Ker, H. Nickau, and C.-H. L. Ong.
Innocent game models of untyped $\lambda$-calculus.
Theoretical Computer Science, 272:247-292, 2002.

14

J. Laird.
A semantic analysis of control.
PhD thesis, University of Edinburgh, 1998.

15

A. Murawski.
Finitary higher-order programming languages with first-order references are undecidable.
Preprint, 2002.

16

C.-H. L. Ong.
Observational equivalence of third-order Idealized Algol is decidable.
In Proceedings of IEEE Symposium on Logic in Computer Science, 22-25 July 200, Copenhagen Denmark, pages 245-256. Computer Society Press, 2002.

17

J. C. Reynolds.
The essence of Algol.
In J. W. de Bakker and J. C. van Vliet, editors, Algorithmic Languages, pages 345-372. North Holland, 1978.

18

D. A. Schmidt.
On the need for a popular formal semantics.
ACM SIGPLAN Notices, 32:115-116, 1997.

19

G. Sénizergues.
$L(A) = L(B)$? Decidability results from complete formal systems.
Theoretical Computer Science, 251:1-166, 2001.

20

C. Stirling.
Decidability of DPDA equivalence.
Theoretical Computer Science, 255:1-31, 2001.

21

M. Y. Vardi.
An automata-theoretic approach to linear temporal logic.
In Banff Higher Order Workshop, pages 238-266. Springer-Verlag, 1995.