{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:31:01Z","timestamp":1648618261446},"reference-count":10,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1016\/j.jcss.2014.04.008","type":"journal-article","created":{"date-parts":[[2014,4,3]],"date-time":"2014-04-03T22:18:01Z","timestamp":1396563481000},"page":"1163-1173","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["On polymorphic types of untyped terms"],"prefix":"10.1016","volume":"80","author":[{"given":"Rick","family":"Statman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2014.04.008_br0020","article-title":"Alcune proprieta delle forme beta-eta-normali nei lambda-K-calcolo","volume":"696","author":"B\u00f6hm","year":"1968","journal-title":"Pubbl. INAC"},{"key":"10.1016\/j.jcss.2014.04.008_br0040","series-title":"LICS, vol. 4","first-page":"204","article-title":"Extending the lambda calculus with surjective pairing is conservative","author":"de Vrijer","year":"1989"},{"key":"10.1016\/j.jcss.2014.04.008_br0050","series-title":"Interpretation fonctionelle et elimination des coupures dans l'arithmetique d'ordre supieure","author":"Girard","year":"1972"},{"key":"10.1016\/j.jcss.2014.04.008_br0060","article-title":"A Condition for Identifying Two Elements of Whatever Model of Combinatory Logic","volume":"vol. 37","author":"Jacopini","year":"1975"},{"key":"10.1016\/j.jcss.2014.04.008_br0080","series-title":"Liber Amicorum for Roel de Vrijer","article-title":"Surjective pairing revisited","author":"Statman","year":"2009"},{"key":"10.1016\/j.jcss.2014.04.008_br0090","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-2(2:1)2006","article-title":"Extending the extensional lambda calculus with surjective pairing is conservative","volume":"2","author":"Stovring","year":"2006","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.jcss.2014.04.008_br0110","series-title":"The Lambda Calculus","author":"Barendegt","year":"1981"},{"key":"10.1016\/j.jcss.2014.04.008_br0120","series-title":"Calculi of Lambda Conversion","author":"Church","year":"1941"},{"key":"10.1016\/j.jcss.2014.04.008_br0130","author":"Reynolds","year":"1985"},{"issue":"2\u20133","key":"10.1016\/j.jcss.2014.04.008_br0100","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0890-5401(88)90009-0","article-title":"Polymorphic type inference and containment","volume":"76","author":"Mitchell","year":"1988","journal-title":"Inf. Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S002200001400052X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S002200001400052X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T00:55:41Z","timestamp":1538700941000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S002200001400052X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["S002200001400052X"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jcss.2014.04.008","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2014,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On polymorphic types of untyped terms","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jcss.2014.04.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}