{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,3]],"date-time":"2026-11-03T10:24:06Z","timestamp":1793701446549,"version":"4.5.1"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540578871","type":"print"},{"value":"9783540483830","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57887-0_99","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:37:35Z","timestamp":1330245455000},"page":"244-272","source":"Crossref","is-referenced-by-count":24,"title":["Extensible denotational language specifications"],"prefix":"10.1007","author":[{"given":"Robert","family":"Cartwright","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Felleisen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"13_CR1","volume-title":"Cambridge Computer Science Texts 23","author":"L. Allison","year":"1986","unstructured":"Allison, L.A Practical Introduction to Denotational Semantics. Cambridge Computer Science Texts 23. Cambridge University Press, Cambridge, England. 1986."},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0020-0190(89)90097-5","volume":"31","author":"L. Allison","year":"1989","unstructured":"Allison, L. Direct semantics and exceptions define jumps and coroutines. Information Processing Letters31, 1989, 327\u2013330.","journal-title":"Information Processing Letters"},{"key":"13_CR3","unstructured":"Bj\u00f8rner, D. and C. Jones. Formal Specification and Software Development. Prentice Hall International, 1982."},{"key":"13_CR4","first-page":"345","volume-title":"Naive denotational semantics","author":"A. Blikle","year":"1983","unstructured":"Blikle, A. and A. Tarlecki. Naive denotational semantics. In Proc. IFIP 9th World Computer Congress: Information Processing 83, North-Holland, Amsterdam, 1983, 345\u2013355."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Crank, E. and M. Felleisen. Parameter-passing and the lambdacalculus. In Proc. 18th ACM Symposium on Principles of Programming Languages, 1991, 233\u2013245.","DOI":"10.1145\/99583.99616"},{"issue":"3\/4","key":"13_CR6","first-page":"227","volume":"1","author":"L.G. Demichiel","year":"1988","unstructured":"Demichiel, L.G. Overview: The Common Lisp Object System. Lisp and Symbolic Computation1(3\/4), 1988, 227\u2013244.","journal-title":"Lisp and Symbolic Computation"},{"key":"13_CR7","volume-title":"The Scheme Programming Language","author":"R. K. Dybvig","year":"1987","unstructured":"Dybvig, R. K.The Scheme Programming Language, Prentice-Hall, Englewood Cliffs, New Jersey, 1987."},{"issue":"2","key":"13_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0096-0551(89)90018-0","volume":"14","author":"R. K. Dybvig","year":"1989","unstructured":"Dybvig, R. K. and R. Hieb. Engines from continuations. Journal of Computer Languages (Pergamon Press) 14(2), 1989, 109\u2013124.","journal-title":"Journal of Computer Languages (Pergamon Press)"},{"key":"13_CR9","first-page":"206","volume-title":"Lecture Notes in Computer Science 259","author":"M. Felleisen","year":"1987","unstructured":"Felleisen, M. and D.P. Friedman. A reduction semantics for imperative higher-order languages. In Proc. Conference on Parallel Architectures and Languages Europe, Volume II: Parallel Languages. Lecture Notes in Computer Science 259. Springer-Verlag, Heidelberg, 1987, 206\u2013223."},{"issue":"3","key":"13_CR10","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(89)90069-8","volume":"69","author":"M. Felleisen","year":"1989","unstructured":"Felleisen, M. and D.P. Friedman. A syntactic theory of sequential state. Theor. Comput. Sci.69(3), 1989, 243\u2013287. Preliminary version in: Proc. 14th ACM Symposium on Principles of Programming Languages, 1987, 314\u2013325.","journal-title":"Theor. Comput. Sci."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Felleisen, M. and R. Hieb. The revised report on the syntactic theories of sequential control and state. Technical Report 100, Rice University, June 1989. Theor. Comput. Sci.102, 1992, 235\u2013271.","DOI":"10.1016\/0304-3975(92)90014-7"},{"issue":"3","key":"13_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","volume":"52","author":"M. Felleisen","year":"1987","unstructured":"Felleisen, M., D.P. Friedman, E. Kohlbecker, and B. Duba. A syntactic theory of sequential control. Theor. Comput. Sci.52(3), 1987, 205\u2013237. Preliminary version in: Proc. Symposium on Logic in Computer Science, 1986, 131\u2013141.","journal-title":"Theor. Comput. Sci."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Filinski, A. Representing monads. In Proc. 21st ACM Symposium on Principles of Programming Languages, 1994, to appear.","DOI":"10.1145\/174675.178047"},{"key":"13_CR14","first-page":"263","volume-title":"Program Transformations and Programming Environments","author":"D.P. Friedman","year":"1985","unstructured":"Friedman, D.P., C.T. Haynes, and E. Kohlbecker. Programming with continuations. In Program Transformations and Programming Environments, edited by P. Pepper. Springer-Verlag, Heidelberg, 1985, 263\u2013274."},{"key":"13_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6228-2","volume-title":"The Denotational Description of Programming Languages","author":"M.J. Gordon","year":"1979","unstructured":"Gordon, M.J.The Denotational Description of Programming Languages, Springer-Verlag, New York, 1979."},{"key":"13_CR16","doi-asserted-by":"crossref","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, and M. Wand. Obtaining coroutines from continuations. Journal of Computer Languages (Pergamon Press) 11, 1986, 143\u2013153. Preliminary Version in Lisp and Functional Programming, 1984, Austin, TX.","journal-title":"Journal of Computer Languages (Pergamon Press)"},{"key":"13_CR17","first-page":"682","volume-title":"Lecture Notes in Computer Science 700","author":"R. Kanneganti","year":"1993","unstructured":"Kanneganti, R., and R. Cartwright. What is a universal higher-order programming language? In Proc. International Conference on Automata, Languages, and Programming. Lecture Notes in Computer Science 700. Springer Verlag, Berlin, 1993, 682\u2013695."},{"key":"13_CR18","first-page":"219","volume-title":"Lecture Notes in Computer Science 193","author":"A.R. Meyer","year":"1985","unstructured":"Meyer, A.R. and M. Wand. Continuation semantics in typed lambdacalculi. Proc. Workshop Logics of Programs, Lecture Notes in Computer Science 193, Springer-Verlag, Heidelberg, 1985, 219\u2013224."},{"key":"13_CR19","volume-title":"The Definition of Standard ML.","author":"R. Milner","year":"1990","unstructured":"Milner, R., M. Tofte, and R. Harper. The Definition of Standard ML. The MIT Press, Cambridge, Massachusetts and London, England, 1990."},{"key":"13_CR20","unstructured":"Moggi, E. An abstract view of programming languages. LFCS Report ECS-LFCS-90-113, University of Edinburgh, 1990."},{"key":"13_CR21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E. Notions of computations and monads. Inf. and Comp.93, 1991, 55\u201392.","journal-title":"Inf. and Comp."},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Moggi, E. Computational lambda-calculus and monads. In Proc. Fourth Symposium on Logic in Computer Science, 1989, 14\u201323.","DOI":"10.1109\/LICS.1989.39155"},{"key":"13_CR23","first-page":"575","volume-title":"Handbook of Theoretical Computer Science","author":"P. Mosses","year":"1991","unstructured":"Mosses, P. Denotational Semantics. In Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1991, 575\u2013631."},{"key":"13_CR24","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(78)90006-5","volume":"17","author":"G. Plotkin","year":"1978","unstructured":"Plotkin, G.T\u03c9 as a Universal Domain. J. Comput. Syst. Sci.17, 1978, 209\u2013236.","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Rees, J. and W. Clinger (Eds.). The revised3 report on the algorithmic language Scheme. SIGPLAN Notices 21(12), 1986, 37\u201379.","DOI":"10.1145\/15042.15043"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C. On the relation between direct and continuation semantics. In Proc. International Conference on Automata, Languages and Programming, 1974, 141\u2013156.","DOI":"10.1007\/3-540-06841-4_57"},{"key":"13_CR27","volume-title":"Denotational Semantics: A Methodology for Language Development","author":"D.A. Schmidt","year":"1986","unstructured":"Schmidt, D.A.Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, Newton, Mass., 1986."},{"key":"13_CR28","first-page":"577","volume-title":"Lecture Notes in Mathematics 140","author":"D. S. Scott","year":"1982","unstructured":"Scott, D. S. Domains for denotational semantics. In Proc. International Conference on Automata, Languages, and Programming, Lecture Notes in Mathematics 140, Springer Verlag, Berlin, 1982, 577\u2013613."},{"issue":"3","key":"13_CR29","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D.S. Scott","year":"1976","unstructured":"Scott, D.S. Data types as lattices. SIAM J. Comput.5(3), 1976, 522\u2013587.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"13_CR30","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1145\/322203.322216","volume":"27","author":"R. Sethi","year":"1980","unstructured":"Sethi R. and A. Tang. Constructing call-by-value continuation semantics. J. ACM27(3), 1980, 580\u2013597.","journal-title":"J. ACM"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Sitaram, D. and M. Felleisen. Modeling continuations without continuations. In Proc. 18th ACM Symposium on Principles of Programming Languages, 1991, 185\u2013196.","DOI":"10.1145\/99583.99611"},{"key":"13_CR32","unstructured":"Steele, G.L., Jr.Common Lisp\u2014The Language. Digital Press, 1984."},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Steele, G.L., Jr. Building interpreters by composing monads. In Proc. 21st ACM Symposium on Principles of Programming Languages, 1994, to appear.","DOI":"10.1145\/174675.178068"},{"key":"13_CR34","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0304-3975(81)90037-2","volume":"13","author":"J. Stoy","year":"1981","unstructured":"Stoy, J. The congruence of two programming language definitions. Theor. Comput. Sci.13, 1981, 151\u2013174.","journal-title":"Theor. Comput. Sci."},{"key":"13_CR35","volume-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Languages","author":"J.E. Stoy","year":"1981","unstructured":"Stoy, J.E.Denotational Semantics: The Scott-Strachey Approach to Programming Languages. The MIT Press, Cambridge, Mass. 1981."},{"key":"13_CR36","unstructured":"Strachey, C. and C.P. Wadsworth. Continuations: A mathematical semantics for handling full jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory, Programming Research Group, 1974."},{"key":"13_CR37","unstructured":"Sussman, G.J. and G.L. Steele Jr. Scheme: An interpreter for extended lambda calculus. Memo 349, MIT AI Lab, 1975."},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Wadler, P. The essence of functional programming. In Proc. 19th ACM Symposium on Principles of Programming Languages, 1992, 1\u201314.","DOI":"10.1145\/143165.143169"},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Wand, M. Continuation-based multiprocessing. In Proc. 1980 ACM Conference on Lisp and Functional Programming, 1980, 19\u201328.","DOI":"10.1145\/800087.802786"},{"key":"13_CR40","unstructured":"Wright, A. and M. Felleisen. A syntactic approach to type soundness. Technical Report 160. Rice University, 1991. Information and Computation, 1993, to appear."},{"key":"13_CR41","unstructured":"Wright, A.K. and R. Cartwright. A practical soft type system for Scheme. Technical Report Rice CS 93-218. Rice University, December 1993."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57887-0_99.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:15:40Z","timestamp":1605629740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57887-0_99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578871","9783540483830"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/3-540-57887-0_99","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}