{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:03Z","timestamp":1742596803461,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993]]},"DOI":"10.1007\/3-540-57182-5_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:10:22Z","timestamp":1330258222000},"page":"403-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Filter models for a parallel and non deterministic \u03bb-calculus"],"prefix":"10.1007","author":[{"given":"Mariangiola","family":"Dezani-Ciancaglini","sequence":"first","affiliation":[]},{"given":"Ugo","family":"de'Liguoro","sequence":"additional","affiliation":[]},{"given":"Adolfo","family":"Piperno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"32_CR1","unstructured":"M. Abadi, \u201cA Semantics for Static Type Inference in a Nondeterministic Language\u201d, to appear in Information and Computation."},{"key":"32_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":"32_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(80)90015-8","volume":"11","author":"E. A. Ashcroft","year":"1980","unstructured":"E.A. Ashcroft, M.C.B. Hennessy, \u201cA Mathematical Semantics for a Non Deterministic Typed Lambda Calculus\u201d, TCS 11, 1980, 227\u2013245.","journal-title":"TCS"},{"key":"32_CR4","first-page":"651","volume":"526","author":"F. Barbanera","year":"1991","unstructured":"F. Barbanera, M. Dezani-Ciancaglini, \u201cIntersection and Union Types\u201d, TACS'91, LNCS 526, 1991, 651\u2013674.","journal-title":"LNCS"},{"key":"32_CR5","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":"32_CR6","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":"32_CR7","unstructured":"G. Boudol, \u201cA Lambda Calculus for (Strict) Parallel Functions\u201d, INRIA-Sophia Antipolis Tech. Rep. 1387, 1991, to appear in Information and Computation."},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"M. Dezani-Ciancaglini, U. de'Liguoro, A. Piperno, \u201cFilter Models for a Parallel and Non Deterministic \u03bb-calculus\u201d, Internal report, Un. di Roma I, 1993.","DOI":"10.1007\/3-540-57182-5_32"},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(83)90136-6","volume":"22","author":"R. Hindley","year":"1983","unstructured":"R. Hindley, \u201cThe Completeness Theorem for Typing \u03bb-terms\u201d, TCS 22, 1983, 1\u201317.","journal-title":"TCS"},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/malq.19800261902","volume":"26","author":"R. Hindley","year":"1980","unstructured":"R. Hindley, G. Longo, \u201cLambda Calculus Models and Extensionality\u201d, Z. Math. Logik 26, 1980, 289\u2013310.","journal-title":"Z. Math. Logik"},{"key":"32_CR11","volume-title":"Lambda-calcul, types et mod\u00e8les","author":"J. L. Krivine","year":"1990","unstructured":"J.L. Krivine, Lambda-calcul, types et mod\u00e8les, Masson, Paris 1990."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"U. de' Liguoro, \u201cNon-deterministic Untyped \u03bb-calculus\u201d, PhD Thesis, Un. di Roma I, 1991.","DOI":"10.1007\/3-540-55251-0_11"},{"key":"32_CR13","first-page":"203","volume":"582","author":"U. d. Liguoro","year":"1992","unstructured":"U. de' Liguoro, A. Piperno, \u201cMust Preorder in Non-deterministic Untyped \u03bb-calculus\u201d, CAAP '92, LNCS 582, 1992, 203\u2013220.","journal-title":"LNCS"},{"key":"32_CR14","unstructured":"J.H. Morris, Lambda Calculus Models of Programming Languages, Dissertation, M.I.T. 1968."},{"key":"32_CR15","unstructured":"C.-H.L. Ong, \u201cConcurrent Lambda Calculus and a General Precongruence Theorem for Applicative Bisimulations\u201d, Draft, Cambridge Un., 1992."},{"key":"32_CR16","unstructured":"C.-H.L. Ong, \u201cNon-Determinism in a Functional Setting\u201d, to appear in LICS '93."},{"key":"32_CR17","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, TCS, 5, 1977, 223\u2013256.","journal-title":"TCS"},{"key":"32_CR18","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"3","author":"G. D. Plotkin","year":"1976","unstructured":"G.D. Plotkin, \u201cA Powerdomain Construction\u201d, SIAM J. of Comp. 3, 1976, 452\u2013487.","journal-title":"SIAM J. of Comp."},{"key":"32_CR19","first-page":"1","volume":"526","author":"G. D. Plotkin","year":"1991","unstructured":"G. D. Plotkin, \u201cA Semantics for Static Type Inference\u201d, to appear in Information and Computation. A preliminary version in TACS'91, LNCS 526, 1991, 1\u201317.","journal-title":"LNCS"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"D. Sangiorgi, \u201cThe Lazy \u03bb-calculus in a Concurrency Scenario\u201d, LICS'92, 1992, 102\u2013109.","DOI":"10.1109\/LICS.1992.185524"},{"key":"32_CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M. B. Smith","year":"1978","unstructured":"M.B. Smith, \u201cA Power Domains\u201d, J. Comp. Sys. Sci. 16, 1978, 23\u201336.","journal-title":"J. Comp. Sys. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:01:06Z","timestamp":1742594466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_32"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}