Processes and games

Electronic Notes in Theoretical Computer Science

Volumn 71, Issue , 2004, Pages 40-69

  Honda, Kohei ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Game semantics; Typed calculus

Indexed keywords

ALGEBRA; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; DIFFERENTIATION (CALCULUS); ENGINEERING EDUCATION; MATHEMATICAL MODELS; SEMANTICS; SET THEORY; THEOREM PROVING;

COMPUTING SYSTEMS; GAME SEMANTICS; PROCESSES MODULO; TYPED Π-CALCULUS;

GAME THEORY;

EID: 19044383161     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82528-9     Document Type: Conference Paper

References (47)

1. Abramsky S., Jagadeesan R., Malacaria P. Full Abstraction for PCF. Info. & Comp. 163:2000;409-470
2. Abramsky S., Honda K., McCusker G. A Fully Abstract Game Semantics for General References. LICS. 1998;334-344 IEEE
3. Abramsky S., McCusker G. Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions. ENTCS. 3:1996;North Holland
4. Baeten J.C.M., Weijland W.P. Process Algebra. 1990;Cambridge University Press
5. Berger M, Honda K, Yoshida N. Sequentiality and the π-Calculus, TLCA01. LNCS 2044. 2001;29-45 Springer
6. Berger M., Honda K., Yoshida N. Genericity and the π-Calculus, FoSSacs03. LNCS. 2003;Springer
7. Berry G., Curien P.L. Sequential algorithms on concrete data structures. TCS. 20:1982;265-321 North-Holland. (3)
8. Curien P.L. Sequentiality and full abstraction. Proc. of Application of Categories in Computer Science. LNM 177. 1995;86-94 Cambridge Press
9. Curien P.L. Abstract Böhm Trees. Mathematical Structure of Computer Science. 8:(6):1998
10. Curien P.L., Herbelin H. Computing with Abstract Böhm Trees. Proc. Of Third International Symposium on Functional and Logic Programming. 1998;World Scientific
11. Fiore M., Honda K. Recursive Types in Games: axiomatics and process representation. LICS′98. 1998;345-356 IEEE
12. F. Gadducci, U. Montanari. The Tile Model. Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press.
13. Di Gianantonio P., Franco G., Honsell F. Game semantics for untyped λ-calculus. 1998;LNCS
14. Girard J.-Y. Linear Logic. TCS. 50:1987;1-102
15. Hoare C.A.R. Communicating Sequential Processes. 1985;Prentice Hall
16. Hoare C.A.R. Unified Theories of Programming. 1994;58 Computing Laboratory, Oxford University
17. Honda K. Types for Dyadic Interaction. CONCUR′93. 715:1993;509-523 LNCS
18. Honda K. Composing Processes. POPL′96. 1996;344-357 ACM
19. K. Honda. A Theory of Types for the π-calculus. Typescript, 113 pp, October, 1999. Available from: http://www.dcs.qmw.ac.uk/~kohei/.
20. Honda K. Elementary Structures for Process Theory (1): Sets with Renaming. 2001;MSCS
21. Honda K., Tokoro M. An object calculus for asynchronous communication. ECOOP′91. 512:1991;133-147 LNCS
22. Honda K., Yoshida N. Game-theoretic analysis of call-by-value computation. Proc. ICALP′97, Proceedings of 24th International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science. 1256:July 1997;225-236 Springer-Verlag
23. Honda K., Yoshida N. A uniform type structure for secure information flow. POPL′02. 2002;ACM
24. Hyland M., Ong L. "On Full Abstraction for PCF": I, II and III. Info. & Comp. 163:2000;285-408
25. Hyland M., Ong L. Pi-calculus, dialogue games and PCF. FPCA′95. 1995;ACM
26. Jensen O., Milner R. Bigraphs and Transistions. POPL′03. 2003;ACM
27. Kahn G., Plotkin G. Concrete Domains. Theoretical Computer Science. 1993;. (originally appeared as report 338 of Inria-Laboria, 1978).
28. Ker A.D., Nickau H., Ong L. Innocent game models of untyped lambda calculus. Theoretical Computer Science. 272:2002;247-292
29. Kobayashi N., Pierce B., Turner D. Linear Types and π-calculus. POPL′96. 1996;358-371 ACM Press
30. Laird J. Full abstraction for functional languages with control. LICS′97. 1997;IEEE
31. Laurent O. Polarized games. LICS 2002. 2002;265-274 IEEE
32. McCusker G. Games and Full Abstraction for a Functional Metalanguage with Recursive Types. Ph.D.thesis. 1998;Imperial College
33. Meseguer J. Research Directions in Rewriting Logic. Computational Logic. NATO Advanced Study Institute Series F. 165:1999;345-398 Springer-Verlag
34. Milner R. Fully abstract models of typed lambda calculi. TCS. 4:1977;1-22
35. Milner R. A Calculus of Communicating Systems LNCS 92. 1980;Springer, Berlin
36. Milner R. Functions as Processes. MSCS. 2(2):1992;119-146 CUP
37. Milner R. Polyadic π-Calculus: a tutorial. Proceedings of the International Summer School on Logic Algebra of Specification. 1992;Marktoberdorf
38. Milner R. Address at Bologna on receiving Honorary Degree from the University of Bologna. 1997
39. Milner R. Bigraphical reactive systems: basic theory. Computer Laboratory Technical Report No. 523. 2002;University Cambridge
40. Milner R., Parrow J., Walker D. A Calculus of Mobile Processes. Info. & Comp. 100:(1):1992;1-77
41. Nickau M. Hereditarily Sequential Functionals. LNCS 813. 1994;253-264 Springer-Verlag
42. L. Ong. Correspondence between operational and denotational semantics. Handbook of Logic in Computer Science, Vol 4, pp. 269-356, Oxford University Press.
43. Pierce B., Sangiorgi D. Typing and subtyping for mobile processes. MSCS. 6:(5):1996;409-453
44. Plotkin G.D. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science. 1:1975;125-159
45. Scott D., Strachey C. Towards a Mathematical Semantics for Computer Languages. Computers and Automata. 1971;19-46 Polytechnic Institute of Brooklyn Press
46. N. Yoshida, M. Berger, K. Honda. Strong Normalisation in the π-Calculus, LICS′01, IEEE, 2001. The full version as MCS technical report, 2001-09, University of Leicester, 2001. Available at www.mcs.le.ac.uk/~nyoshida.
47. Yoshida N., Honda K., Berger M. Linearity and Bisimulation. Proc. Of 5th International Conference, Foundations of Software Science and Computer Structures (FoSSaCs 2002). LNCS 2303. 2002;417-433 Springer