{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:49:57Z","timestamp":1768258197591,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,3,21]],"date-time":"2004-03-21T00:00:00Z","timestamp":1079827200000},"content-version":"vor","delay-in-days":4677,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1016\/0304-3975(91)90037-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"3-28","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":40,"title":["Polymorphic rewriting conserves algebraic strong normalization"],"prefix":"10.1016","volume":"83","author":[{"given":"Val","family":"Breazu-Tannen","sequence":"first","affiliation":[]},{"given":"Jean","family":"Gallier","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90037-3_BIB1","series-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/0304-3975(91)90037-3_BIB2","article-title":"Combining term rewriting and type assignment systems","author":"Barbanera","year":"1989","journal-title":"Proc. Conf. Italian Chapter of EATCS"},{"key":"10.1016\/0304-3975(91)90037-3_BIB3","author":"Breazu-Tannen","year":"1989","journal-title":"Polymorphic rewriting conserves algebraic confluence"},{"key":"10.1016\/0304-3975(91)90037-3_BIB4","series-title":"Proc. 14th Symp. on Principles of Programming Languages","first-page":"238","article-title":"Computable values can be classical","author":"Breazu-Tannen","year":"1987"},{"key":"10.1016\/0304-3975(91)90037-3_BIB5","series-title":"Proc. Symp. on Logic in Computer Science","first-page":"82","article-title":"Combining algebra and higher-order types","author":"Breazu-Tannen","year":"1988"},{"key":"10.1016\/0304-3975(91)90037-3_BIB6","first-page":"95","article-title":"The calculus of constructions","volume":"76","author":"Coquand","year":"1988","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90037-3_BIB7","series-title":"Another view of combining \u03b2-reduction and algebraic rewriting","author":"Dung","year":"1989"},{"key":"10.1016\/0304-3975(91)90037-3_BIB8","series-title":"Adding algebraic rewriting to the untyped lambda calculus","author":"Dougherty","year":"1989"},{"key":"10.1016\/0304-3975(91)90037-3_BIB9","series-title":"Fundamentals of Algebraic-Specification 1: Equations and Initial Semantics","author":"Ehrig","year":"1985"},{"key":"10.1016\/0304-3975(91)90037-3_BIB10","series-title":"Logic and Computer Science","article-title":"On Girard's \u201cCandidats de Reductibilit\u00e9\u201d","author":"Gallier","year":"1990"},{"key":"10.1016\/0304-3975(91)90037-3_BIB11","series-title":"PhD thesis","article-title":"Interpr\u00e9tation fonctionelle et \u00e9limination des coupures dans l'arithm\u00e9tique d'ordre sup\u00e9rieure","author":"Girard","year":"1972"},{"key":"10.1016\/0304-3975(91)90037-3_BIB12","series-title":"Typed Lambda Calculus","author":"Girard","year":"1989"},{"key":"10.1016\/0304-3975(91)90037-3_BIB13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(89)90004-2","article-title":"Complete sets of transformations for general E-unification","volume":"67","author":"Gallier","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90037-3_BIB14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0747-7171(89)80023-9","article-title":"Higher-order unification revisited: complete sets of transformations","volume":"8","author":"Gallier","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(91)90037-3_BIB15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unification algorithm for typed \u03bb-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90037-3_BIB16","first-page":"143","article-title":"Term rewriting systems: a tutorial","volume":"32","author":"Klop","year":"1987","journal-title":"Bull. EATCS"},{"key":"10.1016\/0304-3975(91)90037-3_BIB17","series-title":"Technical Report 42","article-title":"Deduction with many-sorted rewrite","author":"Meseguer","year":"1985"},{"key":"10.1016\/0304-3975(91)90037-3_BIB18","series-title":"Proc. of the LISP and Functional Programming Conf.","first-page":"308","article-title":"A type-inference approach to reduction properties and semantics of polymorphic expressions","author":"Mitchell","year":"1986"},{"key":"10.1016\/0304-3975(91)90037-3_BIB19","series-title":"Conf. Record 13th Ann. Symp. Principles of Programming Languages","first-page":"287","article-title":"\u2018Type\u2019 is not a type: preliminary report","author":"Meyer","year":"1986"},{"key":"10.1016\/0304-3975(91)90037-3_BIB20","article-title":"Strong normalizability for the combined system of the typed lambda calculus and an arbitrary convergent term rewrite system","author":"Okada","year":"1989","journal-title":"Proc. ISSAC"},{"key":"10.1016\/0304-3975(91)90037-3_BIB21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.2307\/2273377","article-title":"Completeness, invariance and \u03bb-definability","volume":"47","author":"Statman","year":"1982","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(91)90037-3_BIB22","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":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90037-3_BIB23","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":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(91)90037-3_BIB24","first-page":"240","article-title":"A realizability interpretation of the theory of species","volume":"453","author":"Tait","year":"1975"},{"issue":"1","key":"10.1016\/0304-3975(91)90037-3_BIB25","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/7531.7534","article-title":"On the Church\u2013Rosser property for the direct sum of term rewriting systems","volume":"34","author":"Toyama","year":"1987","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900373?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900373?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:02Z","timestamp":1757477882000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591900373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["0304397591900373"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90037-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Polymorphic rewriting conserves algebraic strong normalization","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(91)90037-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}