{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T21:46:51Z","timestamp":1790718411564,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540179450","type":"print"},{"value":"9783540471813","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17945-3_12","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:20:16Z","timestamp":1330197616000},"page":"206-223","source":"Crossref","is-referenced-by-count":14,"title":["A reduction semantics for imperative higher-order languages"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Felleisen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel P.","family":"Friedman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Backus, J. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs, Comm. ACM21(8), 613\u2013641.","DOI":"10.1145\/359576.359579"},{"key":"12_CR2","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. P. Barendregt","year":"1981","unstructured":"Barendregt, H.P.The Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam, 1981."},{"key":"12_CR3","unstructured":"Clinger, W.D., D.P. Friedman, M. Wand. A scheme for a higher-level semantic algebra, in Algebraic Methods in Semantics, J. Reynolds, M. Nivat (Eds.), 1985, 237\u2013250."},{"key":"12_CR4","first-page":"484","volume":"68","author":"J. B. Dennis","year":"1969","unstructured":"Dennis, J.B. Programming generality, parallelism and computer architectures, Information Processing68, 1969, 484\u2013492.","journal-title":"Information Processing"},{"key":"12_CR5","unstructured":"Felleisen, M., D.P. Friedman, B. Duba, J. Merrill. Beyond continuations, Technical Report No 216, Indiana University Computer Science Department, 1987."},{"key":"12_CR6","volume-title":"Formal Description of Programming Concepts III","author":"M. Felleisen","year":"1986","unstructured":"Felleisen, M., D.P. Friedman. Control operators, the SECD-machine, and the \u03bb-calculus, Formal Description of Programming Concepts III, North-Holland, Amsterdam, 1986, to appear."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Felleisen, M., D.P. Friedman. A calculus for assignments in higher-order languages, Proc. 14th ACM Symp. Principles of Programming Languages, 1987, 314\u2013325.","DOI":"10.1145\/41625.41654"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Felleisen, M. Reflections on Landin's J-operator: a partly historical note, Computer Languages, 1987, to appear.","DOI":"10.1016\/0096-0551(87)90022-1"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Friedman, D.P., C.T. Haynes, E. Kohlbecker. Programming with continuations, in Program Transformations and Programming Environments, P. Pepper (Ed.), Springer-Verlag, 1985, 263\u2013274.","DOI":"10.1007\/978-3-642-46490-4_23"},{"issue":"3\/4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0096-0551(86)90007-X","volume":"11","author":"C. T. Haynes","year":"1986","unstructured":"Haynes, C.T., D.P. Friedman, M. Wand. Obtaining coroutines from continuations, Computer Languages11(3\/4), 1986, 143\u2013153.","journal-title":"Computer Languages"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Haynes, C. T. Logic continuations, Proc. Third International Conf. Logic Programming, London, Springer-Verlag, 1986, 671\u2013685; also to appear in Journal of Logic Programming, 1987.","DOI":"10.1016\/0743-1066(87)90016-1"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Henson, M.C., R. Turner. Completion semantics and interpreter generation, Proc. 9th ACM Symp. Principles of Programming Languages, 1982, 242\u2013254.","DOI":"10.1145\/582153.582180"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Kohlbecker, E, M. Wand. Macro-by-example: deriving syntactic transformations from their specifications, Proc. 14th ACM Symp. Principles of Programming Languages, 1987, 77\u201385.","DOI":"10.1145\/41625.41632"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","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, Comm. ACM9(3), 1966, 157\u2013166.","journal-title":"Comm. ACM"},{"key":"12_CR15","unstructured":"Landin, P. J. An abstract machine for designers of computing languages, Proc. IFIP Congress, 1965, 438\u2013439."},{"issue":"4","key":"12_CR16","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, Computer Journal6(4), 1964, 308\u2013320.","journal-title":"Computer Journal"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00995174","volume":"8","author":"G. A. Mag\u00f3","year":"1979","unstructured":"Mag\u00f3, G.A. A network of microprocessors to execute reduction languages, Int. Journal of Computer and Information Sciences8, 1979, 349\u2013385; 435\u2013471.","journal-title":"Int. Journal of Computer and Information Sciences"},{"key":"12_CR18","unstructured":"Mason, I. A.The Semantics of Destructive Lisp, Ph.D. dissertation, Stanford University, 1986."},{"key":"12_CR19","unstructured":"Plotkin, G.D. A structural approach to operational semantics, Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981."},{"key":"12_CR20","doi-asserted-by":"publisher","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, Theoretical Computer Science1, 1975, 125\u2013159.","journal-title":"Theoretical Computer Science"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C. Definitional interpreters for higher-order programming languages, Proc. ACM Annual Conference, 1972, 717\u2013740.","DOI":"10.1145\/800194.805852"},{"issue":"5","key":"12_CR22","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1145\/362349.362364","volume":"13","author":"J. C. Reynolds","year":"1970","unstructured":"Reynolds, J.C. GEDANKEN\u2014A simple typeless language based on the principle of completeness and the reference concept, Comm. ACM13(5), 1970, 308\u2013319.","journal-title":"Comm. ACM"},{"key":"12_CR23","unstructured":"Sussman G.J., G. Steele. Scheme: An interpreter for extended lambda calculus, Memo 349, MIT AI-Lab, 1975."},{"key":"12_CR24","unstructured":"Talcott, C.The Essence of Rum\u2014A Theory of the Intensional and Extensional Aspects of Lisptype Computation, Ph.D. dissertation, Stanford University, 1985."},{"key":"12_CR25","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0096-0551(78)90042-5","volume":"3","author":"M. Wand","year":"1978","unstructured":"Wand, M., D.P. Friedman. Compiling lambda-expressions using continuations and factorizations, Computer Languages3, 1978, 241\u2013263.","journal-title":"Computer Languages"}],"container-title":["Lecture Notes in Computer Science","PARLE Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17945-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:38Z","timestamp":1605644018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17945-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540179450","9783540471813"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-17945-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]}}}