Documents Related by Co-Citation

105 G.: A fully abstract game semantics for general references – S Abramsky, K Honda, McCusker - 1998
197 Games and Full Completeness for Multiplicative Linear Logic – Samson Abramsky, Radha Jagadeesan - 1994
252 Reactive Modules – Rajeev Alur , Thomas A. Henzinger - 1996
173 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
2972 Communication and Concurrency – R Milner - 1989
99 Alternating refinement relations – Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi - 1998
112 A game semantics for linear logic – A Blass - 1992
275 Interface Automata – Luca de Alfaro, Thomas A. Henzinger - 2001
13 Believe it or not, AJM's games model is a model of classical Linear Logic – Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier, Iml-cnrs Marseille, Iml-cnrs Marseille - 1997
91 Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions – Samson Abramsky, Guy McCusker - 1997
325 Proofs and Types – J-Y Girard, Y Lafont, P Taylor - 1989
3119 Communicating Sequential Processes – C. A. R. Hoare - 2004
363 LCF considered as a programming language – G D Plotkin - 1977
1312 A Discipline of Programming – Edsger Dijkstra - 1976
9 A Type-theoretic Approach to Deadlock-freedom of Asynchronous Systems – Samson Abramsky, Simon Gay, Rajagopal Nagarajan - 1997
5 in the semantics of programming languages – Games - 1997
1659 A theory of timed automata – Rajeev Alur - 1999
76 Categories for types – R L Crole - 1993
26 Game models for open systems – Luca De Alfaro - 2004