{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:04:28Z","timestamp":1759147468985,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319893655"},{"type":"electronic","value":"9783319893662"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89366-2_4","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T19:52:34Z","timestamp":1523649154000},"page":"71-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Syntactic View of Computational Adequacy"],"prefix":"10.1007","author":[{"given":"Marco","family":"Devesas Campos","sequence":"first","affiliation":[]},{"given":"Paul Blain","family":"Levy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Inf. Comput. 163(2), 409\u2013470 (2000)","journal-title":"Inf. Comput."},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0028004","volume-title":"Computer Science Logic","author":"S Abramsky","year":"1998","unstructured":"Abramsky, S., McCusker, G.: Call-by-value games. In: Nielsen, M., Thomas, W. (eds.) CSL 1997. LNCS, vol. 1414, pp. 1\u201317. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0028004"},{"key":"4_CR3","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories - The Equational Logic of Iterative Processes","author":"SL Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories - The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993). \nhttps:\/\/doi.org\/10.1007\/978-3-642-78034-9"},{"key":"4_CR4","unstructured":"Fiore, M.P., Plotkin, G.D.: An axiomatization of computationally adequate domain theoretic models of FPC. In: LICS: IEEE Symposium on Logic in Computer Science (1994)"},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526565","volume-title":"Axiomatic Domain Theory in Categories of Partial Maps, Distinguished Dissertations in Computer Science","author":"MP Fiore","year":"1996","unstructured":"Fiore, M.P.: Axiomatic Domain Theory in Categories of Partial Maps, Distinguished Dissertations in Computer Science, vol. 14. Cambridge University Press, Cambridge (1996)"},{"key":"4_CR6","volume-title":"Proofs and Types, Cambridge Tracts in Theoretical Computer Science","author":"JY Girard","year":"1989","unstructured":"Girard, J.Y., Lafont, Y., Taylor, P.: Proofs and Types, Cambridge Tracts in Theoretical Computer Science, vol. 7. Cambridge University Press, Cambridge (1989)"},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"29:1","DOI":"10.1145\/2508028.2505986","volume":"60","author":"J Laird","year":"2013","unstructured":"Laird, J.: Game semantics for a polymorphic programming language. J. ACM 60(4), 29:1\u201329:27 (2013)","journal-title":"J. ACM"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Lassen, S.B., Levy, P.B.: Typed normal form bisimulation for parametric polymorphism. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24\u201327 June 2008, Pittsburgh, PA, USA, pp. 341\u2013352 (2008)","DOI":"10.1109\/LICS.2008.26"},{"key":"4_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-0954-6","volume-title":"Call-By-Push-Value: A Functional\/Imperative Synthesis, Semantics Structures in Computation","author":"PB Levy","year":"2004","unstructured":"Levy, P.B.: Call-By-Push-Value: A Functional\/Imperative Synthesis, Semantics Structures in Computation, vol. 2. Springer, Dordrecht (2004). \nhttps:\/\/doi.org\/10.1007\/978-94-007-0954-6"},{"key":"4_CR10","series-title":"CPHC\/BCS Distinguished Dissertations","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0615-9","volume-title":"Games and Full Abstraction for a Functional Metalanguage with Recursive Types","author":"G McCusker","year":"1998","unstructured":"McCusker, G.: Games and Full Abstraction for a Functional Metalanguage with Recursive Types. CPHC\/BCS Distinguished Dissertations. Springer, London (1998). \nhttps:\/\/doi.org\/10.1007\/978-1-4471-0615-9"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1017\/S096012950900766X","volume":"19","author":"RE M\u00f8gelberg","year":"2009","unstructured":"M\u00f8gelberg, R.E.: From parametric polymorphism to models of polymorphic FPC. Math. Struct. Comput. Sci. 19(4), 639\u2013686 (2009)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1017\/S0960129506005147","volume":"16","author":"D Normann","year":"2006","unstructured":"Normann, D.: On sequential functionals of type 3. Math. Struct. Comput. Sci. 16(2), 279\u2013289 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/inco.1996.0052","volume":"127","author":"AM Pitts","year":"1996","unstructured":"Pitts, A.M.: Relational properties of domains. Inf. Comput. 127(2), 66\u201390 (1996)","journal-title":"Inf. Comput."},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1017\/S0960129500003066","volume":"10","author":"AM Pitts","year":"2000","unstructured":"Pitts, A.M.: Parametric polymorphism and operational equivalence. Math. Struct. Comput. Sci. 10(3), 321\u2013359 (2000)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"GD Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci. 5(3), 223\u2013255 (1977)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"4_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.apal.2003.12.005","volume":"130","author":"AK Simpson","year":"2004","unstructured":"Simpson, A.K.: Computational adequacy for recursive types in models of intuitionistic set theory. Ann. Pure Appl. Log. 130(1\u20133), 207\u2013275 (2004)","journal-title":"Ann. Pure Appl. Log."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Wright, J.B., Thatcher, J.W., Wagner, E.G., Goguen, J.A.: Rational algebraic theories and fixed-point solutions. In: 1976 17th Annual Symposium on Foundations of Computer Science, pp. 147\u2013158. IEEE (1976)","DOI":"10.1109\/SFCS.1976.24"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Zeilberger, N.: Focusing and higher-order abstract syntax. In: Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, pp. 359\u2013369. ACM, New York (2008)","DOI":"10.1145\/1328438.1328482"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89366-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T19:53:40Z","timestamp":1523649220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89366-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319893655","9783319893662"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89366-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}