{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:10:54Z","timestamp":1761610254086,"version":"build-2065373602"},"reference-count":21,"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)80493-6","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"106-123","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reducibility"],"prefix":"10.1016","volume":"70","author":[{"given":"Silvia","family":"Ghilezan","sequence":"first","affiliation":[]},{"given":"Silvia","family":"Likavec","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB1","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":"Journal of Symbolic Logic"},{"year":"1984","series-title":"\u201cThe Lambda Calculus: its Syntax and Semantics,\u201d","author":"Barendregt","key":"10.1016\/S1571-0661(04)80493-6_NEWBIB2"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB3","first-page":"117","article-title":"Lambda calculi with types","volume":"Volume B","author":"Barendregt","year":"1992"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02011875","article-title":"A new type-assignment for lambda terms","volume":"19","author":"Coppo","year":"1978","journal-title":"Archiv f\u00fcr Mathematische Logik"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB5","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 Journal of Formal Logic"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB6","unstructured":"Dezani-Ciancaglini M. and S. Ghilezan, A lambda model characterizing computational behaviours of terms, in: Y. Toyama, editor, Proceedings of the International Workshop Rewriting in Proof and Computation, RPC'01, 2001, pp. 100\u2013119."},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB7","first-page":"304","article-title":"Compositional characterization of \u03bb-terms using intersection types","volume":"1893","author":"Dezani-Ciancaglini","year":"2000"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB8","doi-asserted-by":"crossref","unstructured":"Dougherty D. and P. Lescanne, Reductions, intersection types, and explicit substitution, in: S. Abramsky, editor, Typed Lambda Calculi and Application, 5th International Conference, TLCA 2001, Lecture Notes in Computer Science 2044 (2001), pp. 121\u2013135.","DOI":"10.1007\/3-540-45413-6_13"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0168-0072(97)00047-X","article-title":"Typing untyped \u03bb-terms, or reducibility strikes again!","volume":"91","author":"Gallier","year":"1998","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB10","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1305\/ndjfl\/1040067315","article-title":"Strong normalization and typability with intersection types","volume":"37","author":"Ghilezan","year":"1996","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB11","doi-asserted-by":"crossref","unstructured":"Girard J.-Y., Une extension de l'interpr\u00e9tation de G\u00f6del \u00e0 l'analyse, et son application \u00e0 l'elimination des coupures dans l'analyse et la th\u00e9orie des types, in: J. Fenstad, editor, 2nd Scandinavian Logic Symposium, North-Holland, Amsterdam (1971), pp. 63\u201392.","DOI":"10.1016\/S0049-237X(08)70843-7"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB12","doi-asserted-by":"crossref","first-page":"782","DOI":"10.2307\/2274330","article-title":"Church-Rosser theorem for typed functionals","volume":"50","author":"Koletsos","year":"1985","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB13","unstructured":"Koletsos G. and G. Stavrinos, The structure of reducibility proofs, in: P. Kolaitis and G. Koletsos, editors, Proceedings of the Second Panhellenic Logic Symposium, 1999, pp. 138\u2013144."},{"year":"1990","series-title":"\u201cLambda-calcul types et mod\u00e8les,\u201d","author":"Krivine","key":"10.1016\/S1571-0661(04)80493-6_NEWBIB14"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB15","unstructured":"Mitchell, J. C., \u201cFoundation for Programming Languages,\u201d MIT Press, Boston"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB16","first-page":"415","article-title":"Type systems for programming languages","volume":"Volume B","author":"Mitchell","year":"1990"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB17","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"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB18","doi-asserted-by":"crossref","unstructured":"Sall\u00e9, P., Une extension de la thorie des types en lambda -calcul, in: G. Ausiello and C. B\u00f6hm, editors, Fifth International Conference on Automata, Languages and Programming, Lecture Notes in Computer Science 62 (1978), pp. 398\u2013410.","DOI":"10.1007\/3-540-08860-1_30"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB19","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0019-9958(85)80001-2","article-title":"Logical relations and the typed \u03bb-calculus","volume":"65","author":"Statman","year":"1985","journal-title":"Information and Control"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB20","doi-asserted-by":"crossref","first-page":"198","DOI":"10.2307\/2271658","article-title":"Intensional interpretations of functionals of finite type I","volume":"32","author":"Tait","year":"1967","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/S1571-0661(04)80493-6_NEWBIB21","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/BFb0064875","article-title":"A realizability interpretation of the theory of species","volume":"453","author":"Tait","year":"1975","journal-title":"Logic Colloquium, Lecture Notes in Mathematics"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804936?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804936?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:05:59Z","timestamp":1761609959000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104804936"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80493-6","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":"Reducibility","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)80493-6","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"}]}}