Games and Full Abstraction for the Lazy lambda-calculus (1995)

Cached

Download Links

by Samson Abramsky , Guy Mccusker
Venue:In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science
Citations:133 - 9 self

Active Bibliography

194 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
29 Domains and Denotational Semantics: History, Accomplishments and Open Problems – Marcelo Fiore, Achim Jung, Eugenio Moggi, Peter O'Hearn, Jon Riecke, Giuseppe Rosolini, Ian Stark - 1996
13 A Relational Account of Call-by-Value Sequentiality – Anders B. Sandholm, Jon G. Riecke - 1999
49 Algorithmic Game Semantics – Samson Abramsky - 2001
60 Game Theoretic Analysis Of Call-By-Value Computation – Kohei Honda, NOBUKO YOSHIDA - 1997
Q Lecture Notes on Denotational Semantics – Part Ii, Computer Science Tripos, Dr Marcelo Fiore, C A. M. Pitts, G. Winskel, M. Fiore Contents
1 Theory for Software Verification – David A. Naumann - 2009
9 A Note on Logical Relations Between Semantics and Syntax – Andrew Pitts - 1997
6 Pi-Calculus, Dialogue Games and PCF – J. M. E. Hyland, C. -h. L. Ong - 1995
29 Games and full abstraction for nondeterministic languages – Russell S. Harmer - 1999
External Examiner – Weng Kin Ho, Dr. Martín Escardó - 2006
12 Sequential algorithms and strongly stable functions – Paul-André Melliès - 2003
11 Game Semantics and Subtyping – Juliusz Chroboczek - 1999
4 Axioms for Definability and Full Completeness – Samson Abramsky - 2000
5 Full Abstraction by Translation – Guy Mccusker - 1996
1 The Analysis of Programming Structure – Jon G. Riecke - 1997
Realizability Models for Sequential Computation – John Longley - 1998
457 Domain Theory – Samson Abramsky, Achim Jung - 1994
17 Definability and full abstraction – Pierre-Louis Curien