Game theoretic analysis of call-by-value computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 226-236

  Honda, Kohei ^a   Yoshida, Nobuko ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; SEMANTICS;

ALGEBRAIC STRUCTURES; DOMAIN THEORY; FULL ABSTRACTION; GAME SEMANTICS; GAME THEORETIC ANALYSIS; INFORMATION FLOWS; TYPE STRUCTURES; VALUE EVALUATIONS;

GAME THEORY;

EID: 84951029697     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_180     Document Type: Conference Paper

References (42)

1. Abelson, H., Sussman, G.J., Structure and Interpretation of Computer Program, MIT Press, 1985.
2. Abramsky, S. and Jagadeesan, R„ Games and Full Completeness for Multiplicative Linear Logic, Journal of Symbolic Logic, 59(2), pp. 543-574, 1994.
3. Abramsky, S., Jagadeesan, R. and Malacaria, P., Full Abstraction for PCF, 1994. To appear.
4. Abramsky, S. and McCusker, G., Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions, ENTCS, Vol.3, North Holland, 1996.
5. Abramsky, S. and McCusker, G., Call-by-value games, a typescript, 12p, Apr. 1997.
6. Berry, G. and Curien, P. L., Sequential algorithms on concrete data structures. PCS Vol.20, pp.265-321, North-Holland, 1982.
7. Blass, A., A game semantics for linear logic, Annuals of Pure and Applied Logic, 56:183-220,1992.
8. Curien, P. L., Sequentially and full abstraction. In Proc. of Application of Categories in Computer Science, LNM 177, pp.86-94, Cambridge Press, 1995.
9. Danos, V. and Regnier, L„ Games and abstract machines. LICS'96, IEEE, 1994.
10. Felshcer, W., Dialogue games as a foundation for intuitionistic logic, Handbook of Philosophical logic, Vol.3, pp.341-372, D. Reidel Publishing Company, 1986.
11. Fiore, M., Axiomatic Domain Theory in Category of Partial Maps, PhD thesis, ECS-LFCS-94-307, Univ. of Edinburgh, 1994.
12. Fiore, M. and Plotkin, G., An Axiomatisation of Computationally Adequate Domain Theoretic Models of FPC. LICS'94, pp.92-102, IEEE, 1994.
13. Freyd, P., Algebraically Complete Categories, In Proc. of Como, Category Theory Conference, LNM 1488, pp.95-104, Springer Verlag, 1991.
14. Girard, J.-Y., Linear Logic, TCS, Vol.50, pp.1-102, North-Holland, 1987.
15. Gunter, C, Semantics of Programming Languages: Structures and Techniques, MIT Press, 1992.
16. Harmer R., Malacaria P., Linear foundations of game semantics, a typescript, Sep. 1996.
17. Honda K., Yoshida N., Name-Passing Games: a functional universe, a typescript. 35p, Nov. 1996.
18. Honda, K. and Yoshida, N., Game-theoretic Analysis of Call-by-value Computation (full version of this paper), ftp-able at ftp.dcs.ed.ac.nk/export/kohei/cbvfull.ps.gz, Feb, 1997
19. Hyland, M. and Ong, L., On Full Abstraction for PCF: I, II and III, 130 pages, ftp-able at theory. 1994.
20. Hyland M. and Ong L., Pi-calculus, dialogue games and PCF, FPCA '93, ACM, 1995.
21. Laird, J.. Full abstraction for functional languages with control, LICS'97, ieee, 1997.
22. Kahn, g. and Plotkin, D., Domaines Concrets. INRIA Report 336,1978.
23. Longo, g. and Moggi, e., Cartesian closed categories of enumarations for effective type-structures, LNCS 173, Springer-Varlag, 1984.
24. McCusker, g., Games and Full Abstraction for FPC. LICS'96, IEEE, 1996.
25. Milner, R., Fully abstract models of typed lambda calculi. TCS, Vol.4, 1-22, North-Holland, 1977.
26. Milner, R., A Calculus of Communicating Systems, LNCS 76, Springer-Vertag, 1980.
27. Milner, R, Functions as Processes. MSGS, 2(2), pp.119-146,1992.
28. Milner, R., Sorts and Types of ?r-Calculus, a manuscript, 43pp, 1990.
29. Milner, R., Polyadic ir-Calculus: a tutorial. Proceedings of the International Summer School on Logic Algebra of Specification, Marktoberdorf, 1992.
30. Milner, R., Tofte, M. and Harper, R., The Definition of Standard ML, MIT Press, 1990.
31. Moggi, e., Partial morphisms in categories of effective objects, Info.&Comp., 76:250-277,1988.
32. Moggi, e., Notions of Computations and Monads. Info.&Comp., 93(l):55-92,1991
33. Nickau M., Hereditarily Sequential Functionals, LNCS 813, pp.253-264, Springer-Verlag, 1994.
34. Ong, L., Correspondence between Operational Semantics and Denotational Semantics, Handbook of Logic in Computer Science, Vol.4, pp.269-356, Oxford University Press, 1995.
35. Plotkin G., LCF considered as a programming language, TCS, 5:223-255, North-Holland, 1975.
36. Plotkin, g., Lecture on Predomains and Partial Functions. Notes for a course given at the Center for the Stuy of Language and Information, Stanford, 1985.
37. Power J., Robinson E., Premonoidal Categories and Notions of Computation, To appear in MSCS.
38. Riecke, J., and Sandhoim A. Relational Account of Call-by-value Sequentiality, LICS'97, 1997.
39. Robinson, e. and Rosolini, P., Categories of Partial Maps, Info.&Comp., 79:95-130,1988.
40. Sieber, K., Relating Full Abstraction Results for Different Programming Languages, FST/TCS'10, pp. 373-387, LNCS 472, Springer-Verlag, 1990.
41. Winskel, g., Synchronization Trees, TCS, Vol.34, pp. 33-82, North-Holland, 1985.
42. Winskel, G., The Formal Semantics of Programming Languages, MIT Press, 1993.