{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:09Z","timestamp":1725562569174},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221647"},{"type":"electronic","value":"9783540248491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24849-1_2","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T20:34:24Z","timestamp":1281299664000},"page":"17-33","source":"Crossref","is-referenced-by-count":0,"title":["Tailoring Filter Models"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Alessi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Barbanera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariangiola","family":"Dezani-Ciancaglini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S., Luke Ong, C.-H.: Full abstraction in the lazy lambda calculus. Inform. and Comput.\u00a0105(2), 159\u2013267 (1993)","journal-title":"Inform. and Comput."},{"key":"2_CR2","unstructured":"Alessi, F.: The category p-sfp. Internal Report n. 27\/96\/RR, Dipartimento di Matematica e Informatica, University of Udine (1996)"},{"key":"2_CR3","series-title":"El. Notes in Theoret. Comput. Sci","volume-title":"WoLLIC 2003","author":"F. Alessi","year":"2003","unstructured":"Alessi, F., Barbanera, F., Dezani-Ciancaglini, M.: Intersection types and computational rules. In: de Queiroz, R., Pimentel, E., Figueiredo, L. (eds.) WoLLIC 2003. El. Notes in Theoret. Comput. Sci, vol.\u00a084, Elsevier, Amsterdam (2003)"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/601775.601780","volume":"4","author":"F. Alessi","year":"2003","unstructured":"Alessi, F., Dezani-Ciancaglini, M., Honsell, F.: A complete characterization of complete intersection-type preorders. ACM Trans. on Comput. Logic\u00a04(1), 120\u2013147 (2003)","journal-title":"ACM Trans. on Comput. Logic"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Alessi, F., Dezani-Ciancaglini, M., Lusin, S.: Intersection types and domain operators. Theoret. Comput. Sci. (2004) (to appear)","DOI":"10.1016\/j.tcs.2004.01.022"},{"issue":"4","key":"2_CR6","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. J. Symbolic Logic\u00a048(4), 931\u2013940 (1984), 1983","journal-title":"J. Symbolic Logic"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0304-3975(00)00057-8","volume":"249","author":"C. Berline","year":"2000","unstructured":"Berline, C.: From computation to foundations via functions and application: The \u03bb-calculus and its webbed models. Theoret. Comput. Sci.\u00a0249, 81\u2013161 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0049-237X(08)71819-6","volume-title":"Logic colloquium 1982","author":"M. Coppo","year":"1984","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Honsell, F., Longo, G.: Extended type structures and filter lambda models. In: Lolli, G., Longo, G., Marcja, A.L. (eds.) Logic colloquium 1982, pp. 241\u2013262. North-Holland, Amsterdam (1984)"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/malq.19810270205","volume":"27","author":"M. Coppo","year":"1981","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Venneri, B.: Functional characters of solvable terms. Z. Math. Logik Grundlag. Math.\u00a027(1), 45\u201358 (1981)","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","volume":"72","author":"M. Coppo","year":"1987","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Zacchi, M.: Type theories, normal forms, and D\u221e-lambda-models. Inform. and Comput.\u00a072(2), 85\u2013116 (1987)","journal-title":"Inform. and Comput."},{"key":"2_CR11","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Combinatory Logic","author":"H.B. Curry","year":"1958","unstructured":"Curry, H.B., Feys, R.: Combinatory Logic. Studies in Logic and the Foundations of Mathematics, vol.\u00a0I. North-Holland, Amsterdam (1958)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Dezani-Ciancaglini, M., Ghilezan, S., Likavec, S.: Behavioural inverse limit models. Theoret. Comput. Sci. (2004) (to appear)","DOI":"10.1016\/j.tcs.2004.01.023"},{"key":"2_CR13","unstructured":"Dezani-Ciancaglini, M., Honsell, F., Motohama, Y.: Compositional characterization of \u03bb-terms using intersection types. Theoret. Comput. Sci. (2004) (to appear)"},{"issue":"2","key":"2_CR14","first-page":"149","volume":"16","author":"L. Egidi","year":"1992","unstructured":"Egidi, L., Honsell, F., Rocca, S.R.D.: Operational, denotational and logical descriptions: a case study. Fund. Inform.\u00a016(2), 149\u2013169 (1992)","journal-title":"Fund. Inform."},{"key":"2_CR15","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":"Gierz, G.K., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M.W., Scott, D.S.: A Compendium of Continuous Lattices. Springer, Berlin (1980)"},{"issue":"4","key":"2_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/malq.19800261902","volume":"26","author":"R. Hindley","year":"1980","unstructured":"Hindley, R., Longo, G.: Lambda-calculus models and extensionality. Z. Math. Logik Grundlag. Math.\u00a026(4), 289\u2013310 (1980)","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"1-2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(98)00140-6","volume":"212","author":"F. Honsell","year":"1999","unstructured":"Honsell, F., Lenisa, M.: Semantical analysis of perpetual strategies in \u03bb-calculus. Theoret. Comput. Sci.\u00a0212(1-2), 183\u2013209 (1999)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","volume":"45","author":"F. Honsell","year":"1992","unstructured":"Honsell, F., Rocca, S.R.D.: An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus. J. Comput. SystemSci.\u00a045(1), 49\u201375 (1992)","journal-title":"J. Comput. SystemSci."},{"key":"2_CR19","volume-title":"Stone spaces","author":"P.T. Johnstone","year":"1986","unstructured":"Johnstone, P.T.: Stone spaces. Cambridge University Press, Cambridge (1986) (Reprint of the 1982 edn)"},{"issue":"1","key":"2_CR20","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? Inform. and Control\u00a052(1), 87\u2013122 (1982)","journal-title":"Inform. and Control"},{"issue":"2","key":"2_CR21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the \u03bb-calculus. Theoret. Comput. Sci.\u00a01(2), 125\u2013159 (1975)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0304-3975(93)90094-A","volume":"121","author":"G.D. Plotkin","year":"1993","unstructured":"Plotkin, G.D.: Set-theoretical and other elementary models of the \u03bb-calculus. Theoret. Comput. Sci.\u00a0121(1-2), 351\u2013409 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","first-page":"369","volume-title":"Lambda-Calculus and Computer Science Theory","author":"D.S. Scott","year":"1975","unstructured":"Scott, D.S.: Open problem. In: B\u00f6hm, C. (ed.) Lambda-Calculus and Computer Science Theory. LNCS, vol.\u00a037, p. 369. Springer, Heidelberg (1975)"}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24849-1_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:15:14Z","timestamp":1620011714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24849-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221647","9783540248491"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24849-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}