{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T11:19:53Z","timestamp":1791890393502,"version":"4.3.4"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":3850,"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":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00548-0","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T17:15:47Z","timestamp":1035825347000},"page":"975-1019","source":"Crossref","is-referenced-by-count":8,"title":["Normalization, approximation, and semantics for combinator systems"],"prefix":"10.1016","volume":"290","author":[{"given":"Steffen","family":"van Bakel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(02)00548-0_BIB1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(92)90297-S","article-title":"Complete restrictions of the intersection type discipline","volume":"102","author":"van Bakel","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"10.1016\/S0304-3975(02)00548-0_BIB2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1093\/logcom\/3.6.643","article-title":"Principal type schemes for the strict type assignment system","volume":"3","author":"van Bakel","year":"1993","journal-title":"Logic Comput."},{"issue":"2","key":"10.1016\/S0304-3975(02)00548-0_BIB3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0304-3975(95)00073-6","article-title":"Intersection type assignment systems","volume":"151","author":"van Bakel","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00548-0_BIB4","series-title":"Proc. HOA \u201995. Second Internat. Workshop on Higher Order Algebra, Logic and Term Rewriting, Paderborn, Germany. Selected Papers","first-page":"17","article-title":"Approximation and normalization results for typeable term rewriting systems","volume":"Vol. 1074","author":"van Bakel","year":"1996"},{"issue":"2","key":"10.1016\/S0304-3975(02)00548-0_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/inco.1996.2617","article-title":"Normalization results for typeable rewrite systems","volume":"133","author":"van Bakel","year":"1997","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(02)00548-0_BIB6","series-title":"The Lambda Calculus: its Syntax and Semantics","author":"Barendregt","year":"1984"},{"issue":"4","key":"10.1016\/S0304-3975(02)00548-0_BIB7","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\/S0304-3975(02)00548-0_BIB8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/malq.19810270205","article-title":"Functional characters of solvable terms","volume":"27","author":"Coppo","year":"1981","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"10.1016\/S0304-3975(02)00548-0_BIB9","doi-asserted-by":"crossref","unstructured":"H.B. Curry, Grundlagen der Kombinatorischen Logik, Amer. J. Math. 52 (1930) 509\u2013536, 789\u2013834.","DOI":"10.2307\/2370619"},{"key":"10.1016\/S0304-3975(02)00548-0_BIB10","doi-asserted-by":"crossref","unstructured":"H.B. Curry, Functionality in combinatory logic, in: Proc. Natl. Acad. Sci., USA, Vol. 20, 1934, pp. 584\u2013590.","DOI":"10.1073\/pnas.20.11.584"},{"key":"10.1016\/S0304-3975(02)00548-0_BIB11","unstructured":"H.B. Curry, R. Feys, Combinatory Logic, Vol. 1, North-Holland, Amsterdam, 1958."},{"key":"10.1016\/S0304-3975(02)00548-0_BIB12","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, J.P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, North-Holland, 1990, pp. 245\u2013320. (Chapter 6).","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"10.1016\/S0304-3975(02)00548-0_BIB13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(92)90306-Z","article-title":"Intersection types for combinatory logic","volume":"100","author":"Dezani-Ciancaglini","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00548-0_BIB14","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J. Goguen, J.P. Jouannaud, J. Meseguer, Principles of OBJ2, in: Proc. 12th ACM Symp. on Principles of Programming Languages, 1985, pp. 52\u201366.","DOI":"10.1145\/318593.318610"},{"key":"10.1016\/S0304-3975(02)00548-0_BIB15","series-title":"Handbook of Theoretical Computer Science","first-page":"633","article-title":"Semantic domains","author":"Gunter","year":"1990"},{"key":"10.1016\/S0304-3975(02)00548-0_BIB16","series-title":"Computational Logic. Essays in Honour of Alan Robinson","article-title":"Computations in orthogonal rewriting systems","author":"Huet","year":"1991"},{"key":"10.1016\/S0304-3975(02)00548-0_BIB17","first-page":"1","article-title":"Term rewriting systems","volume":"Vol. 2","author":"Klop","year":"1992"},{"key":"10.1016\/S0304-3975(02)00548-0_BIB18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0747-7171(08)80124-1","article-title":"Sequentiality in orthogonal term rewriting systems","volume":"12","author":"Klop","year":"1991","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(02)00548-0_BIB19","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0304-3975(83)90069-5","article-title":"Principal type schemes for an extended type theory","volume":"28","author":"Ronchi Della Rocca","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(02)00548-0_BIB20","doi-asserted-by":"crossref","first-page":"198","DOI":"10.2307\/2271658","article-title":"Intensional interpretation of functionals of finite type I","volume":"32","author":"Tait","year":"1967","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(02)00548-0_BIB21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(89)90139-4","article-title":"Full abstraction and limiting completeness in equational languages","volume":"65","author":"Thatte","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00548-0_BIB22","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott's D\u221e-models of the lambda-calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502005480?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502005480?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T19:30:12Z","timestamp":1554406212000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502005480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502005480"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00548-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}