A Fully Abstract Game Semantics for Finite Nondeterminism (1999)

View PDF

Download Links

by Russell Harmer , Guy Mccusker
Venue:In Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, LICS ’99. IEEE Computer
Citations:40 - 4 self

Documents Related by Co-Citation

105 Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions – Samson Abramsky, Guy McCusker - 1997
205 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
218 On Full Abstraction for PCF – M Hyland, L Ong - 2000
215 Games and Full Completeness for Multiplicative Linear Logic – Samson Abramsky, Radha Jagadeesan - 1994
986 Categories for the Working Mathematician – Saunders Mac Lane - 1971
123 A fully abstract games semantics for general references – S Abramsky, K Honda, G McCusker - 1998
2004 Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints – P Cousot, R Cousot - 1977
69 Full Abstraction for Functional Languages with Control – James Laird - 1997
64 Call-by-Value Games – Samson Abramsky, Guy Mccusker - 1997