📄 r5rs-z-h-14.html
字号:
<!doctype html public "-//W3C//DTD HTML 4.0 Transitional//EN" "http://www.w3.org/TR/REC-html40/loose.dtd"><html><!-- Generated from TeX source by tex2page, v 4o4, (c) Dorai Sitaram, http://www.cs.rice.edu/~dorai/tex2page --><head><title>Revised^5 Report on the Algorithmic Language Scheme</title><link rel="stylesheet" type="text/css" href="r5rs-Z-C.css" title=default><meta name=robots content="noindex,follow"></head><body><p><div class=navigation>[Go to <span><a href="r5rs.html">first</a>, <a href="r5rs-Z-H-13.html">previous</a></span><span>, <a href="r5rs-Z-H-15.html">next</a></span> page<span>; </span><span><a href="r5rs-Z-H-2.html#%_toc_start">contents</a></span><span><span>; </span><a href="r5rs-Z-H-15.html#%_index_start">index</a></span>]</div><p><a name="%_chap_Temp_10"></a><h1 class=chapter><div class=chapterheading> </div><p><a href="r5rs-Z-H-2.html#%_toc_%_chap_Temp_10">Bibliography</a></h1><p><table><p><p><tr><td align=right valign=top><a name="\cite{SICP}"></a>[1] <td>Harold Abelson and Gerald Jay Sussman with Julie Sussman.<i>Structure and Interpretation of Computer Programs, second edition.</i>MIT Press, Cambridge, 1996.<p><p><tr><td align=right valign=top><a name="\cite{Bawden88}"></a>[2] <td> Alan Bawden and Jonathan Rees.Syntactic closures.In <i>Proceedings of the 1988 ACM Symposium on Lisp andFunctional Programming</i>, pages 86-95.<p><p><tr><td align=right valign=top><a name="\cite{howtoprint}"></a>[3] <td>Robert G. Burger and R. Kent Dybvig.Printing floating-point numbers quickly and accurately.In <i>Proceedings of the ACM SIGPLAN '96 Conferenceon Programming Language Design and Implementation</i>, pages 108-116.<p><p><tr><td align=right valign=top><a name="\cite{RRRS}"></a>[4] <td>William Clinger, editor.The revised revised report on Scheme, or an uncommon Lisp.MIT Artificial Intelligence Memo 848, August 1985.Also published as Computer Science Department Technical Report 174,Indiana University, June 1985.<p><p><tr><td align=right valign=top><a name="\cite{howtoread}"></a>[5] <td> William Clinger.How to read floating point numbers accurately.In <i>Proceedings of the ACM SIGPLAN '90 Conferenceon Programming Language Design and Implementation</i>, pages 92-101.Proceedings published as <i>SIGPLAN Notices</i> 25(6), June 1990.<p><p><tr><td align=right valign=top><a name="\cite{R4RS}"></a>[6] <td>William Clinger and Jonathan Rees, editors.The revised<sup>4</sup> report on the algorithmic language Scheme.In <i>ACM Lisp Pointers</i> 4(3), pages 1-55, 1991.<p><p><tr><td align=right valign=top><a name="\cite{macrosthatwork}"></a>[7] <td> William Clinger and Jonathan Rees.Macros that work.In <i>Proceedings of the 1991 ACM Conference on Principles ofProgramming Languages</i>, pages 155-162.<p><p><tr><td align=right valign=top><a name="\cite{propertailrecursion}"></a>[8] <td> William Clinger.Proper Tail Recursion and Space Efficiency.To appear in <i>Proceedings of the 1998 ACM Conference on ProgrammingLanguage Design and Implementation</i>, June 1998.<p><p><tr><td align=right valign=top><a name="\cite{syntacticabstraction}"></a>[9] <td>R. Kent Dybvig, Robert Hieb, and Carl Bruggeman.Syntactic abstraction in Scheme.<i>Lisp and Symbolic Computation</i> 5(4):295-326, 1993.<p><p><tr><td align=right valign=top><a name="\cite{Scheme311}"></a>[10] <td>Carol Fessenden, William Clinger, Daniel P. Friedman, and Christopher Haynes.Scheme 311 version 4 reference manual.Indiana University Computer Science Technical Report 137, February 1983.Superseded by [<a href="#%_sec_7.3">11</a>].<p><p><tr><td align=right valign=top><a name="\cite{Scheme84}"></a>[11] <td>D. Friedman, C. Haynes, E. Kohlbecker, and M. Wand.Scheme 84 interim reference manual.Indiana University Computer Science Technical Report 153, January 1985.<p><p><tr><td align=right valign=top><a name="\cite{IEEE}"></a>[12] <td><i>IEEE Standard 754-1985. IEEE Standard for Binary Floating-PointArithmetic.</i> IEEE, New York, 1985.<p><p><tr><td align=right valign=top><a name="\cite{IEEEScheme}"></a>[13] <td><i>IEEE Standard 1178-1990. IEEE Standard for the SchemeProgramming Language.</i> IEEE, New York, 1991.<p><p><tr><td align=right valign=top><a name="\cite{Kohlbecker86}"></a>[14] <td>Eugene E. Kohlbecker Jr.<i>Syntactic Extensions in the Programming Language Lisp.</i>PhD thesis, Indiana University, August 1986.<p><p><tr><td align=right valign=top><a name="\cite{hygienic}"></a>[15] <td>Eugene E. Kohlbecker Jr., Daniel P. Friedman, Matthias Felleisen, and Bruce Duba.Hygienic macro expansion.In <i>Proceedings of the 1986 ACM Conference on Lispand Functional Programming</i>, pages 151-161.<p><p><tr><td align=right valign=top><a name="\cite{Landin65}"></a>[16] <td>Peter Landin.A correspondence between Algol 60 and Church's lambda notation: Part I.<i>Communications of the ACM</i> 8(2):89-101, February 1965.<p><p><tr><td align=right valign=top><a name="\cite{MITScheme}"></a>[17] <td>MIT Department of Electrical Engineering and Computer Science.Scheme manual, seventh edition.September 1984.<p><p><tr><td align=right valign=top><a name="\cite{Naur63}"></a>[18] <td>Peter Naur et al.Revised report on the algorithmic language Algol 60.<i>Communications of the ACM</i> 6(1):1-17, January 1963.<p><p><tr><td align=right valign=top><a name="\cite{Penfield81}"></a>[19] <td>Paul Penfield, Jr.Principal values and branch cuts in complex APL.In <i>APL '81 Conference Proceedings,</i> pages 248-256.ACM SIGAPL, San Francisco, September 1981.Proceedings published as <i>APL Quote Quad</i> 12(1), ACM, September 1981.<p><p><tr><td align=right valign=top><a name="\cite{Pitman83}"></a>[20] <td>Kent M. Pitman.The revised MacLisp manual (Saturday evening edition).MIT Laboratory for Computer Science Technical Report 295, May 1983.<p><p><tr><td align=right valign=top><a name="\cite{Rees82}"></a>[21] <td>Jonathan A. Rees and Norman I. Adams IV.T: A dialect of Lisp or, lambda: The ultimate software tool.In <i>Conference Record of the 1982 ACM Symposium on Lisp andFunctional Programming</i>, pages 114-122.<p><p><tr><td align=right valign=top><a name="\cite{Rees84}"></a>[22] <td>Jonathan A. Rees, Norman I. Adams IV, and James R. Meehan.The T manual, fourth edition.Yale University Computer Science Department, January 1984.<p><p><tr><td align=right valign=top><a name="\cite{R3RS}"></a>[23] <td>Jonathan Rees and William Clinger, editors.The revised<sup>3</sup> report on the algorithmic language Scheme.In <i>ACM SIGPLAN Notices</i> 21(12), pages 37-79, December 1986.<p><p><tr><td align=right valign=top><a name="\cite{Reynolds72}"></a>[24] <td>John Reynolds.Definitional interpreters for higher order programming languages.In <i>ACM Conference Proceedings</i>, pages 717-740.ACM, 1972.<p><p><tr><td align=right valign=top><a name="\cite{Scheme78}"></a>[25] <td>Guy Lewis Steele Jr. and Gerald Jay Sussman.The revised report on Scheme, a dialect of Lisp.MIT Artificial Intelligence Memo 452, January 1978.<p><p><tr><td align=right valign=top><a name="\cite{Rabbit}"></a>[26] <td>Guy Lewis Steele Jr.Rabbit: a compiler for Scheme.MIT Artificial Intelligence Laboratory Technical Report 474, May 1978.<p><p><tr><td align=right valign=top><a name="\cite{CLtL}"></a>[27] <td>Guy Lewis Steele Jr.<i>Common Lisp: The Language, second edition.</i>Digital Press, Burlington MA, 1990.<p><p><tr><td align=right valign=top><a name="\cite{Scheme75}"></a>[28] <td>Gerald Jay Sussman and Guy Lewis Steele Jr.Scheme: an interpreter for extended lambda calculus.MIT Artificial Intelligence Memo 349, December 1975.<p><p><tr><td align=right valign=top><a name="\cite{Stoy77}"></a>[29] <td>Joseph E. Stoy.<i>Denotational Semantics: The Scott-Strachey Approach toProgramming Language Theory.</i>MIT Press, Cambridge, 1977.<p><p><tr><td align=right valign=top><a name="\cite{TImanual85}"></a>[30] <td>Texas Instruments, Inc.TI Scheme Language Reference Manual.Preliminary version 1.0, November 1985. <p></table><p><div class=navigation>[Go to <span><a href="r5rs.html">first</a>, <a href="r5rs-Z-H-13.html">previous</a></span><span>, <a href="r5rs-Z-H-15.html">next</a></span> page<span>; </span><span><a href="r5rs-Z-H-2.html#%_toc_start">contents</a></span><span><span>; </span><a href="r5rs-Z-H-15.html#%_index_start">index</a></span>]</div><p></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -