{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:48:47Z","timestamp":1742964527877,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":42,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387758886"},{"type":"electronic","value":"9780387304403"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-30440-3_313","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T15:59:31Z","timestamp":1245254371000},"page":"5286-5299","source":"Crossref","is-referenced-by-count":0,"title":["Logic and Geometry of Agents in Agent-Based Modeling"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"313_CR1_313","first-page":"1","volume-title":"Proc of CONCUR 96. Lectures notes in computer science","author":"S Abramsky","year":"1996","unstructured":"Abramsky S (1996) Retracing some paths in process algebra. In: Proc of CONCUR 96. Lectures notes in computer science, vol\u00a01119. Springer, Berlin, pp\u00a01\u201317"},{"key":"313_CR2_313","volume-title":"Proof and system\u2010reliability","author":"S Abramsky","year":"2002","unstructured":"Abramsky S (2002) Algorithmic game semantics: a\u00a0tutorial introduction. In: Proof and system\u2010reliability. Kluwer, Dordrecht"},{"key":"313_CR3_313","doi-asserted-by":"crossref","unstructured":"Abramsky S (2004) High\u2010level methods for quantum computation and information. In: Proc of the 19th annual IEEE symposium on logic in computer science. IEEE Computer Science Press, Los Alamitos pp\u00a0410\u2013414","DOI":"10.1109\/LICS.2004.1319635"},{"key":"313_CR4_313","first-page":"1","volume-title":"Proc of CALCO 2005. Springer lecture notes in computer science","author":"S Abramsky","year":"2005","unstructured":"Abramsky S (2005) Abstract scalars, loops, and free traced and strongly compact closed categories. In: Proc of CALCO 2005. Springer lecture notes in computer science, vol\u00a03629. Springer, Berlin, pp\u00a01\u201331"},{"key":"313_CR5_313","first-page":"413","volume-title":"Mathematics of quantum computing and technology","author":"S Abramsky","year":"2007","unstructured":"Abramsky S (2007) Temperley\u2013Lieb algebras and geometry of interaction. In: Chen G, Kauffman L, Lamonaco S (eds) Mathematics of quantum computing and technology. Chapman and Hall\/CRC, Boca Raton, pp\u00a0413\u2013458"},{"key":"313_CR6_313","first-page":"415","volume-title":"Proc of the 19th Annual IEEE symposium on logic in computer science: LICS 2004","author":"S Abramsky","year":"2004","unstructured":"Abramsky S, Coecke B (2004) A\u00a0categorical semantics of quantum protocols. In: Proc of the 19th Annual IEEE symposium on logic in computer science: LICS 2004. IEEE Computer Society, Los Alamitos, pp\u00a0415\u2013425"},{"key":"313_CR7_313","first-page":"111","volume":"14","author":"S Abramsky","year":"2005","unstructured":"Abramsky S, Coecke B (2005) Abstract physical traces. Theory Appl Categ 14:111\u2013124","journal-title":"Theory Appl Categ"},{"key":"313_CR8_313","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/inco.1994.1041","volume":"111","author":"S Abramsky","year":"1994","unstructured":"Abramsky S, Jagadeesan R (1994) New foundations for the geometry of interaction. Inform Comput 111:53\u2013119","journal-title":"Inform Comput"},{"key":"313_CR9_313","doi-asserted-by":"crossref","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S Abramsky","year":"1994","unstructured":"Abramsky S, Jagadeesan R (1994) Games and full completeness for multiplicative linear logic. J\u00a0Symb Log 59:543\u2013574","journal-title":"J Symb Log"},{"key":"313_CR10_313","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.apal.2004.10.002","volume":"133","author":"S Abramsky","year":"2005","unstructured":"Abramsky S, Jagadeesan R (2005) A\u00a0game semantics for generic polymorphism. Ann Pure Appl Log 133:3\u201337","journal-title":"Ann Pure Appl Log"},{"key":"313_CR11_313","first-page":"317","volume-title":"Algol\u2010like languages","author":"S Abramsky","year":"1997","unstructured":"Abramsky S, McCusker G (1997) Linearity, sharing and state. In: O'Hearn P, Tennent RD (eds) Algol\u2010like languages. Birkhauser, Basel, pp\u00a0317\u2013348"},{"key":"313_CR12_313","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(99)00047-X","volume":"227","author":"S Abramsky","year":"1999","unstructured":"Abramsky S, McCusker G (1999) Full abstraction for idealized Algol with passive expressions. Theor Comput Sci 227:3\u201342","journal-title":"Theor Comput Sci"},{"key":"313_CR13_313","first-page":"1","volume-title":"Computational logic: Proc of the 1997 Marktoberdorf Summer School","author":"S Abramsky","year":"1999","unstructured":"Abramsky S, McCusker G (1999) Game semantics. In: Computational logic: Proc of the 1997 Marktoberdorf Summer School. Springer, Berlin, pp\u00a01\u201356"},{"key":"313_CR14_313","first-page":"431","volume-title":"Proc of the 14th international symposium on logic in computer science","author":"S Abramsky","year":"1999","unstructured":"Abramsky S, Mellies P-A (1999) Concurrent games and full completeness. In: Proc of the 14th international symposium on logic in computer science. Computer Society Press of the IEEE, Los Alamitos, pp\u00a0431\u2013442"},{"key":"313_CR15_313","first-page":"334","volume-title":"Proc of the 13th international symposium on logic in computer science","author":"S Abramsky","year":"1998","unstructured":"Abramsky S, Honda K, McCusker G (1998) A\u00a0fully abstract game semantics for general references. In: Proc of the 13th international symposium on logic in computer science. Computer Society Press of the IEEE, Los Alamitos, pp\u00a0334\u2013344"},{"key":"313_CR16_313","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S Abramsky","year":"2000","unstructured":"Abramsky S, Jagadeesan R, Malacaria P (2000) Full abstraction for PCF. Inform Comput 163:409\u2013470","journal-title":"Inform Comput"},{"key":"313_CR17_313","doi-asserted-by":"crossref","unstructured":"Abramsky S, Ghica DR, Murawski AS, Ong C-HL (2004) Applying game semantics to compositional software modeling and verification. In: Proc TACAS'04. LNCS, vol\u00a02988. pp\u00a0421\u2013435","DOI":"10.1007\/978-3-540-24730-2_32"},{"key":"313_CR18_313","first-page":"150","volume-title":"Proc LICS'04","author":"S Abramsky","year":"2004","unstructured":"Abramsky S, Ghica DR, Murawski AS, Stark IDB, Ong C-HL (2004) Nominal games and full abstraction for the nu\u2010calculus. In: Proc LICS'04. IEEE Computer Society Press, Los Alamitos, pp\u00a0150\u2013159"},{"issue":"4","key":"313_CR19_313","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.2307\/2586659","volume":"63","author":"R Blute","year":"1998","unstructured":"Blute R, Scott PJ (1998) The Shuffle Hopf Algebra and noncommutative full completeness. J\u00a0Symb Log 63(4):1413\u20131436","journal-title":"J Symb Log"},{"issue":"1\u20133","key":"313_CR20_313","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.apal.2004.05.002","volume":"131","author":"R Blute","year":"2005","unstructured":"Blute R, Hamano M, Scott PJ (2005) Softness of hypercoherences and MALL full completeness. Ann Pure Appl Log 131(1\u20133):1\u201363","journal-title":"Ann Pure Appl Log"},{"issue":"3","key":"313_CR21_313","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/507382.507385","volume":"3","author":"V Danos","year":"2002","unstructured":"Danos V, Harmer R (2002) Probabilistic game semantics. ACM Trans Comput Log 3(3):359\u2013382","journal-title":"ACM Trans Comput Log"},{"key":"313_CR22_313","doi-asserted-by":"crossref","unstructured":"Devarajan H, Hughes D, Plotkin G, Pratt V (1999) Full completeness of the multiplicative linear logic of Chu spaces. In: Proc of the 14th Annual IEEE symposium on logic in computer science. pp\u00a0234\u2013242","DOI":"10.1109\/LICS.1999.782619"},{"key":"313_CR23_313","volume-title":"Principles of quantum mechanics","author":"PAM Dirac","year":"1947","unstructured":"Dirac PAM (1947) Principles of quantum mechanics. Oxford University Press, Oxford"},{"key":"313_CR24_313","doi-asserted-by":"crossref","unstructured":"Ghica DR, McCusker G (2000) Reasoning about idealized algol using regular languages. In: Proc ICALP'00. LNCS, vol\u00a01853. pp\u00a0103\u2013116","DOI":"10.1007\/3-540-45022-X_10"},{"key":"313_CR25_313","doi-asserted-by":"crossref","unstructured":"Ghica DR, Murawski AS (2004) Angelic semantics of fine\u2010grained concurrency. In: Proc FOSSACS'04. LNCS, vol\u00a02987. pp\u00a0211\u2013225","DOI":"10.1007\/978-3-540-24727-2_16"},{"key":"313_CR26_313","doi-asserted-by":"crossref","unstructured":"Ghica DR, Murawski AS (2006) Compositional model extraction for higher\u2010order concurrent programs. In: Proc TACAS'06. LNCS","DOI":"10.1007\/11691372_20"},{"issue":"1","key":"313_CR27_313","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard J-Y (1987) Linear logic. Theor Comput Sci 50(1):1\u2013102","journal-title":"Theor Comput Sci"},{"key":"313_CR28_313","first-page":"221","volume-title":"Logic Colloquium \u201888","author":"J-Y Girard","year":"1989","unstructured":"Girard J-Y (1989) Geometry of interaction I: interpretation of system F. In: Ferro R et al (eds) Logic Colloquium \u201888. Elsevier, Amsterdam, pp\u00a0221\u2013260"},{"key":"313_CR29_313","volume-title":"Proc 14th Annual IEEE symposium on logic in computer science","author":"R Harmer","year":"1999","unstructured":"Harmer R, McCusker G (1999) A\u00a0fully abstract game semantics for finite nondeterminism. In: Proc 14th Annual IEEE symposium on logic in computer science. IEEE Computer Society Press, Los Alamitos"},{"key":"313_CR30_313","volume-title":"Hypergame semantics: full completeness for system F. D Phil Mathematical Sciences","author":"D Hughes","year":"2000","unstructured":"Hughes D (2000) Hypergame semantics: full completeness for system F. D Phil Mathematical Sciences. Oxford University, Oxford"},{"key":"313_CR31_313","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"JME Hyland","year":"2000","unstructured":"Hyland JME, Ong C-HL (2000) On full abstraction for PCF: i.\u00a0models, observables and the full abstraction problem, ii. dialogue games and innocent strategies, iii. a\u00a0fully abstract and universal game model. Informat Comput 163:285\u2013408","journal-title":"Informat Comput"},{"key":"313_CR32_313","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1090\/S0273-0979-1985-15304-2","volume":"129","author":"VFR Jones","year":"1985","unstructured":"Jones VFR (1985) A\u00a0polynomial invariant for links via von Neumann algebras. Bull Amer Math Soc 129:103\u2013112","journal-title":"Bull Amer Math Soc"},{"issue":"2","key":"313_CR33_313","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1090\/S0002-9947-1990-0958895-7","volume":"318","author":"LH Kauffman","year":"1990","unstructured":"Kauffman LH (1990) An invariant of regular isotopy. Trans Amer Math Soc 318(2):417\u2013471","journal-title":"Trans Amer Math Soc"},{"key":"313_CR34_313","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0022-4049(80)90101-2","volume":"19","author":"GM Kelly","year":"1980","unstructured":"Kelly GM, Laplaza ML (1980) Coherence for compact closed categories. J\u00a0Pure Appl Algebra 19:193\u2013213","journal-title":"J Pure Appl Algebra"},{"key":"313_CR35_313","unstructured":"Laird J (1997) Full abstraction for functional languages with control. In: Proc of the 12th Annual symposium on logic in computer science, LICS '97. Extended abstract"},{"key":"313_CR36_313","unstructured":"Laird J (2001) A\u00a0fully abstract games semantics of local exceptions. In: Proc of the 16th Annual symposium on logic in computer science, LICS \u201901. Extended abstract"},{"key":"313_CR37_313","volume-title":"Models of Lambda calculi and linear logic. D Phil thesis","author":"R Loader","year":"1994","unstructured":"Loader R (1994) Models of Lambda calculi and linear logic. D\u00a0Phil thesis. Oxford University, Oxford"},{"key":"313_CR38_313","doi-asserted-by":"crossref","unstructured":"Murawski AS, Ong C-HL, Walukiewicz I (2005) Idealized Algol with ground recursion and DPDA equivalence. In: Proc\u00a0ICALP'05. LNCS, vol\u00a03580. pp\u00a0917\u2013929","DOI":"10.1007\/11523468_74"},{"key":"313_CR39_313","unstructured":"Girard J-Y, Lafont Y, Taylor P (1989) Proof and types. Cambridge Tracts in Theoretical Computer Science"},{"key":"313_CR40_313","volume-title":"Introduction to combinators and the \u03bb\u2011calculus","author":"JR Hindley","year":"1986","unstructured":"Hindley JR, Seldin JP (1986) Introduction to combinators and the \u03bb\u2011calculus. Cambridge University Press, Cambridge"},{"key":"313_CR41_313","doi-asserted-by":"crossref","DOI":"10.1142\/2260","volume-title":"Knots in physics","author":"LH Kauffman","year":"1994","unstructured":"Kauffman LH (1994) Knots in physics. World Scientific Press, Singapore"},{"key":"313_CR42_313","unstructured":"Troelstra AS (1992) Lectures on linear logic. Center for the Study of Language and Information Lecture Notes No. 29"}],"container-title":["Encyclopedia of Complexity and Systems Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30440-3_313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T05:44:31Z","timestamp":1739166271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30440-3_313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387758886","9780387304403"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30440-3_313","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}