2 lines
No EOL
19 KiB
HTML
2 lines
No EOL
19 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
|
|
<html><head><meta http-equiv="content-type" content="text/html; charset=utf-8"/><meta name="viewport" content="width=device-width, initial-scale=0.8"/><title>Bibliography</title><link rel="stylesheet" type="text/css" href="../scribble.css" title="default"/><link rel="stylesheet" type="text/css" href="extras.css" title="default"/><link rel="stylesheet" type="text/css" href="../racket.css" title="default"/><link rel="stylesheet" type="text/css" href="../manual-style.css" title="default"/><link rel="stylesheet" type="text/css" href="../manual-racket.css" title="default"/><link rel="stylesheet" type="text/css" href="../manual-racket.css" title="default"/><link rel="stylesheet" type="text/css" href="../doc-site.css" title="default"/><script type="text/javascript" src="../scribble-common.js"></script><script type="text/javascript" src="../manual-racket.js"></script><script type="text/javascript" src="../manual-racket.js"></script><script type="text/javascript" src="../doc-site.js"></script><script type="text/javascript" src="../local-redirect/local-redirect.js"></script><script type="text/javascript" src="../local-redirect/local-user-redirect.js"></script><!--[if IE 6]><style type="text/css">.SIEHidden { overflow: hidden; }</style><![endif]--></head><body id="doc-racket-lang-org"><div class="tocset"><div class="tocview"><div class="tocviewlist tocviewlisttopspace"><div class="tocviewtitle"><table cellspacing="0" cellpadding="0"><tr><td style="width: 1em;"><a href="javascript:void(0);" title="Expand/Collapse" class="tocviewtoggle" onclick="TocviewToggle(this,"tocview_0");">▼</a></td><td></td><td><a href="index.html" class="tocviewlink" data-pltdoc="x">The Racket Reference</a></td></tr></table></div><div class="tocviewsublistonly" style="display: block;" id="tocview_0"><table cellspacing="0" cellpadding="0"><tr><td align="right">1 </td><td><a href="model.html" class="tocviewlink" data-pltdoc="x">Language Model</a></td></tr><tr><td align="right">2 </td><td><a href="notation.html" class="tocviewlink" data-pltdoc="x">Notation for Documentation</a></td></tr><tr><td align="right">3 </td><td><a href="syntax.html" class="tocviewlink" data-pltdoc="x">Syntactic Forms</a></td></tr><tr><td align="right">4 </td><td><a href="data.html" class="tocviewlink" data-pltdoc="x">Datatypes</a></td></tr><tr><td align="right">5 </td><td><a href="structures.html" class="tocviewlink" data-pltdoc="x">Structures</a></td></tr><tr><td align="right">6 </td><td><a href="mzlib_class.html" class="tocviewlink" data-pltdoc="x">Classes and Objects</a></td></tr><tr><td align="right">7 </td><td><a href="mzlib_unit.html" class="tocviewlink" data-pltdoc="x">Units</a></td></tr><tr><td align="right">8 </td><td><a href="contracts.html" class="tocviewlink" data-pltdoc="x">Contracts</a></td></tr><tr><td align="right">9 </td><td><a href="match.html" class="tocviewlink" data-pltdoc="x">Pattern Matching</a></td></tr><tr><td align="right">10 </td><td><a href="control.html" class="tocviewlink" data-pltdoc="x">Control Flow</a></td></tr><tr><td align="right">11 </td><td><a href="concurrency.html" class="tocviewlink" data-pltdoc="x">Concurrency and Parallelism</a></td></tr><tr><td align="right">12 </td><td><a href="Macros.html" class="tocviewlink" data-pltdoc="x">Macros</a></td></tr><tr><td align="right">13 </td><td><a href="input-and-output.html" class="tocviewlink" data-pltdoc="x">Input and Output</a></td></tr><tr><td align="right">14 </td><td><a href="security.html" class="tocviewlink" data-pltdoc="x">Reflection and Security</a></td></tr><tr><td align="right">15 </td><td><a href="os.html" class="tocviewlink" data-pltdoc="x">Operating System</a></td></tr><tr><td align="right">16 </td><td><a href="memory.html" class="tocviewlink" data-pltdoc="x">Memory Management</a></td></tr><tr><td align="right">17 </td><td><a href="unsafe.html" class="tocviewlink" data-pltdoc="x">Unsafe Operations</a></td></tr><tr><td align="right">18 </td><td><a href="running.html" class="tocviewlink" data-pltdoc="x">Running Racket</a></td></tr><tr><td align="right"></td><td><a href="doc-bibliography.html" class="tocviewselflink" data-pltdoc="x">Bibliography</a></td></tr><tr><td align="right"></td><td><a href="doc-index.html" class="tocviewlink" data-pltdoc="x">Index</a></td></tr></table></div></div></div></div><div class="maincolumn"><div class="main"><div class="navsettop"><span class="navleft"><form class="searchform"><input class="searchbox" id="searchbox" type="text" tabindex="1" placeholder="...search manuals..." title="Enter a search string to search the manuals" onkeypress="return DoSearchKey(event, this, "8.6", "../");"/></form> <a href="https://docs.racket-lang.org/index.html" title="up to the documentation top" data-pltdoc="x" onclick="return GotoPLTRoot("8.6");">top</a><span class="tocsettoggle"> <a href="javascript:void(0);" title="show/hide table of contents" onclick="TocsetToggle();">contents</a></span></span><span class="navright"> <a href="Kernel_Forms_and_Functions.html" title="backward to "18.8 Kernel Forms and Functions"" data-pltdoc="x">← prev</a> <a href="index.html" title="up to "The Racket Reference"" data-pltdoc="x">up</a> <a href="doc-index.html" title="forward to "Index"" data-pltdoc="x">next →</a></span> </div><h3 x-source-module="(lib "scribblings/reference/reference.scrbl")" x-source-pkg="racket-doc" x-part-tag=""doc-bibliography""><a name="(part._doc-bibliography)"></a>Bibliography</h3><p><table cellspacing="0" cellpadding="0" class="RBibliography"><tr><td><a name="(cite._.C99)"></a>[C99]</td><td><span class="hspace"> </span></td><td><span class="bibentry">ISO/IEC, “ISO/IEC 9899:1999 Cor. 3:2007(E).” 2007.</span></td></tr><tr><td><a name="(cite._.Culpepper07)"></a>[Culpepper07]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Ryan Culpepper, Sam Tobin-Hochstadt, and Matthew Flatt, “Advanced Macrology and the Implementation of Typed Scheme,” Workshop on Scheme and Functional Programming, 2007. <a href="https://www2.ccs.neu.edu/racket/pubs/scheme2007-ctf.pdf"><span class="stt">https://www2.ccs.neu.edu/racket/pubs/scheme2007-ctf.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Danvy90)"></a>[Danvy90]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Olivier Danvy and Andre Filinski, “Abstracting Control,” LISP and Functional Programming, 1990. <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.6.960&rep=rep1&type=pdf"><span class="stt">http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.6.960&rep=rep1&type=pdf</span></a></span></td></tr><tr><td><a name="(cite._.Felleisen88a)"></a>[Felleisen88a]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Matthias Felleisen, “The theory and practice of first-class prompts,” Principles of Programming Languages, 1988. <a href="https://www.cs.tufts.edu/~nr/cs257/archive/matthias-felleisen/prompts.pdf"><span class="stt">https://www.cs.tufts.edu/~nr/cs257/archive/matthias-felleisen/prompts.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Felleisen88)"></a>[Felleisen88]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Matthias Felleisen, Mitch Wand, Dan Friedman, and Bruce Duba, “Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps,” LISP and Functional Programming, 1988. <a href="https://help.luddy.indiana.edu/techreports/TRNNN.cgi?trnum=TR248"><span class="stt">https://help.luddy.indiana.edu/techreports/TRNNN.cgi?trnum=TR248</span></a></span></td></tr><tr><td><a name="(cite._.Feltey18)"></a>[Feltey18]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Daniel Feltey, Ben Greenman, Christophe Scholliers, Robert Bruce Findler, and Vincent St-Amour, “Collapsible Contracts: Fixing a Pathology of Gradual Typing,” Object-Oriented Programming, Systems, and Languages (OOPSLA), 2018. <a href="https://www.ccis.northeastern.edu/~types/publications/collapsible/fgsfs-oopsla-2018.pdf"><span class="stt">https://www.ccis.northeastern.edu/~types/publications/collapsible/fgsfs-oopsla-2018.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Flatt02)"></a>[Flatt02]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Matthew Flatt, “Composable and Compilable Macros: You Want it When?,” International Conference on Functional Programming (ICFP), 2002. <a href="http://www.cs.utah.edu/plt/publications/gpce13-f-color.pdf"><span class="stt">http://www.cs.utah.edu/plt/publications/gpce13-f-color.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Friedman95)"></a>[Friedman95]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Daniel P. Friedman, C. T. Haynes, and R. Kent Dybvig, “Exception system proposal,” web page, 1995. <a href="https://web.archive.org/web/20161012054505/http://www.cs.indiana.edu/scheme-repository/doc.proposals.exceptions.html"><span class="stt">https://web.archive.org/web/20161012054505/http://www.cs.indiana.edu/scheme-repository/doc.proposals.exceptions.html</span></a></span></td></tr><tr><td><a name="(cite._.Gasbichler02)"></a>[Gasbichler02]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Martin Gasbichler and Michael Sperber, “Processes vs. User-Level Threads in Scsh,” Workshop on Scheme and Functional Programming, 2002. <a href="http://www.ccs.neu.edu/home/shivers/papers/scheme02/article/threads.pdf"><span class="stt">http://www.ccs.neu.edu/home/shivers/papers/scheme02/article/threads.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Greenberg15)"></a>[Greenberg15]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Michael Greenberg, “Space-Efficient Manifest Contracts,” Principles of Programming Languages (POPL), 2015. <a href="https://cs.pomona.edu/~michael/papers/popl2015_space.pdf"><span class="stt">https://cs.pomona.edu/~michael/papers/popl2015_space.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Gunter95)"></a>[Gunter95]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Carl Gunter, Didier Remy, and Jon Rieke, “A Generalization of Exceptions and Control in ML-like Languages,” Functional Programming Languages and Computer Architecture, 1995. <a href="http://gallium.inria.fr/~remy/ftp/prompt.pdf"><span class="stt">http://gallium.inria.fr/~remy/ftp/prompt.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Haynes84)"></a>[Haynes84]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Christopher T. Haynes and Daniel P. Friedman, “Engines Build Process Abstractions,” Symposium on LISP and Functional Programming, 1984. <a href="https://legacy.cs.indiana.edu/ftp/techreports/TR159.pdf"><span class="stt">https://legacy.cs.indiana.edu/ftp/techreports/TR159.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Hayes97)"></a>[Hayes97]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Barry Hayes, “Ephemerons: a New Finalization Mechanism,” Object-Oriented Languages, Programming, Systems, and Applications, 1997. <a href="https://static.aminer.org/pdf/PDF/000/522/273/ephemerons_a_new_finalization_mechanism.pdf"><span class="stt">https://static.aminer.org/pdf/PDF/000/522/273/ephemerons_a_new_finalization_mechanism.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Hieb90)"></a>[Hieb90]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Robert Hieb and R. Kent Dybvig, “Continuations and Concurrency,” Principles and Practice of Parallel Programming, 1990. <a href="https://legacy.cs.indiana.edu/ftp/techreports/TR256.pdf"><span class="stt">https://legacy.cs.indiana.edu/ftp/techreports/TR256.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Lamport79)"></a>[Lamport79]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Leslie Lamport, “How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs,” IEEE Transactions on Computers, 179. <a href="https://www.microsoft.com/en-us/research/uploads/prod/2016/12/How-to-Make-a-Multiprocessor-Computer-That-Correctly-Executes-Multiprocess-Programs.pdf"><span class="stt">https://www.microsoft.com/en-us/research/uploads/prod/2016/12/How-to-Make-a-Multiprocessor-Computer-That-Correctly-Executes-Multiprocess-Programs.pdf</span></a></span></td></tr><tr><td><a name="(cite._.L'.Ecuyer02)"></a>[L'Ecuyer02]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Pierre L’Ecuyer, Richard Simard, E. Jack Chen, and W. David Kelton, “An Object-Oriented Random-Number Package With Many Long Streams and Substreams,” Operations Research, 50(6), 2002. <a href="https://www.iro.umontreal.ca/~lecuyer/myftp/papers/streams00.pdf"><span class="stt">https://www.iro.umontreal.ca/~lecuyer/myftp/papers/streams00.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Queinnec91)"></a>[Queinnec91]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Queinnec and Serpette, “A Dynamic Extent Control Operator for Partial Continuations,” Principles of Programming Languages, 1991. <a href="https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.40.9946&rep=rep1&type=pdf"><span class="stt">https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.40.9946&rep=rep1&type=pdf</span></a></span></td></tr><tr><td><a name="(cite._.Reppy99)"></a>[Reppy99]</td><td><span class="hspace"> </span></td><td><span class="bibentry">John H. Reppy, <span style="font-style: italic">Concurrent Programming in ML</span>, Cambridge University Press, 1999. <a href="https://doi.org/10.1017/CBO9780511574962"><span class="stt">https://doi.org/10.1017/CBO9780511574962</span></a></span></td></tr><tr><td><a name="(cite._.Roux14)"></a>[Roux14]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Pierre Roux, “Innocuous Double Rounding of Basic Arithmetic Operations,” <span style="font-style: italic">Journal of Formalized Reasoning</span>, 7(1), 2014.</span></td></tr><tr><td><a name="(cite._.Sapin18)"></a>[Sapin18]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Simon Sapin, “The WTF-8 Encoding.” 2018. <a href="https://simonsapin.github.io/wtf-8/"><span class="stt">http://simonsapin.github.io/wtf-8/</span></a></span></td></tr><tr><td><a name="(cite._.Shan04)"></a>[Shan04]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Ken Shan, “Shift to Control,” Workshop on Scheme and Functional Programming, 2004. <a href="http://homes.sice.indiana.edu/ccshan/recur/recur.pdf"><span class="stt">http://homes.sice.indiana.edu/ccshan/recur/recur.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Sperber07)"></a>[Sperber07]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Michael Sperber, R. Kent Dybvig, Matthew Flatt, and Anton van Straaten (editors), “The Revised<span style="vertical-align: super; font-size: 80%">6</span> Report on the Algorithmic Language Scheme.” 2007. <a href="http://www.r6rs.org/"><span class="stt">http://www.r6rs.org/</span></a></span></td></tr><tr><td><a name="(cite._.Sitaram90)"></a>[Sitaram90]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Dorai Sitaram and Matthias Felleisen, “Control Delimiters and Their Hierarchies,” <span style="font-style: italic">Lisp and Symbolic Computation</span>, 1990. <a href="https://www2.ccs.neu.edu/racket/pubs/lasc1990-sf.pdf"><span class="stt">https://www2.ccs.neu.edu/racket/pubs/lasc1990-sf.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Sitaram93)"></a>[Sitaram93]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Dorai Sitaram, “Handling Control,” Programming Language Design and Implementation, 1993. <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.7256"><span class="stt">http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.7256</span></a></span></td></tr><tr><td><a name="(cite._.S.R.F.I-42)"></a>[SRFI-42]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Sebastian Egner, “SRFI-42: Eager Comprehensions,” SRFI, 2003. <a href="http://srfi.schemers.org/srfi-42/"><span class="stt">http://srfi.schemers.org/srfi-42/</span></a></span></td></tr><tr><td><a name="(cite._.Strickland12)"></a>[Strickland12]</td><td><span class="hspace"> </span></td><td><span class="bibentry">T. Stephen Strickland, Sam Tobin-Hochstadt, Matthew Flatt, and Robert Bruce Findler, “Chaperones and Impersonators: Run-time Support for Reasonable Interposition,” Object-Oriented Programming, Systems, and Languages (OOPSLA), 2012. <a href="http://www.eecs.northwestern.edu/~robby/pubs/papers/oopsla2012-stff.pdf"><span class="stt">http://www.eecs.northwestern.edu/~robby/pubs/papers/oopsla2012-stff.pdf</span></a></span></td></tr><tr><td><a name="(cite._.Torosyan21)"></a>[Torosyan21]</td><td><span class="hspace"> </span></td><td><span class="bibentry">Son Torosyan, Jon Zeppieri, and Matthew Flatt, “Runtime and Compiler Support for HAMTs,” Dynamic Languages Symposium (DLS), 2021. <a href="https://www.cs.utah.edu/plt/publications/dls21-tzf.pdf"><span class="stt">https://www.cs.utah.edu/plt/publications/dls21-tzf.pdf</span></a></span></td></tr></table></p><div class="navsetbottom"><span class="navleft"><form class="searchform"><input class="searchbox" id="searchbox" type="text" tabindex="1" placeholder="...search manuals..." title="Enter a search string to search the manuals" onkeypress="return DoSearchKey(event, this, "8.6", "../");"/></form> <a href="https://docs.racket-lang.org/index.html" title="up to the documentation top" data-pltdoc="x" onclick="return GotoPLTRoot("8.6");">top</a><span class="tocsettoggle"> <a href="javascript:void(0);" title="show/hide table of contents" onclick="TocsetToggle();">contents</a></span></span><span class="navright"> <a href="Kernel_Forms_and_Functions.html" title="backward to "18.8 Kernel Forms and Functions"" data-pltdoc="x">← prev</a> <a href="index.html" title="up to "The Racket Reference"" data-pltdoc="x">up</a> <a href="doc-index.html" title="forward to "Index"" data-pltdoc="x">next →</a></span> </div></div></div><div id="contextindicator"> </div></body></html> |