{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:10:05Z","timestamp":1751983805292,"version":"3.41.2"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order and Symbolic Computation"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1023\/a:1010087314987","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T00:56:42Z","timestamp":1040605002000},"page":"233-279","source":"Crossref","is-referenced-by-count":33,"title":["A Syntactic Theory of Dynamic Binding"],"prefix":"10.1007","volume":"11","author":[{"given":"Luc","family":"Moreau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"188358_CR1","unstructured":"Allen, John. Anatomy of Lisp. Mc Graw Hill, 1979."},{"key":"188358_CR2","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1145\/236114.236118","volume":"6","author":"I. Attali","year":"1996","unstructured":"Attali, Isabelle, Caromel, Denis and Ehmety, Sidi Ould. A natural semantics of Eiffel dynamic binding, ACM Transactions on Programming Languages and Systems 18, 6 (Nov. 1996) 711\u2013729.","journal-title":"ACM Transactions on Programming Languages and Systems 18"},{"key":"188358_CR3","first-page":"565","volume":"7","author":"H. G. Baker","year":"1978","unstructured":"Baker, Henry G. Shallow Binding in LISP 1.5. Communications of the ACM 21, 7 (1978) 565\u2013569.","journal-title":"Shallow Binding in LISP 1.5. Communications of the ACM 21"},{"key":"188358_CR4","unstructured":"Barendregt, Henk P. The Lambda Calculus: Its Syntax and Semantics, Second Edition, North-Holland, 1984."},{"key":"188358_CR5","doi-asserted-by":"crossref","unstructured":"Cartwright, Robert. Lambda: the ultimate combinator. In Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, V. Lifschitz (Ed.). Academic Press, 1991, pp. 27\u201346.","DOI":"10.1016\/B978-0-12-450010-5.50008-6"},{"key":"188358_CR6","unstructured":"Cenciarelli, Pietro. Computation applications of Calculi based on Monads. PhD thesis, University of Edinburgh, Sept. 1995."},{"key":"188358_CR7","unstructured":"Dami, Laurent. A Lambda-Calculus for dynamic binding, Theoretical Computer Science, forthcoming."},{"key":"188358_CR8","doi-asserted-by":"crossref","unstructured":"Danvy, Olivier and Filinski, Andrzej. Abstracting control. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming. Jun. 1990, pp. 151\u2013160.","DOI":"10.1145\/91556.91622"},{"key":"188358_CR9","doi-asserted-by":"crossref","unstructured":"Danvy, Olivier and Lawall, Julia L. Back to direct style II: first-class continuations. In Proceedings of the 1992 ACM Conference on Lisp and Functional Programming. Jun. 1992, pp. 299\u2013310.","DOI":"10.1145\/141471.141564"},{"key":"188358_CR10","unstructured":"Duba, Bruce F., Felleisen, Matthias and Friedman, Daniel P. Dynamic identifiers can be neat. Technical Report 220, Indiana University, Computer Science Department, 1987."},{"key":"188358_CR11","unstructured":"Feeley, Marc. An efficient and general implementation of futures on large scale shared-memory multiprocessors. PhD thesis, Brandeis University, 1993."},{"key":"188358_CR12","doi-asserted-by":"crossref","unstructured":"Felleisen, Matthias. On the expressive power of programming languages. In Proc.European Symposium on Programming. Lecture Notes in Computer Science 432. Springer-Verlag, 1990, pages 134\u2013151.","DOI":"10.1007\/3-540-52592-0_60"},{"key":"188358_CR13","first-page":"193","volume-title":"Formal Description of Programming Concepts III","author":"M. Felleisen","year":"1986","unstructured":"Felleisen, Matthias and Friedman, Daniel P. Control operators, the SECD-machine and the \u03bb-calculus. In Formal Description of Programming Concepts III, M. Wirsing (Ed.). Elsevier Science Publishers B.V. (North-Holland), 1986, pp. 193\u2013217."},{"key":"188358_CR14","doi-asserted-by":"crossref","unstructured":"Felleisen, Matthias and Friedman, Daniel P. A reduction semantics for imperative higher-order languages. In Proc.Conf.on Parallel Architecture and Languages Europe. Lecture Notes in Computer Science 259. Springer-Verlag, 1987, pp. 206\u2013223.","DOI":"10.1007\/3-540-17945-3_12"},{"key":"188358_CR15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(89)90069-8","volume":"69","author":"M. Felleisen","year":"1989","unstructured":"Felleisen, Matthias and Friedman, Daniel P. A syntactic theory of sequential state, Theoretical Computer Science 69 (1989) 243\u2013287.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"188358_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","volume":"52","author":"M. Felleisen","year":"1987","unstructured":"Felleisen, Matthias Friedman, Daniel P., Kohlbecker, Eugene E. and Duba, Bruce. A syntactic theory of sequential control, Theoretical Computer Science 523 (1987) 205\u2013237","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"188358_CR17","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"2","author":"M. Felleisen","year":"1992","unstructured":"Felleisen, Matthias and Hieb, Robert. The revised report on the syntactic theories of sequential control and state, Theoretical Computer Science 24 (1992) 235\u2013271. Technical Report 100, Rice University, June 1989.","journal-title":"Theoretical Computer Science"},{"key":"188358_CR18","unstructured":"Filinski, Andrzej. Controlling effects. PhD thesis, School of Computer Science. Carnegie Mellon University, May 1996."},{"key":"188358_CR19","unstructured":"Flanagan, Cormac and Felleisen, Matthias. The semantics of future and its use in program optimization. In Proceedings of the Twenty Second Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. Jan. 1995. Technical Reports 238, 239, Rice University, 1994."},{"issue":"1","key":"188358_CR20","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01806178","volume":"1","author":"R. P. Gabriel","year":"1988","unstructured":"Gabriel, Richard P. and Pitman, Kent M. Technical issues of separation in function cells and value cells, Lisp and Symbolic Computation 11 (Jun. 1988) 81\u2013101.","journal-title":"Technical issues of separation in function cells and value cells, Lisp and Symbolic Computation"},{"key":"188358_CR21","unstructured":"Gordon, Michael J.C. The Denotational Description of Programming Languages. Springer-Verlag, 1970."},{"key":"188358_CR22","unstructured":"Gordon, Michael J.C. Operational reasoning and denotational semantics. In Proving and Improving Programs. Colloques IRIA, Arc et Senans, Jul. 1975, pp. 83\u201398."},{"key":"188358_CR23","unstructured":"Gordon, Michael J.C. Towards a semantic theory of dynamic binding. Technical Report STAN-CS\u201375\u2013507, Stanford University, Aug. 1975."},{"key":"188358_CR24","unstructured":"Gordon, Michael J.C..Programming Language Theory and its Implementation. Prentice-Hall, 1988."},{"key":"188358_CR25","unstructured":"Gosling, J., Steele, Jr, Guy Lewis, and Joy, B. The Java Language Specification. Addison-Wesley, 1996."},{"key":"188358_CR26","unstructured":"Greussay, Patrick. Contribution \u00e1 la d\u00e9finition interpr\u00e9tative et \u00e1 l'impl\u00e9mentation des lambda-langages. Th\u00e9se d'\u00e9tat, Universit\u00e9 Paris VI, Nov. 1977. Rapport LITP 78\u20132."},{"key":"188358_CR27","doi-asserted-by":"crossref","unstructured":"Gunter, Carl A., R\u00e9my, Didier, and Riecke, Jon G. A generalization of exceptions and control in ML. In ACM Conference on Functional Programming and Computer Architecture (FPCA'95). La Jolla, California, Jun. 1995.","DOI":"10.1145\/224164.224173"},{"key":"188358_CR28","doi-asserted-by":"crossref","unstructured":"Halstead, Jr., RobertH. New ideas in parallel Lisp: language design, implementation. In Parallel Lisp: Languages and Systems.US\/Japan Workshop on Parallel Lisp.Japan., T. Ito and Robert H. Halstead (Eds.). Lecture Notes in Computer Science 441. Springer-Verlag, 1990, pp. 2\u201357.","DOI":"10.1007\/BFb0024149"},{"key":"188358_CR29","unstructured":"Hanson, Chris. MIT Scheme Reference Manual. Massachusetts Institute of Technology, Jan. 1991."},{"issue":"4","key":"188358_CR30","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1145\/29873.30392","volume":"9","author":"C. T. Haynes","year":"1987","unstructured":"Haynes, Christopher T. and Friedman, Daniel P. Embedding Continuations in procedural objects, ACM Transactions on Programming Languages and Systems 94 (Oct 1987) 582\u2013598.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"188358_CR31","unstructured":"Haynes, Christopher T. and Salter, Richard M. Maintaining dynamic states: deep, shallow, and parallel. Technical Report, Indiana University."},{"key":"188358_CR32","doi-asserted-by":"crossref","unstructured":"Hieb, Robert and Dybvig, R. Kent. Continuations and concurrency. In Second ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, Mar. 1990, pp. 128\u2013136.","DOI":"10.1145\/99163.99178"},{"key":"188358_CR33","unstructured":"Hudak, Paul, Jones, Simon Peyton, and Wadler, Philip (Eds.). Report on the Programming Language Haskell, 1991."},{"key":"188358_CR34","unstructured":"IEEE. IEEE P1003.1c\/D10 Draft Standard for Information Technology\u2013Portable Operating Systems Interface (POSIX), Sept. 1994."},{"key":"188358_CR35","doi-asserted-by":"crossref","unstructured":"Ito, Takayasu and Matsui, Manabu. A parallel Lisp language Pailisp and its kernel specification. In Parallel Lisp: Languages and Systems.US\/Japan Workshop on Parallel Lisp.Japan., T. Ito and Robert H. Halstead (Eds.). Lecture Notes in Computer Science 441. Springer-Verlag, 1990, pp. 58\u2013100.","DOI":"10.1007\/BFb0024150"},{"key":"188358_CR36","unstructured":"Knuth, Donald E. The TEXbook. Addison-Wesley, 1994."},{"key":"188358_CR37","unstructured":"Krawitz, Robert, Lewis, Bill, LaLiberte, Dan, Stallman, Richard M. and Welt, Chris. GNU Emacs Lisp Reference Manual, 2.4 edition."},{"issue":"4","key":"188358_CR38","first-page":"184","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"McCarthy, John. Recursive functions of symbolic expressions and their computation by machine, part I, Communications of the ACM 34 (1960) 184\u2013195.","journal-title":"Recursive functions of symbolic expressions and their computation by machine, part I, Communications of the ACM"},{"key":"188358_CR39","doi-asserted-by":"crossref","unstructured":"McCarthy, John. History of Lisp. In ACM SIGPLAN History of Programming Languages Conference. Richard L. Wexelblat (Ed.). ACM Monograph Series, Jun. 1978, pp. 173\u2013196.","DOI":"10.1145\/800025.1198360"},{"key":"188358_CR40","unstructured":"Milner, Robin, Tofte, Mads, and Harper, Robert. The Definition of Standard ML. MIT Press, 1990."},{"key":"188358_CR41","doi-asserted-by":"crossref","unstructured":"Mohr, Eric, Kranz, David A., and Halstead, Robert H. Lazy task creation: a technique for increasing the granularity of parallel programs. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, Jun. 1990, pp. 185\u2013197.","DOI":"10.1145\/91556.91631"},{"key":"188358_CR42","unstructured":"Moon, David A. Maclisp reference manual, revision 0. Technical Report, MIT Project Mac, Apr. 1974."},{"key":"188358_CR43","unstructured":"Moreau, Luc. Sound evaluation of parallel functional programs with first-class continuations. PhD thesis, University of Li\u00e8ge, Service d'Informatique, Institut Montefiore B28, 4000 Li\u00e8ge, Belgium, Jun. 1994. Also available by anonymous ftp from ftp.montefiore.ulg.ac.be in directory pub\/moreau."},{"key":"188358_CR44","doi-asserted-by":"crossref","unstructured":"Moreau, Luc. The semantics of scheme with future. In ACM SIGPLAN International Conference on Functional Programming (ICFP'96). Philadelphia, Pennsylvania, May 1996, pp. 146\u2013156. Also in ACM SIGPLAN Notices 31 6 (1996).","DOI":"10.1145\/232629.232644"},{"key":"188358_CR45","unstructured":"Moreau, Luc. A syntactic theory of dynamic binding. Technical Report M96\/4, University of Southampton, 1996. available at http:\/\/www.ecs.soton.ac.uk\/~lavm\/papers"},{"key":"188358_CR46","doi-asserted-by":"crossref","unstructured":"Moreau, Luc. A syntactic theory of dynamic binding. In International Joint Conference on Theory and Practice of Software Development (TAPSOFT\/FASE'97). Lille, France. Lecture Notes in Computer Science 1214. Springer-Verlag, Apr. 1997, pp. 727\u2013741.","DOI":"10.1007\/BFb0030637"},{"key":"188358_CR47","doi-asserted-by":"crossref","unstructured":"Moreau, Luc and Queinnec, Christian. Partial continuations as the difference of continuations-a duumvirate of control operators. In International Conference on Programming Language Implementation and Logic Programming (PLILP'94). Lecture Notes in Computer Science 844. Springer-Verlag, Sept. 1994, pp. 182\u2013197. Also in Les Ecrits d'Icslas. Jan.-D\u00e9c. 1993. Rapport de Recherche. LIX RR 93.05. Laboratoire d'Informatique de l'Ecole Polytechnique, 91128 Palaiseau Cedex, France.","DOI":"10.1007\/3-540-58402-1_14"},{"key":"188358_CR48","doi-asserted-by":"crossref","unstructured":"Moses, Joel. The function of FUNCTION in Lisp or why the FUNARG problem should be called the environment problem. Project MAC AI-199, M.I.T., Jun. 1970.","DOI":"10.1145\/1093410.1093411"},{"key":"188358_CR49","doi-asserted-by":"crossref","unstructured":"Osborne, Randy B. Speculative computation in Multilisp. In Parallel Lisp: Languages and Systems. US\/Japan Workshop on Parallel Lisp.Japan., T. Ito and Robert H. Halstead (Eds.). Lecture Notes in Computer Science 441. Springer-Verlag, 1990, pp. 103\u2013137.","DOI":"10.1007\/BFb0024152"},{"key":"188358_CR50","unstructured":"Padget, Julian and Nuyens, Grep (Eds.). The EuLisp Definition, Jun. 1991."},{"key":"188358_CR51","doi-asserted-by":"crossref","unstructured":"Plotkin, Gordon D. Call-by-name, Call-by-value and the \u03bb-calculus, Theoretical Computer Science (1975) 125\u2013159.","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"188358_CR52","doi-asserted-by":"crossref","unstructured":"Queinnec, Christian. Lisp in Small Pieces. Cambridge University Press, 1996.","DOI":"10.1017\/CBO9781139172974"},{"key":"188358_CR53","doi-asserted-by":"crossref","unstructured":"Queinnec, Christian and DeRoure, David. Design of a concurrent and distributed language. In Parallel Symbolic Computing: Languages, Systems and Applications, A. Agarwal, R. H. Halstead, and Takayasu Ito (Eds.). Lecture Notes in Computer Science 748. Springer-Verlag. Oct. 1992, pp. 234\u2013259.","DOI":"10.1007\/BFb0018655"},{"key":"188358_CR54","doi-asserted-by":"crossref","unstructured":"Queinnec, Christian and Serpette, Bernard. A dynamic extent control operator for partial continuations. In Proceedings of the Eighteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1991, pp. 174\u2013184.","DOI":"10.1145\/99583.99610"},{"key":"188358_CR55","unstructured":"Ramey, Chet and Fox, Brian. Bash Reference Manual 2.0 edition. Case Western Reserve University & Free Software Foundation, Nov. 1996."},{"issue":"3","key":"188358_CR56","first-page":"1","volume":"4","author":"J. Rees","year":"1991","unstructured":"Rees, Jonathan and Clinger, William. Revised4report on the algorithmic language scheme, Lisp Pointers 43 (Jul.-Sept. 1991) 1\u201355.","journal-title":"Lisp Pointers"},{"key":"188358_CR57","doi-asserted-by":"crossref","unstructured":"Riecke, Jon G. and Viswanathan, Ramesh. Isolating side effects in sequential languages. In Proceedings of the Twenty Second Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. San Francisco, Jan. 1995, pp. 1\u201312.","DOI":"10.1145\/199448.199450"},{"key":"188358_CR58","volume-title":"The formal relationship between direct and continuation-passing style optimizing compilers: a synthesis of two paradigms","author":"A. Sabry","year":"1994","unstructured":"Sabry, Amr. The formal relationship between direct and continuation-passing style optimizing compilers: a synthesis of two paradigms. PhD thesis, Rice University, Houston, TX., Aug. 1994."},{"issue":"3\/4","key":"188358_CR59","first-page":"289","volume":"6","author":"A. Sabry","year":"1993","unstructured":"Sabry, Amr and Felleisen, Matthias. Reasoning about programs in continuation-passing style, Lisp and Symbolic and Computation, Special Issue on Continuations 63\/4 (Nov. 1993) 289\u2013360.","journal-title":"Reasoning about programs in continuation-passing style, Lisp and Symbolic and Computation, Special Issue on Continuations"},{"key":"188358_CR60","unstructured":"Sabry, Amr and Field, John. Reasoning about explicit and implicit representations of state. Technical Report YALEU\/DCS\/RR-968, Yale University, Jun. 1993. ACM Sigplan Workshop on State in Progrramming Languages."},{"key":"188358_CR61","doi-asserted-by":"crossref","unstructured":"Saint-James, Emmanuel. Recursion is more efficient than iteration. In 1984 ACM Symposium on Lisp and functional programming, 1984, pp. 228\u2013234.","DOI":"10.1145\/800055.802039"},{"issue":"1","key":"188358_CR62","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF01806126","volume":"3","author":"D. Sitaram","year":"1990","unstructured":"Sitaram, Dorai and Felleisen, Matthias. Control delimiters and their hierarchies, Lisp and Symbolic Computation 31 (1990) 67\u201399.","journal-title":"Control delimiters and their hierarchies, Lisp and Symbolic Computation"},{"key":"188358_CR63","series-title":"MIT AI Memo","volume-title":"Rabbit: a compiler for scheme","author":"L. Steele Jr.","year":"1978","unstructured":"Steele, Jr., Guy Lewis. Rabbit: a compiler for scheme. MIT AI Memo 474, Massachusetts Institute of Technology, Cambridge, MA., May 1978."},{"key":"188358_CR64","unstructured":"Steele, Jr., Guy Lewis. Common Lisp.The Language, Second Edition. Digital Press, 1990."},{"key":"188358_CR65","unstructured":"Stoy, Joseph E. Denotational semantics: The Scott-Strachey approach to programming language theory. The M.I.T. Press, 1977."},{"key":"188358_CR66","doi-asserted-by":"crossref","unstructured":"Talcott, Carolyn. Rum: an intensional theory of function and control abstractions. In Proce.1987Workshop on Foundations of Logic and Functional Programming. Lecture Notes in Computer Science 306. Springer-Verlag, 1988, pp. 3\u201344.","DOI":"10.1007\/3-540-19129-1_1"},{"key":"188358_CR67","unstructured":"Wall, Larry, Christiansen, Tom, and Schwartz, Randal L. Programming Perl, Second Edition. O'Reilly & Associates, Inc., 1996."}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010087314987.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1010087314987\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010087314987.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T13:54:41Z","timestamp":1751982881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1010087314987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":67,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["188358"],"URL":"https:\/\/doi.org\/10.1023\/a:1010087314987","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"type":"print","value":"1388-3690"},{"type":"electronic","value":"1573-0557"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}