{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:16:45Z","timestamp":1649096205780},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"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,6]]},"DOI":"10.1007\/s10990-009-9048-6","type":"journal-article","created":{"date-parts":[[2010,1,12]],"date-time":"2010-01-12T04:18:35Z","timestamp":1263269915000},"page":"191-195","source":"Crossref","is-referenced-by-count":0,"title":["Peter J. Landin (1930\u20132009)"],"prefix":"10.1007","volume":"22","author":[{"given":"Olivier","family":"Danvy","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,13]]},"reference":[{"issue":"4","key":"9048_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0096-0551(75)90018-1","volume":"1","author":"S.K. Abdali","year":"1976","unstructured":"Abdali, S.K.: A lambda-calculus model of programming languages, part II: Jumps and procedures. Comput. Lang. 1(4), 303\u2013320 (1976)","journal-title":"Comput. Lang."},{"key":"9048_CR2","unstructured":"Berdine, J.: Linear and affine typing of continuation-passing style. PhD thesis, Queen Mary, University of London (2004)"},{"key":"9048_CR3","unstructured":"Clements, J., Sundaram, A., Herman, D.: Implementing continuation marks in JavaScript. In: Clinger, W. (ed.) Proceedings of the 2008 ACM SIGPLAN Workshop on Scheme and Functional Programming, pp.\u00a01\u20139, Victoria, British Columbia, September 2008"},{"key":"9048_CR4","unstructured":"Danvy, O. (ed.): Proceedings of the Second ACM SIGPLAN Workshop on Continuations (CW\u201997). Technical report BRICS NS-96-13, Aarhus University, Paris, France (January 1997)"},{"key":"9048_CR5","series-title":"Lecture Notes in Computer Science","first-page":"52","volume-title":"Implementation and Application of Functional Languages, 16th International Workshop, IFL\u201904","author":"O. Danvy","year":"2004","unstructured":"Danvy, O.: A rational deconstruction of Landin\u2019s SECD machine. In: Grelck, C., Huch, F., Michaelson, G.J., Trinder, P. (eds.) Implementation and Application of Functional Languages, 16th International Workshop, IFL\u201904, L\u00fcbeck, Germany, 2004. Lecture Notes in Computer Science, vol. 3474, pp. 52\u201371. Springer, Berlin (2004). Recipient of the 2004 Peter Landin prize. Extended version available as the research report BRICS RS-03-33"},{"key":"9048_CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/91556.91622","volume-title":"Proceedings of the 1990 ACM Conference on Lisp and Functional Programming","author":"O. Danvy","year":"1990","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: Wand, M. (ed.) Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, Nice, France, June 1990, pp. 151\u2013160. ACM Press, New York (1990)"},{"issue":"12","key":"9048_CR7","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)","journal-title":"Log. Methods Comput. Sci."},{"issue":"8","key":"9048_CR8","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1016\/j.scico.2007.10.007","volume":"74","author":"O. Danvy","year":"2009","unstructured":"Danvy, O., Millikin, K.: Refunctionalization at work. Sci. Comput. Program. 74(8), 534\u2013549 (2009). Extended version available as the research report BRICS RS-08-04","journal-title":"Sci. Comput. Program."},{"key":"9048_CR9","first-page":"162","volume-title":"Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP\u201901)","author":"O. Danvy","year":"2001","unstructured":"Danvy, O., Nielsen, L.R.: Defunctionalization at work. In: S\u00f8ndergaard, H. (ed.) Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP\u201901), Firenze, Italy, September 2001, pp. 162\u2013174. ACM Press, New York (2001). Extended version available as the research report BRICS RS-01-23"},{"key":"9048_CR10","unstructured":"Danvy, O., Talcott, C.L. (eds.): Special Issue on the Second ACM Workshop on Continuations (CW 1997), Part I. Higher-Order Symb. Comput. 11(2) (1998)"},{"key":"9048_CR11","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Domain-Specific Languages, IFIP TC 2 Working Conference, DSL 2009","author":"O. Danvy","year":"2009","unstructured":"Danvy, O., Shan, C.-C., Zerny, I.: J is for Javascript: A direct-style correspondence between Algol-like languages and Javascript using first-class continuations. In: Taha, W. (ed.) Domain-Specific Languages, IFIP TC 2 Working Conference, DSL 2009, Oxford, UK, July 2009. Lecture Notes in Computer Science, vol.\u00a05658, pp. 1\u201319. Springer, Berlin (2009)"},{"issue":"3\/4","key":"9048_CR12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01019461","volume":"6","author":"M.J. Fischer","year":"1993","unstructured":"Fischer, M.J.: Lambda-calculus schemata. Lisp Symb. Comput. 6(3\/4), 259\u2013288 (1993). Available at http:\/\/www.brics.dk\/~hosc\/vol06\/03-fischer.html . A preliminary version was presented at the ACM Conference on Proving Assertions about Programs, SIGPLAN Notices, vol.\u00a07, no.\u00a01, January 1972","journal-title":"Lisp Symb. Comput."},{"key":"9048_CR13","first-page":"245","volume-title":"Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages","author":"D.P. Friedman","year":"1985","unstructured":"Friedman, D.P., Haynes, C.T.: Constraining control. In: Van Deusen, M.S., Galil, Z. (eds.) Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, January 1985, pp. 245\u2013254. ACM Press, New York (1985)"},{"issue":"4","key":"9048_CR14","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"Landin, P.J.: The mechanical evaluation of expressions. Comput. J. 6(4), 308\u2013320 (1964)","journal-title":"Comput. J."},{"key":"9048_CR15","doi-asserted-by":"crossref","unstructured":"Landin, P.J.: A correspondence between Algol 60 and Church\u2019s lambda notation, Parts 1 and 2. Commun. ACM 8, 89\u2013101, 158\u2013165 (1965)","DOI":"10.1145\/363744.363749"},{"issue":"2","key":"9048_CR16","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. Research report, UNIVAC Systems Programming Research (1965). Reprinted in Higher-Order Symb. Comput. 11(2), 125\u2013143 (1998) with a foreword by H. Thielecke","journal-title":"Higher-Order Symb. Comput."},{"key":"9048_CR17","unstructured":"Landin, P.J.: Getting rid of labels. Research report, UNIVAC Systems Programming (July 1965)"},{"issue":"3","key":"9048_CR18","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":"9048_CR19","unstructured":"Landin, P.J.: Histories of discoveries of continuations: Belles-lettres with equivocal tenses. In: Danvy, O. Proceedings of the Second ACM SIGPLAN Workshop on Continuations (CW\u201997). Technical report BRICS NS-96-13, Aarhus University, Paris, France (January 1997), pp.\u00a01\u20139"},{"issue":"2","key":"9048_CR20","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). Reprinted from a technical report, UNIVAC Systems Programming Research (1965), with a foreword by H. Thielecke","journal-title":"Higher-Order Symb. Comput."},{"issue":"1\/2","key":"9048_CR21","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1010057925827","volume":"13","author":"P.J. Landin","year":"2000","unstructured":"Landin, P.J.: My years with Strachey. Higher-Order Symb. Comput. 13(1\/2), 75\u201376 (2000)","journal-title":"Higher-Order Symb. Comput."},{"issue":"3\/4","key":"9048_CR22","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01019460","volume":"6","author":"F.L. Morris","year":"1993","unstructured":"Morris, F.L.: The next 700 formal language descriptions. Lisp Symb. Comput. 6(3\/4), 249\u2013258 (1993) Reprinted from a manuscript dated 1970","journal-title":"Lisp Symb. Comput."},{"issue":"8","key":"9048_CR23","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1145\/361532.361558","volume":"15","author":"J.H. Morris Jr.","year":"1972","unstructured":"Morris, J.H.\u00a0Jr.: A bonus from van Wijngaarden\u2019s device. Commun. ACM 15(8), 773 (1972)","journal-title":"Commun. ACM"},{"key":"9048_CR24","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the \u03bb-calculus. Theor. Comput. Sci. 1, 125\u2013159 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"9048_CR25","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings of 25th ACM National Conference, pp.\u00a0717\u2013740, Boston, Massachusetts, 1972. Reprinted in Higher-Order Symb. Comput. 11(4), 363\u2013397 (1998) with a foreword by J.C. Reynolds"},{"issue":"3\/4","key":"9048_CR26","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\/4), 233\u2013247 (1993)","journal-title":"Lisp Symb. Comput."},{"issue":"4","key":"9048_CR27","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1023\/A:1010075320153","volume":"11","author":"J.C. Reynolds","year":"1998","unstructured":"Reynolds, J.C.: Definitional interpreters revisited. Higher-Order Symb. Comput. 11(4), 355\u2013361 (1998)","journal-title":"Higher-Order Symb. Comput."},{"key":"9048_CR28","unstructured":"Steele, G.L.\u00a0Jr.: Rabbit: A compiler for Scheme. Master\u2019s thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts (May 1978). Technical report AI-TR-474"},{"key":"9048_CR29","unstructured":"Strachey, C., Wadsworth, C.P.: Continuations: A mathematical semantics for handling full jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory, Programming Research Group, Oxford, England (1974). Reprinted in Higher-Order Symb. Comput. 13(1\/2), 135\u2013152 (2000) with a foreword by C.P. Wadsworth"},{"issue":"2","key":"9048_CR30","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 generalization of jumps and labels\u201d. Higher-Order Symb. Comput. 11(2), 117\u2013124 (1998)","journal-title":"Higher-Order Symb. Comput."},{"key":"9048_CR31","first-page":"13","volume-title":"Formal Language Description Languages for Computer Programming","author":"A. Wijngaarden van","year":"1966","unstructured":"van Wijngaarden, A.: Recursive definition of syntax and semantics. In: Steele, T.B.\u00a0Jr. (ed.) Formal Language Description Languages for Computer Programming, pp. 13\u201324. North-Holland, Amsterdam (1966)"},{"issue":"1\/2","key":"9048_CR32","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1010074329461","volume":"13","author":"C.P. Wadsworth","year":"2000","unstructured":"Wadsworth, C.P.: Continuations revisited. Higher-Order Symb. Comput. 13(1\/2), 131\u2013133 (2000)","journal-title":"Higher-Order Symb. Comput."}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-009-9048-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-009-9048-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-009-9048-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:29:41Z","timestamp":1559338181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-009-9048-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9048"],"URL":"https:\/\/doi.org\/10.1007\/s10990-009-9048-6","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}