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

View PDF

Download Links

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

Active Bibliography

205 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
30 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
481 Domain Theory – Samson Abramsky, Achim Jung - 1994
13 A Relational Account of Call-by-Value Sequentiality – Anders B. Sandholm, Jon G. Riecke - 1999
54 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
561 Composing Specifications – Martín Abadi, Leslie Lamport - 1993
828 A calculus for cryptographic protocols: The spi calculus – Martin Abadi, Andrew D. Gordon - 1999