{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:54Z","timestamp":1761611214349},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540426721"},{"type":"electronic","value":"9783540454465"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45446-2_2","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T22:11:27Z","timestamp":1185142287000},"page":"17-37","source":"Crossref","is-referenced-by-count":7,"title":["Filter Models and Easy Terms"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Alessi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariangiola","family":"Dezani-Ciancaglini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Furio","family":"Honsell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,16]]},"reference":[{"issue":"1-2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"S. Abramsky. Domain theory in logical form. Ann. Pure Appl. Logic, 51(1-2):1\u201377, 1991.","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"S. Abramsky and C.-H. L. Ong. Full abstraction in the lazy lambda calculus. Inform. and Comput., 105(2):159\u2013267, 1993.","journal-title":"Inform. and Comput."},{"key":"2_CR3","unstructured":"F. Alessi. Strutture di tipi, teoria dei domini e modelli del lambda calcolo. PhD thesis, Torino University, 1991."},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/1385-7258(79)90016-7","volume":"41","author":"J. Baeten","year":"1979","unstructured":"J. Baeten and B. Boerboom. \u03c9 can be anything it shouldn\u2019t be. Indag.Math., 41:111\u2013120, 1979.","journal-title":"Indag.Math."},{"key":"2_CR5","volume-title":"The Lambda Calculus: its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"H. Barendregt. The Lambda Calculus: its Syntax and Semantics. North-Holland, Amsterdam, revised edition, 1984.","edition":"revised edition"},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. J. Symbolic Logic, 48(4):931\u2013940, 1983.","journal-title":"J. Symbolic Logic"},{"key":"2_CR7","unstructured":"H. Barendregt et. al. Typed \u03bb-calculus and applications. North-Holland, 2001. (to appear)."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(93)90084-7","volume":"121","author":"A. Berarducci","year":"1993","unstructured":"A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. Theoret. Comput. Sci., 121:71\u201388, 1993.","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR9","first-page":"33","volume-title":"Logic: From Foundations to applications","author":"A. Berarducci","year":"1996","unstructured":"A. Berarducci and B. Intrigila. Church-Rosser \u03bb-theories, infinite \u03bb-calculus and consistency problems. In W. Hodges and M. Hyland et al., editors, Logic: From Foundations to applications, pages 33\u201358. Oxford Sci. Publ., New York, 1996."},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","volume":"21","author":"M. Coppo","year":"1980","unstructured":"M. Coppo and M. Dezani-Ciancaglini. An extension of the basic functionality theory for the \u03bb-calculus. Notre Dame J. Formal Logic, 21(4):685\u2013693, 1980.","journal-title":"Notre Dame J. Formal Logic"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0049-237X(08)71819-6","volume-title":"Logic colloquium\u2019 82","author":"M. Coppo","year":"1984","unstructured":"M. Coppo, M. Dezani-Ciancaglini, F. Honsell, and G. Longo. Extended type structures and filter lambda models. In Logic colloquium\u2019 82, pages 241\u2013262. North-Holland, Amsterdam, 1984."},{"key":"2_CR12","first-page":"535","volume-title":"To H. B. Curry: essays on combinatory logic, lambda calculus and formalism","author":"M. Coppo","year":"1980","unstructured":"M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Principal type schemes and \u03bb-calculus semantics. In R. Hindley and J. Seldin, editors, To H. B. Curry: essays on combinatory logic, lambda calculus and formalism, pages 535\u2013560. Academic Press, London, 1980."},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","volume":"72","author":"M. Coppo","year":"1987","unstructured":"M. Coppo, M. Dezani-Ciancaglini, and M. Zacchi. Type theories, normal forms, and D\n                        \u221e-lambda-models. Inform. and Comput., 72(2):85\u2013116, 1987.","journal-title":"Inform. and Comput."},{"key":"2_CR14","series-title":"Proceedings in Informatics","first-page":"287","volume-title":"ICALP Workshops 2000","author":"M. Dezani-Ciancaglini","year":"2000","unstructured":"M. Dezani-Ciancaglini, F. Honsell, and F. Alessi. A complete characterization of the complete intersection-type theories. In J. Rolim and A. Broder et al., editors, ICALP Workshops 2000, volume 8 of Proceedings in Informatics, pages 287\u2013302. Carleton-Scientific, Canada, 2000."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"M. Dezani-Ciancaglini, F. Honsell, and Y. Motohama. Compositional characterization of \u03bb-terms using intersection types. In M. Nielsen and B. Rovan, editors, Mathematical Foundations of Computer Science 2000, volume 1893 of Lecture Notes in Comput. Sci., pages 304\u2013313. Springer, 2000.","DOI":"10.1007\/3-540-44612-5_26"},{"key":"2_CR16","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/BFb0037102","volume-title":"Typed lambda calculi and applications","author":"P. Gianantonio Di","year":"1993","unstructured":"P. Di Gianantonio and F. Honsell. An abstract notion of application. In M. Bezem and J.F. Groote, editors, Typed lambda calculi and applications, volume 664 of Lecture Notes in Comput. Sci., pages 124\u2013138. Springer, Berlin, 1993."},{"issue":"2","key":"2_CR17","first-page":"149","volume":"16","author":"L. Egidi","year":"1992","unstructured":"L. Egidi, F. Honsell, and S. Ronchi Della Rocca. Operational, denotational and logical descriptions: a case study. Fund. Inform., 16(2):149\u2013169, 1992.","journal-title":"Fund. Inform."},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/malq.19800261902","volume":"26","author":"R. Hindley","year":"1980","unstructured":"R. Hindley and G. Longo. Lambda-calculus models and extensionality. Z. Math. Logik Grundlag. Math., 26(4):289\u2013310, 1980.","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"1-2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(98)00140-6","volume":"212","author":"F. Honsell","year":"1999","unstructured":"F. Honsell and M. Lenisa. Semantical analysis of perpetual strategies in \u03bb-calculus. Theoret. Comput. Sci., 212(1-2):183\u2013209, 1999.","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR20","unstructured":"F. Honsell and S. Ronchi Della Rocca. A filter model for \u03bc. Technical report, Torino University, 1984."},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","volume":"45","author":"F. Honsell","year":"1992","unstructured":"F. Honsell and S. Ronchi Della Rocca. An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus. J. Comput. System Sci., 45(1):49\u201375, 1992.","journal-title":"J. Comput. System Sci."},{"key":"2_CR22","first-page":"99","volume":"15.1","author":"B. Intrigila","year":"1991","unstructured":"B. Intrigila. A problem on easy terms in \u03bb-calculus. Fund. Inform., 15.1:99\u2013106, 1991.","journal-title":"Fund. Inform."},{"key":"2_CR23","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BFb0029527","volume-title":"\u03bb-calculus and computer science theory","author":"G. Jacopini","year":"1975","unstructured":"G. Jacopini. A condition for identifying two elements of whatever model of combinatory logic. In C. B\u00f6hm, editor, \u03bb-calculus and computer science theory, volume 37 of Lecture Notes in Comput. Sci., pages 213\u2013219. Springer, Berlin, 1975."},{"key":"2_CR24","first-page":"225","volume":"80","author":"G. Jacopini","year":"1985","unstructured":"G. Jacopini and M. Venturini Zilli. Easy terms in the lambda calculus. Fund. Inform., 80:225\u2013233, 1985.","journal-title":"Fund. Inform."},{"key":"2_CR25","unstructured":"R. Kerth. Isomorphisme et \u00c9quivalence \u00c9quationnelle entre Mod\u00e8les du \u03bb-Calcul. PhD thesis, Equipe de Logique Math\u00e9matique, Universit\u00e9 Paris VII, 1995."},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/inco.1997.2655","volume":"138","author":"J. Kuper","year":"1997","unstructured":"J. Kuper. On the Jacopini technique. Inform. and Comput., 138:101\u2013123, 1997.","journal-title":"Inform. and Comput."},{"key":"2_CR27","unstructured":"J. Mitchell. Foundation for Programmimg Languages. MIT Press, 1996."},{"issue":"1-2","key":"2_CR28","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0304-3975(93)90094-A","volume":"121","author":"G. D. Plotkin","year":"1993","unstructured":"G. D. Plotkin. Set-theoretical and other elementary models of the \u03bb-calculus. Theoret. Comput. Sci., 121(1-2):351\u2013409, 1993.","journal-title":"Theoret. Comput. Sci"},{"key":"2_CR29","first-page":"561","volume-title":"To H. B. Curry: essays on combinatory logic, lambda calculus and formalism","author":"G. Pottinger","year":"1980","unstructured":"G. Pottinger. A type assignment for the strongly normalizable \u03bbterms. In R. Hindley and J. Seldin, editors, To H. B. Curry: essays on combinatory logic, lambda calculus and formalism, pages 561\u2013577. Academic Press, London, 1980."},{"issue":"5","key":"2_CR30","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1017\/S0960129598002722","volume":"9","author":"A. Pravato","year":"1999","unstructured":"A. Pravato, S. Ronchi, and L. Roversi. The call-by-value lambda calculus: a semantic investigation. Math. Struct. in Comput. Sci., 9(5):617\u2013650, 1999.","journal-title":"Math. Struct. in Comput. Sci."},{"key":"2_CR31","series-title":"Lecture Notes in Math.","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0073967","volume-title":"Toposes, algebraic geometry and logic","author":"D. Scott","year":"1972","unstructured":"D. Scott. Continuous lattices. In F. Lawvere, editor, Toposes, algebraic geometry and logic, volume 274 of Lecture Notes in Math., pages 97\u2013136. Springer, Berlin, 1972."},{"key":"2_CR32","volume-title":"Topology via logic","author":"S. Vickers","year":"1989","unstructured":"S. Vickers. Topology via logic. Cambridge University Press, Cambridge, 1989."},{"key":"2_CR33","unstructured":"C. Zylberajch. Syntaxe et Semantique de la Facilit\u00e9 en Lambda-calcul. PhD thesis, Universit\u00e9 Paris VII, 1991."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45446-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T05:24:14Z","timestamp":1550467454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45446-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426721","9783540454465"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-45446-2_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}