{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T05:33:17Z","timestamp":1741239197518,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642216909"},{"type":"electronic","value":"9783642216916"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21691-6_18","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T05:31:26Z","timestamp":1307770286000},"page":"213-228","source":"Crossref","is-referenced-by-count":8,"title":["A Filter Model for the \u03bb\u03bc-Calculus"],"prefix":"10.1007","author":[{"given":"Steffen","family":"van Bakel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Barbanera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"de\u2019Liguoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"1","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"Abramsky, S.: Domain Theory in Logical Form. APAL\u00a051, 1\u201377 (1991)","journal-title":"APAL"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2006.01.004","volume":"355","author":"F. Alessi","year":"2006","unstructured":"Alessi, F., Barbanera, F., Dezani-Ciancaglini, M.: Intersection types and lambda models. TCS\u00a0355(2), 108\u2013126 (2006)","journal-title":"TCS"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-77566-9_11","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"F. Alessi","year":"2008","unstructured":"Alessi, F., Severi, P.: Recursive Domain Equations of Filter Models. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol.\u00a04910, pp. 124\u2013135. Springer, Heidelberg (2008)"},{"key":"18_CR4","first-page":"1400","volume":"161","author":"S. Bakel van","year":"2010","unstructured":"van Bakel, S.: Completeness and Partial Soundness Results for Intersection & Union Typing for $\\overline{\\lambda}{\\mu}\\tilde{\\mu}$ . APAL\u00a0161, 1400\u20131430 (2010)","journal-title":"APAL"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"van Bakel, S.: Sound and Complete Typing for \u03bb\u03bc. In: ITRS 2010. EPTCS, vol.\u00a045, pp. 31\u201344 (2010)","DOI":"10.4204\/EPTCS.45.3"},{"issue":"2","key":"18_CR6","first-page":"202","volume":"119","author":"F. Barbanera","year":"1995","unstructured":"Barbanera, F., Dezani-Ciancaglini, M.: de\u2019Liguoro, U. Intersection and Union Types: Syntax and Semantics. I&C\u00a0119(2), 202\u2013230 (1995)","journal-title":"Intersection and Union Types: Syntax and Semantics. I&C"},{"key":"18_CR7","volume-title":"The Lambda Calculus: its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda Calculus: its Syntax and Semantics. North-Holland, Amsterdam (1984)"},{"issue":"4","key":"18_CR8","first-page":"931","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. JSL\u00a048(4), 931\u2013940 (1983)","journal-title":"JSL"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/BFb0055783","volume-title":"Mathematical Foundations of Computer Science 1998","author":"G.M. Bierman","year":"1998","unstructured":"Bierman, G.M.: A Computational Interpretation of the \u03bb\u03bc-calculus. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 336\u2013345. Springer, Heidelberg (1998)"},{"issue":"4","key":"18_CR10","first-page":"685","volume":"21","author":"M. Coppo","year":"1980","unstructured":"Coppo, M., Dezani-Ciancaglini, M.: An Extension of the Basic Functionality Theory for the \u03bb-Calculus. NDjFL\u00a021(4), 685\u2013693 (1980)","journal-title":"NDjFL"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Curien, P.-L., Herbelin, H.: The Duality of Computation. In: ICFP 2000, ACM Notes 35.9, pp. 233\u2013243 (2000)","DOI":"10.1145\/351240.351262"},{"issue":"1","key":"18_CR12","first-page":"407","volume":"66","author":"R. David","year":"2001","unstructured":"David, R., Py, W.: \u03bb\u03bc-Calculus and B\u00f6hm\u2019s Theorem. JSL\u00a066(1), 407\u2013413 (2001)","journal-title":"JSL"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/601775.601780","volume":"4","author":"M. Dezani-Ciancaglini","year":"2003","unstructured":"Dezani-Ciancaglini, M., Honsell, F., Alessi, F.: A complete characterization of complete intersection-type preorders. ACM Trans. Comput. Log.\u00a04(1), 120\u2013147 (2003)","journal-title":"ACM Trans. Comput. Log."},{"key":"18_CR14","unstructured":"Dougherty, D., Ghilezan, S., Lescanne, P.: Intersection and Union Types in the $\\overline{\\lambda}{\\mu}\\tilde{\\mu}$ -calculus. In: ITRS 2004. ENTCS, vol.\u00a0136, pp. 228\u2013246 (2004)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Dougherty, D., Ghilezan, S., Lescanne, P.: Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage. TCS\u00a0398 (2008)","DOI":"10.1016\/j.tcs.2008.01.022"},{"key":"18_CR16","first-page":"68","volume-title":"The Collected Papers of Gerhard Gentzen","author":"G. Gentzen","year":"1969","unstructured":"Gentzen, G.: Investigations into logical deduction. In: Szabo, M.E. (ed.) The Collected Papers of Gerhard Gentzen, p. 68. North Holland, Amsterdam (1969) (1935)"},{"key":"18_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542725","volume-title":"Continuous Lattices And Domains","author":"G. Gierz","year":"2003","unstructured":"Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: Continuous Lattices And Domains. Cambridge University Press, Cambridge (2003)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-58216-9_27","volume-title":"Logic Programming and Automated Reasoning","author":"P. Groote de","year":"1994","unstructured":"de Groote, P.: On the relation between the \u03bb\u03bc-calculus and the syntactic theory of sequential control. In: Pfenning, F. (ed.) LPAR 1994. LNCS, vol.\u00a0822, pp. 31\u201343. Springer, Heidelberg (1994)"},{"key":"18_CR19","unstructured":"Herbelin, H., Saurin, A.: \u03bb\u03bc-calculus and \u039b\u03bc-calculus: a Capital Difference (2010) (manuscript)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Streicher, T.: Continuation models are universal for \u03bb\u03bc-calculus. In: LICS 1997, pp. 387\u2013397 (1997)","DOI":"10.1109\/LICS.1997.614964"},{"issue":"2","key":"18_CR21","first-page":"332","volume":"179","author":"M. Hofmann","year":"2002","unstructured":"Hofmann, M., Streicher, T.: Completeness of continuation models for lambda-mu-calculus. I&C\u00a0179(2), 332\u2013355 (2002)","journal-title":"I&C"},{"key":"18_CR22","volume-title":"Lambda calculus, types and models","author":"J.-L. Krivine","year":"1993","unstructured":"Krivine, J.-L.: Lambda calculus, types and models. Ellis Horwood, England (1993)"},{"key":"18_CR23","unstructured":"Lafont, Y., Reus, B., Streicher, T.: Continuation Semantics or Expressing Implication by Negation. Report 9321, Universit\u00e4t M\u00fcnchen (1993)"},{"issue":"1","key":"18_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","volume":"52","author":"A.R. Meyer","year":"1982","unstructured":"Meyer, A.R.: What is a Model of the Lambda Calculus? Inf. Contr.\u00a052(1), 87\u2013122 (1982)","journal-title":"Inf. Contr."},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L., Stewart, C.A.: A Curry-Howard foundation for functional computation with control. In: POPL 1997, pp. 215\u2013227 (1997)","DOI":"10.1145\/263699.263722"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L.: A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations. In: LICS 1996, pp. 230\u2013241 (1996)","DOI":"10.1109\/LICS.1996.561323"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: An algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 190\u2013201. Springer, Heidelberg (1992)"},{"key":"18_CR28","unstructured":"Py, W.: Confluence en \u03bb\u03bc-calcul. PhD thesis, Universite de Savoie (1998)"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-87531-4_13","volume-title":"Computer Science Logic","author":"A. Saurin","year":"2008","unstructured":"Saurin, A.: On the relations between the syntactic theories of \u03bb\u03bc-calculi. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 154\u2013168. Springer, Heidelberg (2008)"},{"issue":"6","key":"18_CR30","first-page":"543","volume":"11","author":"T. Streicher","year":"1998","unstructured":"Streicher, T., Reus, B.: Classical logic: Continuation Semantics and Abstract Machines. JFP\u00a011(6), 543\u2013572 (1998)","journal-title":"JFP"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21691-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T03:24:40Z","timestamp":1741231480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21691-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642216909","9783642216916"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21691-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}