{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:38:08Z","timestamp":1649014688836},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s10990-010-9056-6","type":"journal-article","created":{"date-parts":[[2010,2,4]],"date-time":"2010-02-04T09:20:07Z","timestamp":1265275207000},"page":"313-314","source":"Crossref","is-referenced-by-count":0,"title":["An introduction to Landin\u2019s \u201cGetting Rid of Labels\u201d"],"prefix":"10.1007","volume":"22","author":[{"given":"R. D.","family":"Tennent","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"issue":"8","key":"9056_CR1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"Backus, J.: Can programming be liberated from the von Neumann style? A\u00a0functional style and its algebra of programs. Commun. ACM 21(8), 613\u2013641 (1978)","journal-title":"Commun. ACM"},{"issue":"12","key":"9056_CR2","first-page":"1","volume":"4","author":"O. Danvy","year":"2008","unstructured":"Danvy, O., Millikin, K.: A rational deconstruction of Landin\u2019s SECD machine with the J operator. Log. Methods Comput. Sci. 4(12), 1\u201367 (2008). Accessible on-line at www.lmcs-online.org","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"9056_CR3","first-page":"195","volume":"30","author":"E.W. Dijkstra","year":"1968","unstructured":"Dijkstra, E.W.: Go to statement considered harmful. Commun. ACM 30(3), 195\u201396 (1968)","journal-title":"Commun. ACM"},{"issue":"3","key":"9056_CR4","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/72551.72554","volume":"21","author":"P. Hudak","year":"1989","unstructured":"Hudak, P.: Conception, evolution, and application of functional programming languages. ACM Comput. Surv. 21(3), 359\u2013411 (1989)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"9056_CR5","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1093\/comjnl\/32.2.98","volume":"32","author":"J. Hughes","year":"1989","unstructured":"Hughes, J.: Why functional programming matters. Comput.\u00a0J. 32(2), 98\u2013107 (1989)","journal-title":"Comput.\u00a0J."},{"issue":"3","key":"9056_CR6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/365230.365257","volume":"9","author":"P.J. Landin","year":"1966","unstructured":"Landin, P.J.: The next 700 programming languages. Commun. ACM 9(3), 157\u2013166 (1966)","journal-title":"Commun. ACM"},{"key":"9056_CR7","unstructured":"Landin, P.J.: Histories of discoveries of continuations: Belles-Lettres with equivocal tenses. In: Danvy, O. (ed.) 2nd ACM SIGPLAN Workshop on Continuations, ENS, Paris (1997). Number NS-96-13 in BRICS Notes Series"},{"issue":"2","key":"9056_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1010068630801","volume":"11","author":"P.J. Landin","year":"1998","unstructured":"Landin, P.J.: A generalization of jumps and labels. Higher Order Symb. Comput. 11(2), 125\u2013143 (1998). Originally a Univac Systems Programming Research report, dated August\u00a029th, 1965","journal-title":"Higher Order Symb. Comput."},{"issue":"3\u20134","key":"9056_CR9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01019459","volume":"6","author":"J.C. Reynolds","year":"1993","unstructured":"Reynolds, J.C.: The discoveries of continuations. LISP Symb. Comput. 6(3\u20134), 233\u2013247 (1993)","journal-title":"LISP Symb. Comput."},{"issue":"8","key":"9056_CR10","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1145\/366707.367537","volume":"6","author":"R.D. Rodman","year":"1963","unstructured":"Rodman, R.D.: Algorithm 196. M\u00fcller\u2019s method for finding roots of an arbitrary function. Commun. ACM 6(8), 442\u201343 (1963)","journal-title":"Commun. ACM"},{"issue":"2","key":"9056_CR11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1023\/A:1010060315625","volume":"11","author":"H. Thielecke","year":"1998","unstructured":"Thielecke, H.: An introduction to Landin\u2019s \u201cA\u00a0generalization of jumps and labels\u201d. High. Order Symb. Comput. 11(2), 117\u2013123 (1998)","journal-title":"High. Order Symb. Comput."},{"key":"9056_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/800223.806766","volume-title":"FPCA \u201981: Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture","author":"D.A. Turner","year":"1981","unstructured":"Turner, D.A.: The semantic elegance of applicative languages. In: FPCA \u201981: Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, Portsmouth, New Hampshire, pp.\u00a085\u201392. ACM Press, New York (1981)"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-010-9056-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-010-9056-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-010-9056-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:29:42Z","timestamp":1559352582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-010-9056-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["9056"],"URL":"https:\/\/doi.org\/10.1007\/s10990-010-9056-6","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]}}}