Skip to content

Commit

Permalink
Chez Scheme Version 10.1.0
Browse files Browse the repository at this point in the history
  • Loading branch information
@burgerrg
burgerrg committed Nov 14, 2024
1 parent 2b67e17 commit 88a5c1c
Show file tree
Hide file tree
Showing 52 changed files with 50,625 additions and 6 deletions.
1 change: 1 addition & 0 deletions csug
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
csug10.1.0
253 changes: 253 additions & 0 deletions csug10.1.0/bibliography.html
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,253 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
"http://www.w3.org/TR/html4/loose.dtd"><!-- DO NOT EDIT THIS FILE-->
<!-- Edit the .tex version instead-->

<html>
<head>
<title>Bibliography</title>
<link href="csug.css" rel="stylesheet" type="text/css">
</head>
<body>

<a name="./bibliography:h0"></a>
<h1>Bibliography</h1>






<p>
<p>[<a name="g158">1</a>]
Michael Adams and R.&nbsp;Kent Dybvig.
Efficient nondestructive equality checking for trees and graphs.
In <i>Proceedings of the 13th ACM SIGPLAN International
Conference on Functional Programming</i>, 179-188, September 2008.

<p>
<p>[<a name="g159">2</a>]
J.&nbsp;Michael Ashley and R.&nbsp;Kent Dybvig.
An efficient implementation of multiple return values in Scheme.
In <i>Proceedings of the 1994 ACM Conference on Lisp and
Functional Programming</i>, 140-149, June 1994.

<p>
<p>[<a name="g160">3</a>]
Carl Bruggeman, Oscar Waddell, and R.&nbsp;Kent Dybvig.
Representing control in the presence of one-shot continuations.
In <i>Proceedings of the SIGPLAN '96 Conference on Programming
Language Design and Implementation</i>, 99-107, May 1996.

<p>
<p>[<a name="g161">4</a>]
Robert&nbsp;G. Burger and R.&nbsp;Kent Dybvig.
Printing floating-point numbers quickly and accurately.
In <i>Proceedings of the SIGPLAN '96 Conference on Programming
Language Design and Implementation</i>, 108-116, May 1996.

<p>
<p>[<a name="g162">5</a>]
Robert&nbsp;G. Burger and R.&nbsp;Kent Dybvig.
An infrastructure for profile-driven dynamic recompilation.
In <i>Proceedings of the IEEE Computer Society 1998
International Conference on Computer Languages</i>, 240-251, May 1998.

<p>
<p>[<a name="g163">6</a>]
Robert&nbsp;G. Burger, Oscar Waddell, and R.&nbsp;Kent Dybvig.
Register allocation using lazy saves, eager restores, and greedy
shuffling.
In <i>Proceedings of the ACM SIGPLAN '95 Conference on Programming
Language Design and Implementation</i>, 130-138, June 1995.

<p>
<p>[<a name="g164">7</a>]
R.&nbsp;Kent Dybvig.
<i>Three Implementation Models for Scheme</i>.
PhD thesis, University of North Carolina, Chapel Hill, April 1987.

<p>
<p>[<a name="g165">8</a>]
R.&nbsp;Kent Dybvig.
Writing hygienic macros in scheme with syntax-case.
Technical Report 356, Indiana Computer Science Department, June 1992.

<p>
<p>[<a name="g166">9</a>]
R.&nbsp;Kent Dybvig.
The development of Chez Scheme.
In <i>Proceedings of the Eleventh ACM SIGPLAN International
Conference on Functional Programming</i>, 1-12, September 2006.

<p>
<p>[<a name="g167">10</a>]
R.&nbsp;Kent Dybvig.
A Scheme for native threads.
In <i>Symposium in Honor of Mitchell Wand</i>, August 2009.
<i>https://web.archive.org/web/20170626072601/http://www.ccs.neu.edu/events/wand-symposium/talks/mitchfest-09-dybvig.pdf</i>.
<p>[<a name="g168">11</a>]
R.&nbsp;Kent Dybvig.
<i>The Scheme Programming Language</i>, 4th edition.
MIT Press, 2009.

<p>
<p>[<a name="g169">12</a>]
R.&nbsp;Kent Dybvig, Carl Bruggeman, and David Eby.
Guardians in a generation-based garbage collector.
In <i>Proceedings of the SIGPLAN '93 Conference on Programming
Language Design and Implementation</i>, 207-216, June 1993.

<p>
<p>[<a name="g170">13</a>]
R.&nbsp;Kent Dybvig, David Eby, and Carl Bruggeman.
Don't stop the BiBOP: Flexible and efficient storage management for
dynamically-typed languages.
Technical Report 400, Indiana Computer Science Department, March
1994.

<p>
<p>[<a name="g171">14</a>]
R.&nbsp;Kent Dybvig, Daniel&nbsp;P. Friedman, and Christopher&nbsp;T. Haynes.
Expansion-passing style: A general macro mechanism.
<i>Lisp and Symbolic Computation</i>, 1(1):53-75, 1988.

<p>
<p>[<a name="g172">15</a>]
R.&nbsp;Kent Dybvig and Robert Hieb.
Engines from continuations.
<i>Computer Languages</i>, 14(2):109-123, 1989.

<p>
<p>[<a name="g173">16</a>]
R.&nbsp;Kent Dybvig and Robert Hieb.
A new approach to procedures with variable arity.
<i>Lisp and Symbolic Computation</i>, 3(3):229-244, September
1990.

