{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:14:27Z","timestamp":1649027667181},"reference-count":47,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2695,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1016\/j.tcs.2005.11.005","type":"journal-article","created":{"date-parts":[[2005,12,6]],"date-time":"2005-12-06T12:21:10Z","timestamp":1133871670000},"page":"4-23","source":"Crossref","is-referenced-by-count":8,"title":["Easiness in graph models"],"prefix":"10.1016","volume":"354","author":[{"given":"C.","family":"Berline","sequence":"first","affiliation":[]},{"given":"A.","family":"Salibra","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2005.11.005_bib1","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"},{"key":"10.1016\/j.tcs.2005.11.005_bib2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.tcs.2004.01.022","article-title":"Intersection types and domain operators","volume":"316","author":"Alessi","year":"2004","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2005.11.005_bib3","series-title":"Intersection Types and Related Systems, ELNTCS 70","article-title":"Simple easy terms","author":"Alessi","year":"2002"},{"key":"10.1016\/j.tcs.2005.11.005_bib4","doi-asserted-by":"crossref","unstructured":"J. Baeten, B. Boerboom, Omega can be anything it should not be, in: Proc. of the Koninklijke Nederlandse Akademie van Wetenschappen, Serie A, Indag. Mathematicae 41, 1979, pp. 111\u2013120.","DOI":"10.1016\/1385-7258(79)90016-7"},{"key":"10.1016\/j.tcs.2005.11.005_bib5","unstructured":"H.P. Barendregt, The lambda-calculus, its syntax and semantics, Studies in Logic, Vol. 103, revised edition, North-Holland, Amsterdam, 1984."},{"key":"10.1016\/j.tcs.2005.11.005_bib6","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","article-title":"A filter model and the completeness of type assignment","volume":"48","author":"Barendregt","year":"1983","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/j.tcs.2005.11.005_bib7","unstructured":"O. Bastonero, Mod\u00e8les fortement stables du \u03bb-calcul et r\u00e9sultats d\u2019incompl\u00e9tude, Th\u00e8se, Universit\u00e9 de Paris 7, 1996."},{"key":"10.1016\/j.tcs.2005.11.005_bib8","unstructured":"O. Bastonero, Equational incompleteness and incomparability results for \u03bb-calculus semantics, manuscript, 1998."},{"issue":"10","key":"10.1016\/j.tcs.2005.11.005_bib9","first-page":"905","article-title":"Stabilit\u00e9 forte et incompl\u00e9tude de la classe des mod\u00e8les stables du \u03bb-calcul","volume":"322","author":"Bastonero","year":"1996","journal-title":"C. R. Acad. Sci. Paris Sr. I Math."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2005.11.005_bib10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0168-0072(99)00015-9","article-title":"Strong stability and the incompleteness of stable models of \u03bb-calculus","volume":"100","author":"Bastonero","year":"1999","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/j.tcs.2005.11.005_bib11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0304-3975(00)00057-8","article-title":"From computation to foundations via functions and application: the lambda-calculus and its webbed models","volume":"249","author":"Berline","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2005.11.005_bib12","doi-asserted-by":"crossref","unstructured":"G. Berry, Stable models of typed lambda-calculi, in: Proc. Fifth Int. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 62, Springer, Berlin, 1978.","DOI":"10.1007\/3-540-08860-1_7"},{"key":"10.1016\/j.tcs.2005.11.005_bib13","series-title":"Sixth Annual IEEE Symposium on Logic in Computer Science","first-page":"138","article-title":"Sequentiality and strong stability","author":"Bucciarelli","year":"1991"},{"key":"10.1016\/j.tcs.2005.11.005_bib14","doi-asserted-by":"crossref","unstructured":"A. Bucciarelli, A. Salibra, The minimal graph-model of lambda-calculus, in: 28th Internat. Symp. on Math. Foundations of Comput. Science, Lecture Notes in Computer Science, Vol. 2747, Springer, Berlin, 2003, pp. 300\u2013307.","DOI":"10.1007\/978-3-540-45138-9_24"},{"key":"10.1016\/j.tcs.2005.11.005_bib15","series-title":"19th Ann. Symp. on Logic in Computer Science (LICS\u201904)","first-page":"276","article-title":"The sensible graph theories of lambda-calculus","author":"Bucciarelli","year":"2004"},{"key":"10.1016\/j.tcs.2005.11.005_bib16","series-title":"Logic Colloquium \u201982 (Florence, 1982)","first-page":"241","article-title":"Extended type structures and filter lambda models","author":"Coppo","year":"1984"},{"key":"10.1016\/j.tcs.2005.11.005_bib17","first-page":"53","article-title":"Computing with B\u00f6hm trees","volume":"45","author":"David","year":"2001","journal-title":"Fund. Inform."},{"key":"10.1016\/j.tcs.2005.11.005_bib18","unstructured":"M. Dezani-Ciancaglini, S. Lusin, Intersection types and lambda theories, in: S. Soloviev, R. Di Cosmo, G. Longo (Eds.), International Workshop on Isomorphisms of Types, 2002."},{"issue":"3","key":"10.1016\/j.tcs.2005.11.005_bib19","first-page":"289","article-title":"Algebras and combinators","volume":"13","author":"Engeler","year":"1981","journal-title":"Algebra Universalis"},{"key":"10.1016\/j.tcs.2005.11.005_bib20","unstructured":"X. Gouy, Etude des th\u00e9ories \u00e9quationnelles et des propri\u00e9t\u00e9s alg\u00e9briques des mod\u00e8les stables du \u03bb-calcul, Th\u00e8se, Universit\u00e9 de Paris 7, 1995."},{"key":"10.1016\/j.tcs.2005.11.005_bib21","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","article-title":"An approximation theorem for topological incompleteness of lambda calculus","volume":"45","author":"Honsell","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2005.11.005_bib22","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","article-title":"A syntactic characterization of the equality in some models of the \u03bb-calculus","volume":"12","author":"Hyland","year":"1976","journal-title":"J. London Math. Soc."},{"key":"10.1016\/j.tcs.2005.11.005_bib23","doi-asserted-by":"crossref","unstructured":"C. Jacopini, A condition for identifying two elements in whatever model of combinatory logic, in: C. B\u00f6hm (Ed.), Lecture Notes in Computer Science, Vol. 37, Springer, Berlin, 1975.","DOI":"10.1007\/BFb0029527"},{"key":"10.1016\/j.tcs.2005.11.005_bib24","unstructured":"Y. Jiang, Consistance et inconsistance de th\u00e9ories de \u03bb-calcul \u00e9tendus, Th\u00e8se, Universit\u00e9 Paris 7, 1993."},{"issue":"2","key":"10.1016\/j.tcs.2005.11.005_bib25","first-page":"79","article-title":"Consistency of a \u03bb-theory with n-tuples and easy terms","volume":"34","author":"Jiang","year":"1995","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/j.tcs.2005.11.005_bib26","first-page":"587","article-title":"2\u03c9 mod\u00e8les de graphes non \u00e9quationnellement \u00e9quivalents","volume":"318","author":"Kerth","year":"1994","journal-title":"Notes comptes-rendus de l\u2019Acad\u00e9mie Sciences"},{"key":"10.1016\/j.tcs.2005.11.005_bib27","unstructured":"R. Kerth, Isomorphisme et \u00e9quivalence \u00e9quationnelle entre mod\u00e8les du \u03bb-calcul, Th\u00e8se, Universit\u00e9 de Paris 7, 1995."},{"key":"10.1016\/j.tcs.2005.11.005_bib28","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1023\/A:1005018121791","article-title":"Isomorphism and equational equivalence of continuous \u03bb-models","volume":"61","author":"Kerth","year":"1998","journal-title":"Studia Logica"},{"key":"10.1016\/j.tcs.2005.11.005_bib29","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.2307\/2586665","article-title":"The interpretation of unsolvable terms in models of pure \u03bb-calculus","volume":"63","author":"Kerth","year":"1998","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/j.tcs.2005.11.005_bib30","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0019-3577(99)80005-6","article-title":"Forcing in stable models of untyped \u03bb-calculus","volume":"10","author":"Kerth","year":"1999","journal-title":"Indag. Math."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2005.11.005_bib31","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0304-3975(00)00371-6","article-title":"On the construction of stable models of untyped \u03bb-calculus","volume":"269","author":"Kerth","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2005.11.005_bib32","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","article-title":"Set-theoretical models of \u03bb-calculus: theories, expansions and isomorphisms","volume":"24","author":"Longo","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"10.1016\/j.tcs.2005.11.005_bib33","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1093\/logcom\/14.3.373","article-title":"The lattice of lambda-theories","volume":"14","author":"Lusin","year":"2004","journal-title":"J. Logic Comput."},{"key":"10.1016\/j.tcs.2005.11.005_bib34","volume":"Vol. I","author":"McKenzie","year":"1987"},{"key":"10.1016\/j.tcs.2005.11.005_bib35","unstructured":"D. Pigozzi, A. Salibra, An introduction to lambda abstraction algebras, in: IX Simposio Latinoamericano de Logica Matematica, Notas de Logica Matematica, Vol. 38, Universidad Nacional del Sur, Bahia Blanca, Argentina, 1993, pp. 93\u2013112."},{"key":"10.1016\/j.tcs.2005.11.005_bib36","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(94)00203-U","article-title":"Lambda abstraction algebras: representation theorems","volume":"140","author":"Pigozzi","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2005.11.005_bib37","unstructured":"G.D. Plotkin, A set-theoretical definition of application, Memorandum MIP-R-95, School of Artificial Intelligence, University of Edinburgh, 1972."},{"key":"10.1016\/j.tcs.2005.11.005_bib38","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\/j.tcs.2005.11.005_bib39","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0304-3975(00)00059-1","article-title":"On the algebraic models of \u03bb-calculus","volume":"249","author":"Salibra","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2005.11.005_bib40","first-page":"379","article-title":"Nonmodularity results for lambda-calculus","volume":"45","author":"Salibra","year":"2001","journal-title":"Fund. Inform."},{"key":"10.1016\/j.tcs.2005.11.005_bib41","series-title":"16th Ann. IEEE Symp. on Logic in Computer Science (LICS\u201901)","first-page":"334","article-title":"A continuum of theories of lambda calculus without semantics","author":"Salibra","year":"2001"},{"key":"10.1016\/j.tcs.2005.11.005_bib42","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/772062.772067","article-title":"Topological incompleteness and order incompleteness of the lambda calculus","volume":"4","author":"Salibra","year":"2003","journal-title":"ACM Trans. Comput. Log."},{"key":"10.1016\/j.tcs.2005.11.005_bib43","doi-asserted-by":"crossref","unstructured":"D.S. Scott, Continuous lattices, toposes, algebraic geometry and logic, in: Lecture Notes in Mathematics, Vol. 274, Springer, Berlin, 1972.","DOI":"10.1007\/BFb0073967"},{"key":"10.1016\/j.tcs.2005.11.005_bib44","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0304-3975(02)00038-5","article-title":"Order-incompleteness and finite lambda reduction models","volume":"309","author":"Selinger","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2005.11.005_bib45","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism","first-page":"259","article-title":"Numerations, \u03bb-calculus and arithmetic","author":"Visser","year":"1980"},{"key":"10.1016\/j.tcs.2005.11.005_bib46","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for D\u221e-models of the lambda-calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2005.11.005_bib47","unstructured":"C. Zylberajch, Syntaxe et s\u00e9mantique de la facilit\u00e9 en \u03bb-calcul, Th\u00e8se, Universit\u00e9 Paris 7, 1991."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397505008510?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397505008510?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T11:06:13Z","timestamp":1586603173000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397505008510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["S0304397505008510"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2005.11.005","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2006,3]]}}}