{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:08Z","timestamp":1761610328583,"version":"build-2065373602"},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3831,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s1571-0661(04)80487-0","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Simple Easy Terms"],"prefix":"10.1016","volume":"70","author":[{"given":"F.","family":"Alessi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Lusin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"Domain theory in logical form","volume":"51","author":"Abramsky","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1044","article-title":"Full abstraction in the lazy lambda calculus","volume":"105","author":"Abramsky","year":"1993","journal-title":"Inform. and Comput"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB3","unstructured":"F. Alessi. Structure di tipi, teoria dei domini e modelli del lambda calcolo. PhD thesis, Torino University, 1991."},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB4","doi-asserted-by":"crossref","unstructured":"F. Alessi, M. Dezani-Ciancaglini, and F. Honsell. Filter models and easy terms. In A. Restivo, S. Ronchi della Rocca, and L. Roversi, editors, Mathematical Foundations of Computer Science 2000, volume 2202 of Lecture Notes in Comput. Sci., pages 17\u201337. Springer, 2001.","DOI":"10.1007\/3-540-45446-2_2"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/1385-7258(79)90016-7","article-title":"\u03c9 can be anything it shouldn't be","volume":"41","author":"Baeten","year":"1979","journal-title":"Indag. Math"},{"issue":"4","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB6","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","article-title":"A filter lambda model and the completeness of type assignment","volume":"48","author":"Barendregt","year":"1983","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB7","series-title":"Logic and Algebra, number 180 in Lecture Notes in Pure and Applied Mathematics","first-page":"339","article-title":"Infinite \u03bb-calculus and non-sensible models","author":"Berarducci","year":"1996"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(93)90084-7","article-title":"Some new results on easy lambda-terms","volume":"121","author":"Berarducci","year":"1993","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB9","series-title":"Logic: From Foundations to applications","first-page":"33","article-title":"Church-Rosser \u03bb-theories, infinite \u03bb-calculus and consistency problems","author":"Berarducci","year":"1996"},{"issue":"4","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB10","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","article-title":"An extension of the basic functionality theory for the \u03bb-calculus","volume":"21","author":"Coppo","year":"1980","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB11","series-title":"Logic colloquium '82","first-page":"241","article-title":"Extended type structures and filter lambda models","author":"Coppo","year":"1984"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB12","series-title":"To H. B. Curry: essays on combinatory logic, lambda calculus and formalism","first-page":"535","article-title":"Principal type schemes and \u03bb-calculus semantics","author":"Coppo","year":"1980"},{"issue":"2","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","article-title":"Type theories, normal forms, and D\u221e-lambda-models","volume":"72","author":"Coppo","year":"1987","journal-title":"Inform. and Comput"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB14","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":"10.1016\/S1571-0661(04)80487-0_NEWBIB15","doi-asserted-by":"crossref","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.","DOI":"10.1007\/BFb0037102"},{"issue":"2","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB16","first-page":"149","article-title":"Operational, denotational and logical descriptions: a case study","volume":"16","author":"Egidi","year":"1992","journal-title":"Fund. Inform"},{"issue":"4","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/malq.19800261902","article-title":"Lambda-calculus models and extensionality","volume":"26","author":"Hindley","year":"1980","journal-title":"Z. Math. Logik Grundlag. Math"},{"issue":"1\u20132","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0304-3975(98)00140-6","article-title":"Semantical analysis of perpetual strategies in \u03bb-calculus","volume":"212","author":"Honsell","year":"1999","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB19","unstructured":"F. Honsell and S. Ronchi Della Rocca. A filter model for \u03a9. Technical report, Torino University, 1984."},{"issue":"1","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB20","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","article-title":"An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus","volume":"45","author":"Honsell","year":"1992","journal-title":"J. Comput. System Sci"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB21","first-page":"99","article-title":"A problem on easy terms in \u03bb-calculus","volume":"15.1","author":"Intrigila","year":"1991","journal-title":"Fund. Inform"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB22","doi-asserted-by":"crossref","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.","DOI":"10.1007\/BFb0029527"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB23","first-page":"225","article-title":"Easy terms in the lambda calculus","volume":"80","author":"Jacopini","year":"1985","journal-title":"Fund. Inform"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB24","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1006\/inco.1997.2655","article-title":"On the Jacopini technique","volume":"138","author":"Kuper","year":"1997","journal-title":"Inform. and Comput"},{"issue":"1\u20132","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB25","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0304-3975(93)90094-A","article-title":"Set-theoretical and other elementary models of the \u03bb-calculus","volume":"121","author":"Plotkin","year":"1993","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB26","series-title":"To H. B. Curry: essays on combinatory logic, lambda calculus and formalism","first-page":"561","article-title":"A type assignment for the strongly normalizable \u03bb-terms","author":"Pottinger","year":"1980"},{"issue":"5","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB27","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1017\/S0960129598002722","article-title":"The call-by-value lambda calculus: a semantic investigation","volume":"9","author":"Pravato","year":"1999","journal-title":"Math. Struct. in Comput. Sci"},{"key":"10.1016\/S1571-0661(04)80487-0_NEWBIB28","doi-asserted-by":"crossref","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.","DOI":"10.1007\/BFb0073967"},{"year":"1989","series-title":"Topology via logic","author":"Vickers","key":"10.1016\/S1571-0661(04)80487-0_NEWBIB29"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804870?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804870?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:09Z","timestamp":1761609969000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804870"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104804870"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80487-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Simple Easy Terms","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80487-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}