{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T20:40:57Z","timestamp":1682628057743},"reference-count":51,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":4859,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s1571-0661(04)00170-7","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"145-158","source":"Crossref","is-referenced-by-count":1,"title":["Towards Lambda Calculus Order-Incompleteness"],"prefix":"10.1016","volume":"50","author":[{"given":"Antonino","family":"Salibra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00170-7_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":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1044","article-title":"Full abstraction in the lazy \u03bb-calculus","volume":"105","author":"Abramsky","year":"1993","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB3","volume":"103","author":"Barendregt","year":"1984"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB4","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","article-title":"A filter model and the completeness of type assignmen","volume":"48","author":"Barendregt","year":"1983","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB5","unstructured":"Bastonero O., \u201cMod\u00e9les fortement stables du \u03bb-calcul et r\u00e9sultats d'incompl\u00e9tude\u201d, Th\u00e9se, Universit\u00e9 de Paris 7, 1996."},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB6","unstructured":"Bastonero O., Equational incompleteness and incomparability results for \u03bb-calculus semantics, manuscript."},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB7","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":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s000120050120","article-title":"Topological implications in varieties","volume":"42","author":"Bentz","year":"1999","journal-title":"Algebra Universalis"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB9","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 \u03bb-calculus and its webbed models","volume":"249","author":"Berline","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Berry G., Stable models of typed lambda-calculi, Proc. 5th Int. Coll. on Automata, Languages and Programming, LNCS vol.62, Springer-Verlag, 1978","DOI":"10.1007\/3-540-08860-1_7"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB11","doi-asserted-by":"crossref","unstructured":"Bucciarelli A. and T. Ehrhard, Sequentiality and strong stability, Sixth Annual IEEE Symposium on Logic in Computer Science (1991), 138\u2013145.","DOI":"10.1109\/LICS.1991.151638"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB12","series-title":"\u201cA course in universal algebra\u201d","author":"Burris","year":"1981"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BF01190970","article-title":"Separation in topological algebras","volume":"35","author":"Coleman","year":"1996","journal-title":"Algebra Universalis"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB14","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/s000120050048","article-title":"Topological equivalents to n-permutability","volume":"38","author":"Coleman","year":"1997","journal-title":"Algebra Universalis"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB15","series-title":"Logic Colloquium'82","first-page":"241","article-title":"Extended type structures and filter \u03bb-models","author":"Coppo","year":"1984"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB16","volume":"Vol. I","author":"Curry","year":"1958"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1017\/S0960129500000281","article-title":"Hypercoherences: a strongly stable model of linear logic","volume":"2","author":"Ehrhard","year":"1993","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB18","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02483849","article-title":"Algebras and combinators","volume":"13","author":"Engeler","year":"1981","journal-title":"Algebra Universalis"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","article-title":"The system F of variable types, fifteen years later","volume":"45","author":"Girard","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB20","unstructured":"Gouy X., \u201cEtude des th\u00e9ories \u00e9quationnelles et des propri\u00e9t\u00e9s alg\u00e9briques des mod\u00e9les stables du \u03bb-calcul\u201d, Th\u00e8se, Universit\u00e9 de Paris 7, 1995."},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB21","series-title":"\u201cUniversal Algebra\u201d","author":"Gr\u00e4tzer","year":"1979"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB22","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF01201098","article-title":"Topological implications in n-permutable varieties","volume":"19","author":"Gumm","year":"1984","journal-title":"Algebra Universalis"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB23","series-title":"LNCS 902 1995","first-page":"249","article-title":"Final semantics for untyped \u03bb-calculus","author":"Honsell","year":"1995"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB24","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","article-title":"An approximation theorem for topological \u03bb-models and the topological incompleteness of \u03bb-calculus","volume":"45","author":"Honsell","year":"1992","journal-title":"Journal Computer and System Science"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB25","series-title":"\u201cStone Spaces\u201d","author":"Johnstone","year":"1982"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB26","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1023\/A:1005018121791","article-title":"Isomorphism and equational equivalence of continuous lambda models","volume":"61","author":"Kerth","year":"1998","journal-title":"Studia Logica"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB27","doi-asserted-by":"crossref","unstructured":"Kerth R., On the construction of stable models of \u03bb-calculus, Theoretical Computer Science (to appear).","DOI":"10.1016\/S0304-3975(00)00371-6"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB28","series-title":"\u201cLambda-Calcul, types et mod\u00e8les\u201d","author":"Krivine","year":"1990"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB29","series-title":"\u201cAlgebras, Lattices, Varieties, Volume I\u201d","author":"McKenzie","year":"1987"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB30","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","article-title":"What is a model of the lambda calculus?","volume":"52","author":"Meyer","year":"1982","journal-title":"Information and Control"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB31","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB32","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01053036","article-title":"The abstract variable-binding calculus","volume":"55","author":"Pigozzi","year":"1995","journal-title":"Studia Logica"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB33","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/FI-1998-33203","article-title":"Lambda abstraction algebras: coordinatizing models of lambda calculus","volume":"33","author":"Pigozzi","year":"1998","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB34","unstructured":"Plotkin G.D., A set theoretic definition of application, Memorandum MIP-R-95, University of Edinburgh, 1972."},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB35","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB36","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1006\/inco.1996.0035","article-title":"On a question of H. Friedman","volume":"126","author":"Plotkin","year":"1996","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB37","doi-asserted-by":"crossref","unstructured":"Salibra A., A continuum of theories of lambda calculus without semantics, 16th Annual IEEE Symposium on Logic in Computer Science (2001), Boston, USA.","DOI":"10.1109\/LICS.2001.932509"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB38","unstructured":"Salibra A., Nonmodularity results for lambda calculus, Fundamenta Informaticae (to appear)."},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB39","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0304-3975(00)00059-1","article-title":"On the algebraic models of lambda calculus","volume":"249","author":"Salibra","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB40","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/inco.1998.2745","article-title":"A finite equational axiomatization of the functional algebras for the lambda calculus","volume":"148","author":"Salibra","year":"1999","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB41","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nfinkel M., Uber die bausteine der Mathematischen Logik, Mathematischen Annalen (english translation in J. van Heijenoort ed.'s book\u201cFrom Frege to G\u00f6del, a source book in Mathematical Logic, 1879-1931\u201d, Harvard University Press, 1967), 92 (1924), 305\u2013316","DOI":"10.1007\/BF01448013"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB42","doi-asserted-by":"crossref","unstructured":"Scott D.S., Some ordered sets in computer science, In: Ordered sets (I. Rival ed.), Proc. of the NATO Advanced Study Institute (Banff, Canada), Reidel (1981), 677\u2013718","DOI":"10.1007\/978-94-009-7798-3_22"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB43","series-title":"Toposes, Algebraic geometry and Logic","first-page":"97","article-title":"Continuous lattices","author":"Scott","year":"1972"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB44","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB45","doi-asserted-by":"crossref","unstructured":"Scott D.S., Lambda calculus: some models, some philosophy, The Kleene Symposium (J. Barwise, H.J. Keisler, and K. Kunen eds.), Studies in Logic 101, North-Holland, 1980.","DOI":"10.1016\/S0049-237X(08)71262-X"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB46","series-title":"Handbook of Theoretical Computer Science","article-title":"Semantic domains","author":"Scott","year":"1990"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB47","unstructured":"Selinger P., \u201cFunctionality, polymorphism, and concurrency: a mathematical investigation of programming paradigms\u201d, PhD thesis, University of Pennsylvania, 1997."},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB48","doi-asserted-by":"crossref","unstructured":"Selinger P., Order-incompleteness and finite lambda models, Eleventh Annual IEEE Symposium on Logic in Computer Science (1996).","DOI":"10.1109\/LICS.1996.561459"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB49","series-title":"\u201cCounterexamples in topology\u201d","author":"Steen","year":"1978"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB50","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1017\/S1446788700018218","article-title":"Varieties of topological algebras","volume":"23","author":"Taylor","year":"1977","journal-title":"Austral. Math. Soc"},{"key":"10.1016\/S1571-0661(04)00170-7_NEWBIB51","doi-asserted-by":"crossref","first-page":"498","DOI":"10.4153\/CJM-1977-054-9","article-title":"Varieties obeying homotopy laws","volume":"29","author":"Taylor","year":"1977","journal-title":"Canad. Journal Math"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001707?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001707?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T20:12:09Z","timestamp":1682626329000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S1571066104001707"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00170-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}