{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T02:18:55Z","timestamp":1648520335112},"reference-count":3,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":6376,"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":[[1996,2]]},"DOI":"10.1016\/0304-3975(95)00147-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T01:06:05Z","timestamp":1027645565000},"page":"265-266","source":"Crossref","is-referenced-by-count":0,"title":["Two beta-equal lambda-I-terms with no types in common"],"prefix":"10.1016","volume":"155","author":[{"given":"M.W.","family":"Bunder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.R.","family":"Hindley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00147-6_bib1","first-page":"29","article-title":"The principal type-scheme of an object in combinatory logic","volume":"146","author":"Hindley","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(95)00147-6_bib2","series-title":"Introduction to Combinators and \u03bb-calculus","author":"Hindley","year":"1986"},{"key":"10.1016\/0304-3975(95)00147-6_bib3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF00370332","article-title":"The converse principal type-scheme theorem in lambda-calculus","volume":"51","author":"Hirokawa","year":"1992","journal-title":"Studia Logica"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001476?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001476?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:55:31Z","timestamp":1555390531000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0304397595001476"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00147-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}