{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:52:17Z","timestamp":1648713137253},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"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":8202,"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":[[1991,2]]},"DOI":"10.1016\/0304-3975(91)90339-4","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T03:31:32Z","timestamp":1060313492000},"page":"365-371","source":"Crossref","is-referenced-by-count":0,"title":["Polymorphic lambda calculus: the Church-Rosser property"],"prefix":"10.1016","volume":"79","author":[{"given":"George","family":"Koletsos","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90339-4_BIB1","series-title":"Second Scandinavian Logic Symposium","article-title":"Une extension de l'interpr\u00e9tation de G\u00f6del","author":"Girard","year":"1971"},{"key":"10.1016\/0304-3975(91)90339-4_BIB2","article-title":"Interpr\u00e9tation fonctionelle et \u00e9limination des coupures","author":"Girard","year":"1972"},{"key":"10.1016\/0304-3975(91)90339-4_BIB3","series-title":"Proc. Symp. On Lisp and Functional Programming","article-title":"A type-inference approach to reduction properties and semantics of polymorphic expressions","author":"Mitchell","year":"1986"},{"key":"10.1016\/0304-3975(91)90339-4_BIB4","series-title":"Categories in Computer Science and Logic, Proc. Amer. Math. Soc. Research Conf.","article-title":"Normalization revisited","author":"Scedrov","year":"1987"},{"key":"10.1016\/0304-3975(91)90339-4_BIB5","series-title":"Combinators, \u03bb-Terms and Proof Theory","author":"Stenlund","year":"1972"},{"key":"10.1016\/0304-3975(91)90339-4_BIB6","doi-asserted-by":"crossref","DOI":"10.2307\/2271658","article-title":"Intentional interpretation of functionals of finite type","volume":"32","author":"Tait","year":"1967","journal-title":"J. Symbolic Logic"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591903394?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591903394?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T20:00:33Z","timestamp":1552593633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591903394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["0304397591903394"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90339-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}