{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T21:40:02Z","timestamp":1750110002360,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662544570"},{"type":"electronic","value":"9783662544587"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54458-7_3","type":"book-chapter","created":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T09:22:57Z","timestamp":1489569777000},"page":"36-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["From Qualitative to Quantitative Semantics"],"prefix":"10.1007","author":[{"given":"James","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,16]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., McCusker, G.: Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In: O\u2019Hearn, P.W., Tennent, R. (eds.) Algol-like languages. Birkhauser (1997)","DOI":"10.1007\/978-1-4757-3851-3_10"},{"key":"3_CR2","unstructured":"Baillot, P., Danos, V., Ehrhard, T., Regnier, L.: AJM games are a model of classical linear logic. In: Proceedings of the Twelfth International Symposium on Logic in Computer Science, LICS 1997 (1997)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-08860-1_7","volume-title":"Automata, Languages and Programming","author":"G Berry","year":"1978","unstructured":"Berry, G.: Stable models of typed $$\\lambda $$-calculi. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol. 62, pp. 72\u201389. Springer, Heidelberg (1978). doi:10.1007\/3-540-08860-1_7"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G Berry","year":"1982","unstructured":"Berry, G., Curien, P.-L.: Sequential algorithms on concrete data structures. Theoret. Comput. Sci. 20, 265\u2013321 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.entcs.2010.08.014","volume":"265","author":"A Calderon","year":"2010","unstructured":"Calderon, A., McCusker, G.: Understanding game semantics through coherence spaces. Electron. Notes Theoret. Comput. Sci. 265, 231\u2013244 (2010)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"3_CR6","first-page":"27","volume":"64","author":"M Churchill","year":"2013","unstructured":"Churchill, M., Laird, J., McCusker, G.: Imperative programs as proofs via game semantics. Ann. Pure and Appl. Logic 64, 27\u201394 (2013)","journal-title":"Ann. Pure and Appl. Logic"},{"key":"3_CR7","unstructured":"Cruttwell, G.: Normed Spaces and Change of Base for Enriched Categories. Ph.D. thesis, Dalhousie University (2008)"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1145\/507382.507385","volume":"3","author":"V Danos","year":"2002","unstructured":"Danos, V., Harmer, R.: Probabilistic game semantics. ACM Trans. Comput. Logic 3(3), 359\u2013382 (2002)","journal-title":"ACM Trans. Comput. Logic"},{"key":"3_CR9","volume-title":"Advances in Linear Logic","author":"T Ehrhard","year":"1995","unstructured":"Ehrhard, T.: Hypercoherence: a strongly stable model of linear logic. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. Cambridge University Press, Cambridge (1995)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Ghica, D.: Slot games: a qunatitative model of computation. In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 85\u201397 (2005)","DOI":"10.1145\/1047659.1040313"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0304-3975(03)00315-3","volume":"309","author":"D Ghica","year":"2003","unstructured":"Ghica, D., McCusker, G.: The regular language semantics of second-order Idealised Algol. Theoret. Comput. Sci. 309, 469\u2013502 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR12","volume-title":"Proofs and Types","author":"J-Y Girard","year":"1990","unstructured":"Girard, J.-Y., Taylor, P., Lafont, Y.: Proofs and Types. Cambridge University Press, Cambridge (1990)"},{"key":"3_CR13","unstructured":"Harmer, R., McCusker, G.: A fully abstract games semantics for finite non-determinism. In: Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, LICS 1999. IEEE Computer Society Press (1998)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"JME Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II and III. Inf. Comput. 163, 285\u2013408 (2000)","journal-title":"Inf. Comput."},{"issue":"4","key":"3_CR15","first-page":"61","volume":"9","author":"G Janelidze","year":"2001","unstructured":"Janelidze, G., Kelly, G.M.: A note on actions of a monoidal category. Theor. Appl. Categories 9(4), 61\u201391 (2001)","journal-title":"Theor. Appl. Categories"},{"key":"3_CR16","unstructured":"Lafont, Y.: Logiques, cat\u00e9gories et machines. Ph.D thesis, Universit\u00e9 Paris 7 (1988)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Laird J.: A categorical semantics of higher-order store. In: Proceedings of CTCS 2002, number 69 in ENTCS. Elsevier (2002)","DOI":"10.1016\/S1571-0661(04)80566-8"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Laird, J.: Fixed points in quantitative semantics. In: Proceedings of LICS 2016, pp. 347\u2013356. ACM (2016)","DOI":"10.1145\/2933575.2934569"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ic.2012.10.015","volume":"222","author":"J Laird","year":"2013","unstructured":"Laird, J., Manzonetto, G., McCusker, G.: Constructing differential categories and deconstructing categories of games. Inf. Comput. 222, 247\u2013264 (2013)","journal-title":"Inf. Comput."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Laird, J., Manzonetto, G., McCusker, G., Pagani, M.: Weighted relational models of typed lambda-calculi. In: Proceedings of LICS 2013 (2013)","DOI":"10.1109\/LICS.2013.36"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(92)90323-8","volume":"94","author":"F Lamarche","year":"1999","unstructured":"Lamarche, F.: Quantitative domains and infinitary algebras. Theoret. Comput. Sci. 94, 37\u201362 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-02930-1_21","volume-title":"Automata, Languages and Programming","author":"P-A Melli\u00e8s","year":"2009","unstructured":"Melli\u00e8s, P.-A., Tabareau, N., Tasson, C.: An explicit formula for the free exponential modality of linear logic. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 247\u2013260. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-02930-1_21"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Simpson, A., Plotkin, G.: Complete axioms for categorical fixed-point operators. In: Proceedings of LICS 2000, pp. 30\u201341. IEEE Press (2000)","DOI":"10.1109\/LICS.2000.855753"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"G Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325\u2013392. Springer, Heidelberg (1987). doi:10.1007\/3-540-17906-2_31"},{"key":"3_CR25","unstructured":"Winskel, G.: Concurrent strategies. In: Proceedings of LICS 2011 (2011)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54458-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T21:22:20Z","timestamp":1750108940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54458-7_3"}},"subtitle":["By Change of Base"],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544570","9783662544587"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54458-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}