{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T02:26:45Z","timestamp":1774837605187,"version":"3.50.1"},"reference-count":56,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0304-3975(99)00039-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"393-456","source":"Crossref","is-referenced-by-count":58,"title":["Game-theoretic analysis of call-by-value computation"],"prefix":"10.1016","volume":"221","author":[{"given":"Kohei","family":"Honda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuko","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00039-0_bib1","series-title":"Structure and Interpretation of Computer Program","author":"Abelson","year":"1985"},{"issue":"2","key":"10.1016\/S0304-3975(99)00039-0_bib2","doi-asserted-by":"crossref","first-page":"543","DOI":"10.2307\/2275407","article-title":"Games and full completeness for multiplicative linear logic","volume":"59","author":"Abramsky","year":"1994","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(99)00039-0_bib3","series-title":"Logic in Computer Science","article-title":"A fully abstract game semantics for general references","author":"Abramsky","year":"1998"},{"key":"10.1016\/S0304-3975(99)00039-0_bib4","series-title":"Full abstraction for PCF","author":"Abramsky","year":"1994"},{"key":"10.1016\/S0304-3975(99)00039-0_bib5","series-title":"LICS'95","first-page":"234","article-title":"Games and full abstraction for the lazy \u03bb-calculus","author":"Abramsky","year":"1995"},{"key":"10.1016\/S0304-3975(99)00039-0_bib6","article-title":"Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions","volume":"vol. 3","author":"Abramsky","year":"1996"},{"key":"10.1016\/S0304-3975(99)00039-0_bib7","series-title":"CSL'97","article-title":"Call-by-value games","author":"Abramsky","year":"1997"},{"key":"10.1016\/S0304-3975(99)00039-0_bib8","series-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1984"},{"issue":"3","key":"10.1016\/S0304-3975(99)00039-0_bib9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","article-title":"Sequential algorithms on concrete data structures","volume":"20","author":"Berry","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00039-0_bib10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0168-0072(92)90073-9","article-title":"A game semantics for linear logic","volume":"56","author":"Blass","year":"1992","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(99)00039-0_bib11","article-title":"Fully abstract semantics for causality in the \u03c0-calculus","author":"Boreale","year":"1994"},{"key":"10.1016\/S0304-3975(99)00039-0_bib12","series-title":"Proc. Application of Categories in Computer Science","first-page":"86","article-title":"Sequentiality and full abstraction","volume":"vol. 177","author":"Curien","year":"1995"},{"key":"10.1016\/S0304-3975(99)00039-0_bib13","series-title":"LICS'96","article-title":"Games Semantics and abstract machines","author":"Danos","year":"1996"},{"key":"10.1016\/S0304-3975(99)00039-0_bib14","series-title":"Advances in Linear Logic","first-page":"211","article-title":"Sequent calculi for second order logic","author":"Danos","year":"1993"},{"key":"10.1016\/S0304-3975(99)00039-0_bib15","first-page":"341","article-title":"Dialogue games as a foundation for intuitionistic logic","volume":"vol. 3","author":"Felshcer","year":"1986"},{"key":"10.1016\/S0304-3975(99)00039-0_bib16","article-title":"Axiomatic domain theory in category of partial maps","author":"Fiore","year":"1994"},{"key":"10.1016\/S0304-3975(99)00039-0_bib17","article-title":"An enrichment theorem for an axiomatisation of categories of domains and continuous functions","author":"Fiore","year":"1996","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00039-0_bib18","series-title":"Logic in Computer Science","article-title":"Recursive types in games: axiomatics and process representation","author":"Fiore","year":"1998"},{"key":"10.1016\/S0304-3975(99)00039-0_bib19","series-title":"LICS'94","first-page":"92","article-title":"An axiomatisation of computationally adequate domain theoretic models of FPC","author":"Fiore","year":"1994"},{"key":"10.1016\/S0304-3975(99)00039-0_bib20","series-title":"Proc. Como. Category Theory Conf.","first-page":"95","article-title":"Algebraically complete categories","volume":"vol. 1488","author":"Freyd","year":"1991"},{"key":"10.1016\/S0304-3975(99)00039-0_bib21","series-title":"Proc. Application of Categories in Theory Conf.","first-page":"95","article-title":"Remarks on algebraically complete categories","volume":"vol. 177","author":"Freyd","year":"1992"},{"key":"10.1016\/S0304-3975(99)00039-0_bib22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00039-0_bib23","series-title":"Semantics of Programming Languages: Structures and Techniques","author":"Gunter","year":"1992"},{"key":"10.1016\/S0304-3975(99)00039-0_bib24","series-title":"Linear foundations of game semantics, a typescript","author":"Harmer","year":"1996"},{"key":"10.1016\/S0304-3975(99)00039-0_bib25","first-page":"35","article-title":"Name-passing games (II): a functional universe, Typescript","author":"Honda","year":"1996"},{"key":"10.1016\/S0304-3975(99)00039-0_bib26","series-title":"Proc. ICALP'97, Proc. 24th Internat. Colloquium on Automata, Languages, and Programming","first-page":"225","article-title":"Game-theoretic analysis of call-by-value computation (short version)","volume":"vol. 1256","author":"Honda","year":"1997"},{"key":"10.1016\/S0304-3975(99)00039-0_bib27","first-page":"43","article-title":"Game-theoretic analysis of call-by-value computation (a full version)","author":"Honda","year":"1997"},{"key":"10.1016\/S0304-3975(99)00039-0_bib28","first-page":"130","article-title":"On full abstraction for PCF: I, II and III","author":"Hyland","year":"1994"},{"key":"10.1016\/S0304-3975(99)00039-0_bib29","series-title":"Proc. 7th Annual ACM Conf. on Functional Programming Languages and Computer Architecture","article-title":"Pi-calculus, dialogue games and PCF","author":"Hyland","year":"1995"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(99)00039-0_bib30","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(93)90090-G","article-title":"Concrete domains","volume":"121","author":"Kahn","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00039-0_bib31","series-title":"LICS'97","article-title":"Full abstraction for functional languages with control","author":"Laird","year":"1997"},{"key":"10.1016\/S0304-3975(99)00039-0_bib32","article-title":"Cartesian closed categories of enumerations for effective tyep-structures","volume":"vol. 173","author":"Longo","year":"1984"},{"key":"10.1016\/S0304-3975(99)00039-0_bib33","series-title":"LICS'96","article-title":"Games and full abstraction for FPC","author":"McCusker","year":"1996"},{"key":"10.1016\/S0304-3975(99)00039-0_bib34","article-title":"Games and full abstraction for a functional metalanguage with recursive types","author":"McCusker","year":"1996"},{"key":"10.1016\/S0304-3975(99)00039-0_bib35","article-title":"A Calculus of Communicating Systems","volume":"vol. 76","author":"Milner","year":"1980"},{"issue":"2","key":"10.1016\/S0304-3975(99)00039-0_bib36","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","article-title":"Functions as processes","volume":"2","author":"Milner","year":"1992","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00039-0_bib37","unstructured":"R. Milner, Sorts and types of \u03c0-calculus, a manuscript, p. 43."},{"key":"10.1016\/S0304-3975(99)00039-0_bib38","series-title":"Proc. Internat. Summer School on Logic Algebra of Specification","article-title":"Polyadic \u03c0-calculus: a tutorial","author":"Milner","year":"1992"},{"issue":"1","key":"10.1016\/S0304-3975(99)00039-0_bib39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00039-0_bib40","series-title":"The Definition of Standard ML","author":"Milner","year":"1990"},{"key":"10.1016\/S0304-3975(99)00039-0_bib41","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/0890-5401(88)90010-7","article-title":"Partial morphisms in categories of effective objects","volume":"76","author":"Moggi","year":"1988","journal-title":"Inform. Comput."},{"issue":"1","key":"10.1016\/S0304-3975(99)00039-0_bib42","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","article-title":"Notions of computations and monads","volume":"93","author":"Moggi","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00039-0_bib43","first-page":"253","article-title":"Hereditarily sequential functionals","volume":"vol. 813","author":"Nickau","year":"1994"},{"issue":"1","key":"10.1016\/S0304-3975(99)00039-0_bib44","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1006\/inco.1995.1103","article-title":"Kripke logical relations and PCF","volume":"120","author":"O'Hearn","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00039-0_bib45","first-page":"269","article-title":"Correspondence between operational semantics and denotational semantics","volume":"vol. 4","author":"Ong","year":"1995"},{"key":"10.1016\/S0304-3975(99)00039-0_bib46","series-title":"LICS'93","first-page":"187","article-title":"Typing and subtyping for mobile processes","author":"Pierce","year":"1993"},{"key":"10.1016\/S0304-3975(99)00039-0_bib47","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-name, call-by-value and the lambda-calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00039-0_bib48","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00039-0_bib49","series-title":"Notes for a course given at the Center for the Study of Language and Information","article-title":"Lecture on predomains and partial functions","author":"Plotkin","year":"1985"},{"key":"10.1016\/S0304-3975(99)00039-0_bib50","series-title":"Proc. LDPL 95","first-page":"453","article-title":"Premonoidal categories and notions of computation","volume":"7","author":"Power","year":"1997"},{"key":"10.1016\/S0304-3975(99)00039-0_bib51","article-title":"Enhanced operational semantics for concurrency","author":"Priami","year":"1995"},{"key":"10.1016\/S0304-3975(99)00039-0_bib52","series-title":"LICS'97","article-title":"Relational account of call-by-value sequentiality","author":"Riecke","year":"1997"},{"key":"10.1016\/S0304-3975(99)00039-0_bib53","series-title":"10th FST\/TCS","first-page":"373","article-title":"Relating full abstraction results for different programming languages","volume":"vol. 472","author":"Sieber","year":"1990"},{"key":"10.1016\/S0304-3975(99)00039-0_bib54","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(84)90112-9","article-title":"Synchronization Trees","volume":"34","author":"Winskel","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00039-0_bib55","series-title":"The Formal Semantics of Programming Languages: An Introduction","author":"Winskel","year":"1993"},{"key":"10.1016\/S0304-3975(99)00039-0_bib56","first-page":"1","article-title":"Models for concurrency","volume":"vol. 4","author":"Winskel","year":"1995"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000390?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000390?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:51:24Z","timestamp":1555390284000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":56,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397599000390"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00039-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}