{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T22:57:50Z","timestamp":1765666670661,"version":"build-2065373602"},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T00:00:00Z","timestamp":1115078400000},"content-version":"vor","delay-in-days":2679,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1998]]},"DOI":"10.1016\/s1571-0661(05)80702-9","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"230-241","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Typed Closure Conversion for Recursively-Defined Functions"],"prefix":"10.1016","volume":"10","author":[{"given":"Greg","family":"Morrisett","sequence":"first","affiliation":[]},{"given":"Robert","family":"Harper","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1992","series-title":"Compiling with Continuations","author":"Appel","key":"10.1016\/S1571-0661(05)80702-9_BIB1"},{"key":"10.1016\/S1571-0661(05)80702-9_BIB2","first-page":"293","article-title":"Continuation-passing, closure-passing style","author":"Appel","year":"1989"},{"key":"10.1016\/S1571-0661(05)80702-9_BIB3","series-title":"Third Int'l Symp. on Prog. Lang. Implementation and Logic Programming","first-page":"1","article-title":"Standard ML of New Jersey","author":"Appel","year":"1991"},{"key":"10.1016\/S1571-0661(05)80702-9_BIB4","series-title":"In Theoretical Aspects of Computer Science","article-title":"Relational interpretations of recursive types in an operational setting (summary)","author":"Birkedal","year":"1997"},{"issue":"1","key":"10.1016\/S1571-0661(05)80702-9_BIB5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/inco.1996.0061","article-title":"From operational semantics to domain theory","volume":"128","author":"Mason","year":"1996","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80702-9_BIB6","first-page":"271","article-title":"Typed closure conversion","author":"Minamide","year":"1996","journal-title":"In Twenty-Third ACM Symposium on Principles of Programming Languages"},{"issue":"3","key":"10.1016\/S1571-0661(05)80702-9_BIB7","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1145\/44501.45065","article-title":"Abstract types have existential type","volume":"10","author":"Mitchell","year":"1988","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(05)80702-9_BIB8","series-title":"In Twentieth ACM Symposium on Principles of Programming Languages, Charleston, SC","article-title":"Object-oriented programming without recursive types","author":"Pierce","year":"1993"},{"issue":"2","key":"10.1016\/S1571-0661(05)80702-9_BIB9","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/inco.1996.0052","article-title":"Relational properties of domains","volume":"127","author":"Pitts","year":"1996","journal-title":"Information and Computation"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105807029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105807029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:06Z","timestamp":1761610146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105807029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":9,"alternative-id":["S1571066105807029"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80702-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Typed Closure Conversion for Recursively-Defined Functions","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80702-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}