Documents Related by Co-Citation

118 A fully abstract game semantics for general references – S Abramsky, K Honda, G McCusker - 1998
210 Games and Full Completeness for Multiplicative Linear Logic – Samson Abramsky, Radha Jagadeesan - 1994
192 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
3219 Communication and Concurrency – R Milner - 1990
276 Reactive Modules – Rajeev Alur , Thomas A. Henzinger - 1996
123 Alternating refinement relations – Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi - 1998
131 A game semantics for linear logic – A Blass
333 Interface Automata – Luca de Alfaro, Thomas A. Henzinger - 2001
14 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
103 Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions – Samson Abramsky, Guy McCusker - 1997
3407 Communicating Sequential Processes – C. A. R. Hoare - 2004
353 Proofs and Types – Jean-Yves Girard, Yves Lafont, Paul Taylor - 1989
658 Concurrency and automata on infinite sequences – D Park - 1981
395 LCF considered as a programming language – G Plotkin - 1977
1404 A Discipline of Programming – E W 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
1975 A theory of timed automata – Rajeev Alur - 1999
80 Categories for Types – R Crole - 1993