{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:26:59Z","timestamp":1648661219601},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0020-0190(03)00282-5","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T19:15:45Z","timestamp":1054581345000},"page":"205-211","source":"Crossref","is-referenced-by-count":3,"title":["A type system for the push-enter model"],"prefix":"10.1016","volume":"87","author":[{"given":"Kwanghoon","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taisook","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(03)00282-5_BIB001","series-title":"Compiling with Continuations","author":"Appel","year":"1992"},{"key":"10.1016\/S0020-0190(03)00282-5_BIB002","doi-asserted-by":"crossref","unstructured":"K. Choi, A type system for the push-enter model, Revised Report of CS-TR-2002-175, Dept. of EE&CS, KAIST, Daejeon, Korea, February 2003","DOI":"10.1016\/S0020-0190(03)00282-5"},{"key":"10.1016\/S0020-0190(03)00282-5_BIB003","series-title":"The 20th Annual ACM SIGPLAN\u2013SIGACT Symposium on Principles of Programming Languages, Charleston, SC","first-page":"206","article-title":"Explicit polymorphism and CPS conversion","author":"Harper","year":"1993"},{"key":"10.1016\/S0020-0190(03)00282-5_BIB004","unstructured":"X. Leroy, The ZINC experiment: An economical implementation of the ML language, Technical Report 117, INRIA, Rennes, France, 1988"},{"issue":"3","key":"10.1016\/S0020-0190(03)00282-5_BIB005","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1145\/319301.319345","article-title":"From system F to typed assembly language","volume":"21","author":"Morrisett","year":"1999","journal-title":"ACM Trans. Programm. Languages Systems"},{"issue":"2","key":"10.1016\/S0020-0190(03)00282-5_BIB006","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1017\/S0956796800000319","article-title":"Implementing lazy functional languages on stock hardware: the spineless tagless G-machine","volume":"2","author":"Peyton Jones","year":"1992","journal-title":"J. Funct. Programm."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002825?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002825?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T19:56:18Z","timestamp":1553111778000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0020019003002825"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00282-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}