{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T12:17:41Z","timestamp":1790079461300,"version":"4.0.1"},"reference-count":68,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1998,1]]},"abstract":"<jats:p>Type-free lazy $\\lambda$-calculus is enriched with angelic parallelism and demonic nondeterminism. Call-by-name and call-by-value abstractions are considered and the operational semantics is stated in terms of a must convergence predicate. We introduce a type assignment system with intersection and union types, and we prove that the induced logical semantics is fully abstract.<\/jats:p>","DOI":"10.1137\/s0097539794275860","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"1376-1419","source":"Crossref","is-referenced-by-count":42,"title":["A Filter Model for Concurrent $\\lambda$-Calculus"],"prefix":"10.1137","volume":"27","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":"351","published-online":{"date-parts":[[2006,7,28]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1019"},{"key":"R2","unstructured":"Samson Abramsky, Experiments, powerdomains and fully abstract models for applicative multiprogramming, Lecture Notes in Comput. Sci., Vol. 158, Springer, Berlin, 1983, 1\u20131385j:68011"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90065-X"},{"key":"R4","unstructured":"S. Abramsky,\n                      The Lazy Lambda Calculus\n                      , Research Topics in Functional Programming, D. Turner, ed., Addison\u2010Wesley, Reading, MA, 1989, pp. 65\u2013116."},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90065-T"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1044"},{"key":"R7","unstructured":"Fabio Alessi, Type preorders, Lecture Notes in Comput. Sci., Vol. 787, Springer, Berlin, 1994, 37\u20135195e:03044"},{"key":"R8","unstructured":"F. Alessi, M. Dezani\u2010Ciancaglini, and U. de\u2019Liguoro,\n                      May and must convergency in concurrent \u03bb\u2010calculus\n                      , in Lecture Notes in Comput. Sci. 841, Springer\u2010Verlag, New York, 1994, pp. 211\u2013220."},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90015-8"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1980140403231"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90102-6"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90297-S"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00073-6"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1086"},{"key":"R15","unstructured":"H. P. Barendregt,\n                      The Lambda Calculus: Its Syntax and Semantics\n                      , 2nd ed., North\u2010Holland, Amsterdam, 1984."},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.2307\/2273659"},{"key":"R17","unstructured":"Harold Edwards, Kronecker on the foundations of mathematics, Synthese Lib., Vol. 251, Kluwer Acad. Publ., Dordrecht, 1995, 45\u2013521746494"},{"key":"R18","unstructured":"G. Boudol,\n                      Semantique Operationelle at Algebrique des Programmes Recursifs Non\u2010Deterministes\n                      , Th\u00e8se d\u2019Etat, Universit\u00e9 de Paris VII, 1980."},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1003"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0037"},{"key":"R21","unstructured":"M. Coppo, F. Honsell, M. Dezani\u2010Ciancaglini, G. Longo, Extended type structures and filter lambda models, Stud. Logic Found. Math., Vol. 112, North\u2010Holland, Amsterdam, 1984, 241\u201326287g:03018"},{"key":"R22","unstructured":"M. Coppo, M. Dezani, G. Longo, Applicative information systems, Lecture Notes in Comput. Sci., Vol. 159, Springer, Berlin, 1983, 35\u20136486k:68062"},{"key":"R23","volume-title":"Introduction to lattices and order","author":"Davey B.","year":"1990"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00235-6"},{"key":"R26","unstructured":"Mariangiola Dezani\u2010Ciancaglini, Ugo de\u2019Liguoro, Adolfo Piperno, Fully abstract semantics for concurrent \u03bb\u2010calculus (extended abstract), Lecture Notes in Comput. Sci., Vol. 789, Springer, Berlin, 1994, 16\u2013351296671"},{"key":"R27","unstructured":"M. Dezani\u2010Ciancaglini, U. de\u2019Liguoro, and P. van Rossum,\n                      A Type Assignment System for Higher\u2010Order Communicating Processes\n                      , Internal Report, Universit\u00e0 di Torino, Italy, 1994."},{"key":"R28","unstructured":"A. Giacalone, P. Mishra, and S. Prasad,\n                      FACILE: A symmetric integration of concurrent and functional programming\n                      , in Lecture Notes in Comput. Sci. 352, Springer\u2010Verlag, New York, 1989, pp. 184\u2013201."},{"key":"R29","unstructured":"A. Giacalone, P. Mishra, and S. Prasad,\n                      Operational and algebraic semantics for FACILE: A symmetric integration of concurrent and functional programming\n                      , in Lecture Notes in Comput. Sci. 443, Springer\u2010Verlag, New York, 1990, pp. 765\u2013779."},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-67678-9"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1137\/0209005"},{"key":"R32","unstructured":"M. C. B. Hennessy,\n                      Powerdomains and non\u2010deterministic recursive definitions\n                      , in Lecture Notes in Comput. Sci. 137, Springer\u2010Verlag, New York, 1982, pp. 178\u2013193."},{"key":"R33","volume-title":"Algebraic theory of processes","author":"Hennessy Matthew","year":"1988"},{"key":"R34","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1052"},{"key":"R35","unstructured":"M. Hennessy, Higher\u2010order processes and their models, Lecture Notes in Comput. Sci., Vol. 820, Springer, Berlin, 1994, 286\u20133031334116"},{"key":"R36","unstructured":"J. R. Hindley,\n                      The simple semantics for Coppo\u2010Dezani\u2010Sall\u00e9 type assignment\n                      , in Lecture Notes in Comput. Sci. 137, Springer\u2010Verlag, New York, 1982, pp. 212\u2013226."},{"key":"R37","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19800261902"},{"key":"R38","first-page":"130","volume":"4","author":"Pearson Justin","year":"1998","journal-title":"Proc. Est. Acad. Sci. Eng."},{"key":"R39","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791224212"},{"key":"R40","unstructured":"P. T. Johnstone,\n                      Stone Spaces\n                      , Cambridge University Press, Cambridge, 1982."},{"key":"R41","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"R42","unstructured":"K. Larsen, G. Winskel, Using information systems to solve recursive domain equations effectively, Lecture Notes in Comput. Sci., Vol. 173, Springer, Berlin, 1984, 109\u201312986d:68046"},{"key":"R43","unstructured":"C. Lavatelli,\n                      Non\u2010Deterministic Lazy \u03bb\u2010Calculus versus \u03c0\u2010Calculus\n                      , LIENS Internal Report 15, Laboratoire d\u2019Informatique de l\u2019Ecole Normale Sup\u00e9rieure, Paris, 1993."},{"key":"R44","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(83)90030-1"},{"key":"R45","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1145"},{"key":"R46","first-page":"115","volume":"33","author":"Main M. G.","year":"1987","journal-title":"Bull. EATCS"},{"key":"R47","unstructured":"John McCarthy, A basis for a mathematical theory of computation, North\u2010Holland, Amsterdam, 1963, 33\u20137026:5766"},{"key":"R48","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)80087-9"},{"key":"R49","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90053-6"},{"key":"R50","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001407"},{"key":"R51","first-page":"0","volume":"100","author":"Milner Robin","year":"1992","journal-title":"Inform. and Comput."},{"key":"R52","unstructured":"J. H. Morris,\n                      Lambda Calculus Models of Programming Languages\n                      , Ph. d. Thesis, MIT, Cambridge, MA, 1968."},{"key":"R53","unstructured":"F. Nielson,\n                      The typed \u03bb\u2010calculus with first\u2010class processes\n                      , in Lecture Notes in Comput. Sci. 366, Springer\u2010Verlag, New York, 1989, pp. 357\u2013369."},{"key":"R54","unstructured":"C.\u2010H. L. Ong,\n                      The Lazy \u03bb\u2010Calculus: An Investigation into the Foundations of Functional Programming\n                      , Ph.D. Thesis, University of London, 1988;"},{"key":"R54","unstructured":"also Prize Fellowship Dissertation, Trinity College, Cambridge University, Cambridge, UK."},{"key":"R55","unstructured":"C.\u2010H. L. Ong,\n                      Concurrent Lambda Calculus and a General Precongruence Theorem for Applicative Bisimulations\n                      , Draft, Cambridge University, Cambridge, UK, 1992."},{"key":"R56","unstructured":"C.\u2010H. L. Ong,\n                      Non\u2010determinism in a functional setting\n                      , in LICS \u201993, IEEE Comp. Soc. Press, Los Alamitos, CA, 1993, pp. 275\u2013286."},{"key":"R57","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"R58","doi-asserted-by":"publisher","DOI":"10.1137\/0205035"},{"key":"R59","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"R60","unstructured":"J. H. Reppy,\n                      Concurrent ML: Design, application and semantics\n                      , in Lecture Notes in Comput. Sci. 693, Springer\u2010Verlag, New York, 1993, pp. 165\u2013198."},{"key":"R61","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1042"},{"key":"R62","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90095-B"},{"key":"R63","unstructured":"Dana Scott, Domains for denotational semantics, Lecture Notes in Comput. Sci., Vol. 140, Springer, Berlin, 1982, 577\u201361383m:68029"},{"key":"R64","unstructured":"K. Sieber,\n                      Call\u2010by\u2010value and non\u2010determinism\n                      , Lecture Notes in Comput. Sci. 664, Springer\u2010Verlag, Berlin, 1993, pp. 376\u2013390."},{"key":"R65","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/35.5.514"},{"key":"R66","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90048-X"},{"key":"R67","unstructured":"B. Thomsen,\n                      A calculus of higher\u2010order communicating Systems\n                      , in POPL\u201989, ACM Press, New York, 1989, pp. 142\u2013154."}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539794275860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:14:18Z","timestamp":1787336058000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0097539794275860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":68,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["10.1137\/S0097539794275860"],"URL":"https:\/\/doi.org\/10.1137\/s0097539794275860","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}