Recursive Types in Games: Axiomatics and Process Representation (Extended Abstract) (1998)

by Marcelo Fiore , Kohei Honda
Venue:IN PROCEEDINGS O.F LICS'98. IEEE COMPUTER
Citations:4 - 1 self

Documents Related by Co-Citation

118 A fully abstract game semantics for general references – S Abramsky, K Honda, G McCusker - 1998
59 Game Theoretic Analysis Of Call-By-Value Computation – Kohei Honda, NOBUKO YOSHIDA - 1997
200 On full abstraction for PCF – J M E Hyland, C H L Ong
62 Full Abstraction for Functional Languages with Control – James Laird - 1997
103 Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions – Samson Abramsky, Guy McCusker - 1997
65 Call-by-Value Games – Samson Abramsky, Guy Mccusker - 1997
45 Game semantics and abstract machines – V Danos, H Herbelin, L Regnier - 1996
3 Innocent Game Models of Untyped λ-Calculus – Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong - 2000
14 Computing with abstract Böhm trees – P-L Curien, H Herbelin - 1998
17 Definability and full abstraction – Pierre-Louis Curien
110 Fully abstract models of typed lambda calculi – R Milner - 1977
363 An Object Calculus for Asynchronous Communication – Kohei Honda, Mario Tokoro - 1991
192 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
76 A Uniform Type Structure for Secure Information Flow – Kohei Honda, Nobuko Yoshida - 2002
86 Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
315 Functions as processes – R Milner - 1990
273 The polyadic -calculus: A tutorial – Robin Milner - 1992
83 Types for Dyadic Interaction – Kohei Honda - 1993
1 Abstract BShm trees – P-L Curten - 1998