{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:43:38Z","timestamp":1780994618285,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540544449","type":"print"},{"value":"9783540383628","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54444-5_83","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:48:52Z","timestamp":1330210132000},"page":"1-13","source":"Crossref","is-referenced-by-count":66,"title":["Standard ML of New Jersey"],"prefix":"10.1007","author":[{"given":"Andrew W.","family":"Appel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David B.","family":"MacQueen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01811537","volume":"2","author":"A. W. Appel","year":"1989","unstructured":"Andrew W. Appel. Runtime tags aren't necessary. Lisp and Symbolic Computation, 2:153\u2013162, 1989.","journal-title":"Lisp and Symbolic Computation"},{"issue":"2","key":"1_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/spe.4380190206","volume":"19","author":"A. W. Appel","year":"1989","unstructured":"Andrew W. Appel. Simple generational garbage collection and fast allocation. Software\u2014Practice and Experience, 19(2):171\u2013183, 1989.","journal-title":"Software\u2014Practice and Experience"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF01807697","volume":"3","author":"A. W. Appel","year":"1990","unstructured":"Andrew W. Appel. A runtime system. Lisp and Symbolic Computation, 3(343\u2013380), 1990.","journal-title":"Lisp and Symbolic Computation"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Andrew W. Appel. Compiling with Continuations. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511609619"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Andrew W. Appel and Trevor Jim. Continuation-passing, closure-passing style. In Sixteenth ACM Symp. on Principles of Programming Languages, pages 293\u2013302, 1989.","DOI":"10.1145\/75277.75303"},{"key":"1_CR6","unstructured":"Andrew W. Appel and Trevor T. Y. Jim. Optimizing closure environment representations. Technical Report 168, Dept. of Computer Science, Princeton University, 1988."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Andrew W. Appel and David B. MacQueen. A Standard ML compiler. In Gilles Kahn, editor, Functional Programming Languages and Computer Architecture (LNCS 274), pages 301\u2013324. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18317-5_17"},{"key":"1_CR8","unstructured":"Andrew W. Appel, James S. Mattson, and David R. Tarditi. A lexical analyzer generator for Standard ML. distributed with Standard ML of New Jersey, December 1989."},{"key":"1_CR9","series-title":"Technical Report","volume-title":"Callee-save registers in continuation-passing style","author":"A. W. Appel","year":"1991","unstructured":"Andrew W. Appel and Zhong Shao. Callee-save registers in continuation-passing style. Technical Report CS-TR-326-91, Princeton Univ. Dept. of Computer Science, Princeton, NJ, June 1991."},{"key":"1_CR10","unstructured":"David Berry. SML resources. sent to the SML mailing list by db@lfcs.ed.ac.uk, May 1991."},{"key":"1_CR11","unstructured":"CAML: The reference manual (version 2.3). Projet Formel, INRIA-ENS, June 1987."},{"key":"1_CR12","unstructured":"Eric C. Cooper and J. Gregory Morrisett. Adding threads to Standard ML. Technical Report CMU-CS-90-186, School of Computer Science, Carnegie Mellon University, December 1990."},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N. G. deBruijn","year":"1972","unstructured":"N. G. deBruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation. Indag. Math., 34:381\u2013392, 1972.","journal-title":"Indag. Math."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Bruce Duba, Robert Harper, and David MacQueen. Typing first-class continuations in ML. In Eighteenth Annual ACM Symp. on Principles of Prog. Languages, pages 163\u2013173, Jan 1991.","DOI":"10.1145\/99583.99608"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Carl A. Gunter, Elsa L. Gunter, and David B. MacQueen. An abstract interpretation for ML equality kinds. In Theoretical Aspects of Computer Software. Springer, September 1991.","DOI":"10.1007\/3-540-54415-1_43"},{"key":"1_CR16","series-title":"Technical Report","volume-title":"Yacc \u2014 yet another compiler compiler","author":"S. C. Johnson","year":"1975","unstructured":"S. C. Johnson. Yacc \u2014 yet another compiler compiler. Technical Report CSTR-32, AT&T Bell Laboratories, Murray Hill, NJ, 1975."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"James William O'Toole Jr. Type abstraction rules for references: A comparison of four which have achieved noteriety. Technical Report 380, MIT Lab. for Computer Science, 1990.","DOI":"10.21236\/ADA240076"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"David Kranz. ORBIT: An optimizing compiler for Scheme. PhD thesis, Yale University, 1987.","DOI":"10.1145\/12276.13333"},{"issue":"4","key":"1_CR19","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P. J. Landin","year":"1964","unstructured":"P. J. Landin. The mechanical evaluation of expressions. Computer J., 6(4):308\u2013320, 1964.","journal-title":"Computer J."},{"key":"1_CR20","unstructured":"Xavier Leroy. The ZINC experiment: an economical implementation of the ML language. Technical Report No. 117, INRIA, February 1990."},{"key":"1_CR21","unstructured":"Xavier Leroy. INRIA, personal communication, 1991."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Xavier Leroy and Pierre Weis. Polymorphic type inference and assignment. In Eighteenth Annual ACM Symp. on Principles of Prog. Languages, Jan 1991.","DOI":"10.1145\/99583.99622"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"David B. MacQueen. The implementation of Standard ML modules. In ACM Conf. on Lisp and Functional Programming, pages 212\u2013223, 1988.","DOI":"10.1145\/62678.62704"},{"key":"1_CR24","unstructured":"David C. J. Matthews. Papers on Poly\/ML. Technical Report T.R. No. 161, Computer Laboratory, University of Cambridge, February 1989."},{"key":"1_CR25","volume-title":"Commentary on Standard ML","author":"R. Milner","year":"1991","unstructured":"Robin Milner and Mads Tofte. Commentary on Standard ML. MIT Press, Cambridge, Massachusetts, 1991."},{"key":"1_CR26","volume-title":"The Definition of Standard ML","author":"R. Milner","year":"1989","unstructured":"Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, Cambridge, Mass., 1989."},{"key":"1_CR27","series-title":"Technical Report TR","volume-title":"Asynchronous signals in Standard ML","author":"J. H. Reppy","year":"1990","unstructured":"John H. Reppy. Asynchronous signals in Standard ML. Technical Report TR 90-1144, Cornell University, Dept. of Computer Science, Ithaca, NY, 1990."},{"key":"1_CR28","series-title":"Technical report","volume-title":"Concurrent programming with events","author":"J. H. Reppy","year":"1990","unstructured":"John H. Reppy. Concurrent programming with events. Technical report, Cornell University, Dept. of Computer Science, Ithaca, NY, 1990."},{"key":"1_CR29","unstructured":"John H. Reppy and Emden R. Gansner. The eXene library manual. Cornell Univ. Dept. of Computer Science, March 1991."},{"key":"1_CR30","unstructured":"Guy L. Steele. Rabbit: a compiler for Scheme. Technical Report AI-TR-474, MIT, 1978."},{"key":"1_CR31","unstructured":"David R. Tarditi, Anurag Acharya, and Peter Lee. No assembly required: Compiling Standard ML to C. Technical Report CMU-CS-90-187, Carnegie Mellon Univ., November 1990."},{"key":"1_CR32","unstructured":"David R. Tarditi and Andrew W. Appel. ML-Yacc, version 2.0. distributed with Standard ML of New Jersey, April 1990."},{"key":"1_CR33","unstructured":"Mads Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, Edinburgh University, 1988. CST-52-88."},{"key":"1_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(90)90018-D","volume":"89","author":"M. Tofte","year":"1990","unstructured":"Mads Tofte. Type inference for polymorphic references. Information and Computation, 89:1\u201334, November 1990.","journal-title":"Information and Computation"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Andrew P. Tolmach and Andrew W. Appel. Debugging Standard ML without reverse engineering. In Proc. 1990 ACM Conf. on Lisp and Functional Programming, pages 1\u201312, June 1990.","DOI":"10.1145\/91556.91564"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less ad hoc. In Sixteenth Annual ACM Symp. on Principles of Prog. Languages, pages 60\u201376, Jan 1989.","DOI":"10.1145\/75277.75283"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Mitchell Wand. Continuation-based multiprocessing. In Conf. Record of the 1980 Lisp Conf., pages 19\u201328, August 1980.","DOI":"10.1145\/800087.802786"},{"key":"1_CR38","unstructured":"Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Technical Report COMP TR91-160, Rice University, April 1991."}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54444-5_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:37Z","timestamp":1605646477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54444-5_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544449","9783540383628"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-54444-5_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}