<p>
<p>[<a name="g174">17</a>]
R.&nbsp;Kent Dybvig, Robert Hieb, and Carl Bruggeman.
Syntactic abstraction in Scheme.
<i>Lisp and Symbolic Computation</i>, 5(4):295-326, 1993.

<p>
<p>[<a name="g175">18</a>]
R.&nbsp;Kent Dybvig, Robert Hieb, and Tom Butler.
Destination-driven code generation.
Technical Report 302, Indiana Computer Science Department, February
1990.

<p>
<p>[<a name="g176">19</a>]
Abdulaziz Ghuloum.
<i>Implicit phasing for library dependencies</i>.
PhD thesis, Indiana University, Indianapolis, IN, USA, 2008.
Adviser-Dybvig, R. Kent.

<p>
<p>[<a name="g177">20</a>]
Abdulaziz Ghuloum and R.&nbsp;Kent Dybvig.
Generation-friendly eq hash tables.
In <i>2007 Workshop on Scheme and Functional Programming</i>,
27-35, 2007.
<i>http://sfp2007.ift.ulaval.ca/programme.html</i>.
<p>[<a name="g178">21</a>]
Abdulaziz Ghuloum and R.&nbsp;Kent Dybvig.
Implicit phasing for R6RS libraries.
In <i><i>Proceedings of the 12th ACM SIGPLAN International
Conference on Functional Programming</i>, 303-314, 2007.
<i>http://doi.acm.org/10.1145/1291220.1291197</i>.
<p>[<a name="g179">22</a>]
Abdulaziz Ghuloum and R.&nbsp;Kent Dybvig.
Fixing letrec (reloaded).
In <i>2009 Workshop on Scheme and Functional Programming</i>, August
2009.
<i>http://www.schemeworkshop.org/2009/</i>.
<p>[<a name="g180">23</a>]
Barry Hayes.
Ephemerons: a new finalization mechanism.
In <i><i>Proceedings of the 12th ACM SIGPLAN Conference on
Object-Oriented Languages, Programming, Systems, and Applications</i>,
176-183, 1997.
<i>https://doi.org/10.1145/263700.263733</i>.
<p>[<a name="g181">24</a>]
Christopher&nbsp;T. Haynes and Daniel&nbsp;P. Friedman.
Abstracting timed preemption with engines.
<i>Computer Languages</i>, 12(2):109-121, 1987.

<p>
<p>[<a name="g182">25</a>]
Robert Hieb, R.&nbsp;Kent Dybvig, and Carl Bruggeman.
Representing control in the presence of first-class continuations.
In <i>Proceedings of the SIGPLAN '90 Conference on Programming
Language Design and Implementation</i>, 66-77, June 1990.

<p>
<p>[<a name="g183">26</a>]
IEEE Computer Society.
<i>IEEE Standard for the Scheme Programming Language</i>, May
1991.
IEEE Std 1178-1990.

<p>
<p>[<a name="g184">27</a>]
Eugene Kohlbecker.
<i>Syntactic Extensions in the Programming Language Lisp</i>.
PhD thesis, Indiana University, Bloomington, August 1986.

<p>
<p>[<a name="g185">28</a>]
Michael Sperber, R.&nbsp;Kent Dybvig, Matthew Flatt, and Anton van Straaten&nbsp;(eds.).
Revised<sup>6</sup> report on the algorithmic language Scheme, September
2007.
<i>http://www.r6rs.org/</i>.
<p>[<a name="g186">29</a>]
Michael Sperber, R.&nbsp;Kent Dybvig, Matthew Flatt, and Anton van Straaten&nbsp;(eds.).
Revised<sup>6</sup> report on the algorithmic language
Scheme---non-normative appendices, September 2007.
<i>http://www.r6rs.org/</i>.
<p>[<a name="g187">30</a>]
Guy&nbsp;L. Steele Jr.
<i>Common Lisp, the Language</i>, second edition.
Digital Press, 1990.

<p>
<p>[<a name="g188">31</a>]
Oscar Waddell and R.&nbsp;Kent Dybvig.
Fast and effective procedure inlining.
In <i>Fourth International Symposium on Static Analysis</i>, volume
1302 of <i>Springer-Verlag Lecture Notes in Computer Science</i>, 35-52.
Springer-Verlag, 1997.

<p>
<p>[<a name="g189">32</a>]
Oscar Waddell and R.&nbsp;Kent Dybvig.
Extending the scope of syntactic abstraction.
In <i>Conference Record of the 26th Annual ACM Symposium on
Principles of Programming Languages</i>, 203-213, January 1999.

<p>
<p>[<a name="g190">33</a>]
Oscar Waddell, Dipanwita Sarkar, and R.&nbsp;Kent Dybvig.
Fixing letrec: A faithful yet efficient implementation of Scheme's
recursive binding construct.
<i>Higher-order and symbolic computation</i>, 18(3/4):299-326, 2005.

<p>
</i></i>





<hr class=copyright align=left>
<p>
<a class=plain href="index.html">Chez Scheme Version 10 User's Guide</a><br>
Copyright &copy; 2024 Cisco Systems, Inc.<br>
Licensed under the <a href="http://www.apache.org/licenses/LICENSE-2.0">Apache License Version 2.0</a>
(<a class=plain href="canned/copyright.html">full copyright notice.</a>).</br>
Revised November 2024 for Chez Scheme Version 10.1.0<br>
<a class=plain href="canned/about.html">about this book</a>
</tr></table>
</body>
</html>
Loading

0 comments on commit 88a5c1c

Please sign in to comment.