{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T06:19:28Z","timestamp":1784182768949,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540578871","type":"print"},{"value":"9783540483830","type":"electronic"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57887-0_88","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:37:42Z","timestamp":1330263462000},"page":"16-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fully abstract semantics for concurrent \u03bb-calculus"],"prefix":"10.1007","author":[{"given":"Mariangiola","family":"Dezani-Ciancaglini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ugo","family":"de'Liguoro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adolfo","family":"Piperno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"2_CR1","unstructured":"M. Abadi, \u201cA Semantics for Static Type Inference in a Nondeterministic Language\u201d, to appear in Info. and Comp."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"S. Abramsky, \u201cDomain Theory in Logical Form\u201d, Ann. of Pure and Appl. Logics, 51, 1991, 1\u201377.","journal-title":"Ann. of Pure and Appl. Logics"},{"key":"2_CR3","unstructured":"S. Abramsky, C.-H.L. Ong, \u201cFull Abstraction in the Lazy Lambda Calculus\u201d, Technical Report 259, Cambridge University Computer Laboratory, 1992. To appear in Info. and Comp."},{"key":"2_CR4","unstructured":"F. Alessi, \u201cPrime Type Structures\u201d, CAAP'94, LNCS, Springer, Berlin, to appear."},{"key":"2_CR5","unstructured":"F. Barbanera, M. Dezani-Ciancaglini, U. de'Liguoro, \u201cIntersection and Union Types: Syntax and Semantics\u201d, to appear in Info. and Comp."},{"key":"2_CR6","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"H.P. Barendregt, The Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam 1984."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"H. Barendregt, M. Coppo, M. Dezani-Ciancaglini, \u201cA Filter Lambda Model and the Completeness of Type Assignment\u201d, J.Symbolic Logic 48, 1983, 931\u2013940.","journal-title":"J.Symbolic Logic"},{"key":"2_CR8","unstructured":"G. Boudol, \u201cA Lambda Calculus for (Strict) Parallel Functions\u201d, INRIA-Sophia Antipolis Tech. Rep. 1387, 1991, to appear in Info. and Comp."},{"key":"2_CR9","unstructured":"B.A. Davey, H.A. Priestley, Introduction to Lattices and Order, Cambridge University Press, 1990."},{"key":"2_CR10","series-title":"LNCS 711","first-page":"403","volume-title":"MFCS '93","author":"M. Dezani-Ciancaglini","year":"1993","unstructured":"M. Dezani-Ciancaglini, U. de'Liguoro, A. Piperno, \u201cFilter Models for a Parallel and Non Deterministic \u03bb-calculus\u201d, MFCS '93, LNCS 711, Springer, Berlin, 1993, 403\u2013412."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"M. Dezani-Ciancaglini, U. de'Liguoro, A. Piperno, \u201cFully Abstract Semantics for Concurrent \u03bb-calculus\u201d, Technical Report, Universit\u00e0 di Torino, 1993.","DOI":"10.1007\/3-540-57887-0_88"},{"key":"2_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-67678-9","volume-title":"A Compendium of Continuous Lattices","author":"G.K. Gierz","year":"1980","unstructured":"G.K. Gierz, K.H. Hoffmann, K. Keimel, J.D. Mislove, D.S. Scott, A Compendium of Continuous Lattices, Springer, Berlin, 1980."},{"key":"2_CR13","series-title":"LNCS 582","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-55251-0_11","volume-title":"CAAP '92","author":"U. Liguoro de'","year":"1992","unstructured":"U. de' Liguoro, A. Piperno, \u201cMust Preorder in Non-deterministic Untyped \u03bb-calculus\u201d, CAAP '92, LNCS 582, Springer, Berlin, 1992, 203\u2013220."},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/malq.19800261902","volume":"26","author":"J.R. Hindley","year":"1980","unstructured":"J.R. Hindley, G. Longo, \u201cLambda-calculus Models and Extensionality\u201d, Zeit. f\u00fcr Math. Logik 26, 1980, 289\u2013310.","journal-title":"Zeit. f\u00fcr Math. Logik"},{"key":"2_CR15","first-page":"87","volume":"52","author":"A. Meyer","year":"1982","unstructured":"A. Meyer, \u201cWhat is a Model of the Lambda Calculus?\u201d, Info. and Comp. 52, 1982, 87\u2013122.","journal-title":"Info. and Comp."},{"key":"2_CR16","unstructured":"J.H. Morris, Lambda Calculus Models of Programming Languages, Dissertation, M.I.T. 1968."},{"key":"2_CR17","unstructured":"C.-H.L. Ong, \u201cConcurrent Lambda Calculus and a General Precongruence Theorem for Applicative Bisimulations\u201d, Draft, Cambridge Un., 1992."},{"key":"2_CR18","first-page":"275","volume-title":"LICS '93","author":"C.-H.L. Ong","year":"1993","unstructured":"C.-H.L. Ong, \u201cNon-Determinism in a Functional Setting\u201d, LICS '93, IEEE Comp.Soc. Press, Silver Spring, 1993, 275\u2013286."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"G.D. Plotkin, \u201cCall-by-name, Call-by-value and the \u03bb-calculus\u201d, in Theor. Comput. Sci. 1, 1975.","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"G.D. Plotkin, \u201cLCF Considered as a Programming Language\u201d, Theor. Comput. Sci., 5, 1977, 223\u2013256.","journal-title":"Theor. Comput. Sci."},{"key":"2_CR21","series-title":"LNCS 140","first-page":"577","volume-title":"ICALP'82","author":"D. Scott","year":"1982","unstructured":"D.Scott, \u201cDomains for Denotational Semantics\u201d ICALP'82, LNCS 140, Springer, Berlin, 1982, 577\u2013613."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57887-0_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:16:18Z","timestamp":1742595378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57887-0_88"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578871","9783540483830"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-57887-0_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}