{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:28:01Z","timestamp":1720625281118},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3406,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s1571-0661(05)82528-9","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"40-69","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Processes and Games"],"prefix":"10.1016","volume":"71","author":[{"given":"Kohei","family":"Honda","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82528-9_BIB1","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1006\/inco.2000.2930","article-title":"Full Abstraction for PCF","volume":"163","author":"Abramsky","year":"2000","journal-title":"Info. & Comp."},{"key":"10.1016\/S1571-0661(05)82528-9_BIB2","series-title":"LICS","first-page":"334","article-title":"A Fully Abstract Game Semantics for General References","author":"Abramsky","year":"1998"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB3","article-title":"Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions","volume":"3","author":"Abramsky","year":"1996"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB4","series-title":"Process Algebra","author":"Baeten","year":"1990"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB5","series-title":"LNCS 2044","first-page":"29","article-title":"Sequentiality and the \u03c0-Calculus, TLCA01","author":"Berger","year":"2001"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB6","series-title":"LNCS","article-title":"Genericity and the \u03c0-Calculus, FoSSacs03","author":"Berger","year":"2003"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB7","first-page":"265","article-title":"Sequential algorithms on concrete data structures","volume":"20","author":"Berry","year":"1982"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB8","series-title":"LNM 177","first-page":"86","article-title":"Sequentiality and full abstraction. Proc. of Application of Categories in Computer Science","author":"Curien","year":"1995"},{"issue":"6","key":"10.1016\/S1571-0661(05)82528-9_BIB9","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129598002631","article-title":"Abstract B\u00f6hm Trees","volume":"8","author":"Curien","year":"1998","journal-title":"Mathematical Structure of Computer Science"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB10","series-title":"Proc. Of Third International Symposium on Functional and Logic Programming","article-title":"Computing with Abstract B\u00f6hm Trees","author":"Curien","year":"1998"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB11","series-title":"LICS\u203298","first-page":"345","article-title":"Recursive Types in Games: axiomatics and process representation","author":"Fiore","year":"1998"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB12","unstructured":"F. Gadducci, U. Montanari. The Tile Model. Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press."},{"key":"10.1016\/S1571-0661(05)82528-9_BIB13","series-title":"Game semantics for untyped \u03bb-calculus","author":"Di Gianantonio","year":"1998"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB14","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":"TCS"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB15","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB16","series-title":"Unified Theories of Programming","first-page":"58","author":"Hoare","year":"1994"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB17","first-page":"509","article-title":"Types for Dyadic Interaction","volume":"715","author":"Honda","year":"1993"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB18","series-title":"POPL\u203296","first-page":"344","article-title":"Composing Processes","author":"Honda","year":"1996"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB19","unstructured":"K. Honda. A Theory of Types for the \u03c0-calculus. Typescript, 113 pp, October, 1999. Available from: http:\/\/www.dcs.qmw.ac.uk\/~kohei\/."},{"key":"10.1016\/S1571-0661(05)82528-9_BIB20","series-title":"Elementary Structures for Process Theory (1): Sets with Renaming","author":"Honda","year":"2001"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB21","first-page":"133","article-title":"An object calculus for asynchronous communication","volume":"512","author":"Honda","year":"1991"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB22","first-page":"225","article-title":"Game-theoretic analysis of call-by-value computation","volume":"1256","author":"Honda","year":"1997"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB23","series-title":"POPL\u203202","article-title":"A uniform type structure for secure information flow","author":"Honda","year":"2002"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB24","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1006\/inco.2000.2917","article-title":"\u201cOn Full Abstraction for PCF\u201d: I, II and III","volume":"163","author":"Hyland","year":"2000","journal-title":"Info. & Comp."},{"key":"10.1016\/S1571-0661(05)82528-9_BIB25","series-title":"FPCA\u203295","article-title":"Pi-calculus, dialogue games and PCF","author":"Hyland","year":"1995"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB26","series-title":"POPL\u203203","article-title":"Bigraphs and Transistions","author":"Jensen","year":"2003"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB27","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(93)90090-G","article-title":"Concrete Domains","author":"Kahn","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB28","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0304-3975(00)00353-4","article-title":"Innocent game models of untyped lambda calculus","volume":"272","author":"Ker","year":"2002","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB29","series-title":"POPL\u203296","first-page":"358","article-title":"Linear Types and \u03c0-calculus","author":"Kobayashi","year":"1996"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB30","series-title":"LICS\u203297","article-title":"Full abstraction for functional languages with control","author":"Laird","year":"1997"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB31","series-title":"LICS 2002","first-page":"265","article-title":"Polarized games","author":"Laurent","year":"2002"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB32","series-title":"Ph.D.thesis","article-title":"Games and Full Abstraction for a Functional Metalanguage with Recursive Types","author":"McCusker","year":"1998"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB33","first-page":"345","article-title":"Research Directions in Rewriting Logic. Computational Logic","volume":"165","author":"Meseguer","year":"1999"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of typed lambda calculi","volume":"4","author":"Milner","year":"1977","journal-title":"TCS"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB35","series-title":"A Calculus of Communicating Systems LNCS 92","author":"Milner","year":"1980"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB36","first-page":"119","article-title":"Functions as Processes","volume":"2(2)","author":"Milner","year":"1992"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB37","series-title":"Polyadic \u03c0-Calculus: a tutorial. Proceedings of the International Summer School on Logic Algebra of Specification","author":"Milner","year":"1992"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB38","author":"Milner","year":"1997","journal-title":"Address at Bologna on receiving Honorary Degree from the University of Bologna"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB39","series-title":"Computer Laboratory Technical Report No. 523","article-title":"Bigraphical reactive systems: basic theory","author":"Milner","year":"2002"},{"issue":"1","key":"10.1016\/S1571-0661(05)82528-9_BIB40","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":"Info. & Comp."},{"key":"10.1016\/S1571-0661(05)82528-9_BIB41","series-title":"LNCS 813","first-page":"253","article-title":"Hereditarily Sequential Functionals","author":"Nickau","year":"1994"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB42","doi-asserted-by":"crossref","unstructured":"L. Ong. Correspondence between operational and denotational semantics. Handbook of Logic in Computer Science, Vol 4, pp. 269-356, Oxford University Press.","DOI":"10.1093\/oso\/9780198537809.003.0003"},{"issue":"5","key":"10.1016\/S1571-0661(05)82528-9_BIB43","first-page":"409","article-title":"Typing and subtyping for mobile processes","volume":"6","author":"Pierce","year":"1996","journal-title":"MSCS"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB44","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 \u03bb-calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB45","series-title":"Computers and Automata","first-page":"19","article-title":"Towards a Mathematical Semantics for Computer Languages","author":"Scott","year":"1971"},{"key":"10.1016\/S1571-0661(05)82528-9_BIB46","unstructured":"N. Yoshida, M. Berger, K. Honda. Strong Normalisation in the \u03c0-Calculus, LICS\u203201, IEEE, 2001. The full version as MCS technical report, 2001-09, University of Leicester, 2001. Available at www.mcs.le.ac.uk\/~nyoshida."},{"key":"10.1016\/S1571-0661(05)82528-9_BIB47","series-title":"LNCS 2303","first-page":"417","article-title":"Linearity and Bisimulation. Proc. Of 5th International Conference, Foundations of Software Science and Computer Structures (FoSSaCs 2002)","author":"Yoshida","year":"2002"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825289?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825289?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T20:25:16Z","timestamp":1706214316000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":47,"alternative-id":["S1571066105825289"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82528-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}