| [1] |
Harold Abelson, Gerald Jay Sussman, and Julie Sussman.
Structure and Interpretation of Computer Programs.
MIT Press, Cambridge, Mass., second edition, 1996.
|
| [2] |
J. W. Backus, F.L. Bauer, J.Green, C. Katz, J. McCarthy P. Naur, A. J. Perlis,
H. Rutishauser, K. Samuelson, B. Vauquois J. H. Wegstein, A. van Wijngaarden,
and M. Woodger.
Revised report on the algorithmic language Algol 60.
Communications of the ACM, 6(1):1–17, 1963.
|
| [3] |
Alan Bawden and Jonathan Rees.
Syntactic closures.
In ACM Conference on Lisp and Functional Programming, pages
86–95, Snowbird, Utah, 1988. ACM Press.
|
| [4] |
Scott Bradner.
Key words for use in RFCs to indicate requirement levels.
http://www.ietf.org/rfc/rfc2119.txt, March 1997.
RFC 2119.
|
| [5] |
Robert G. Burger and R. Kent Dybvig.
Printing floating-point numbers quickly and accurately.
In Proc. of the ACM SIGPLAN ’96 Conference on Programming
Language Design and Implementation, pages 108–116, Philadelphia, PA, USA,
May 1996. ACM Press.
|
| [6] |
Will Clinger, R. Kent Dybvig, Michael Sperber, and Anton van Straaten.
SRFI 76: R6RS records.
http://srfi.schemers.org/srfi-76/, 2005.
|
| [7] |
William Clinger.
The revised revised report on Scheme, or an uncommon Lisp.
Technical Report MIT Artificial Intelligence Memo 848, MIT, 1985
1985.
Also published as Computer Science Department Technical Report 174,
Indiana University, June 1985.
|
| [8] |
William Clinger.
Proper tail recursion and space efficiency.
In Keith Cooper, editor, Proceedings of the 1998 Conference on
Programming Language Design and Implementation, pages 174–185, Montreal,
Canada, June 1998. ACM Press.
Volume 33(5) of SIGPLAN Notices.
|
| [9] |
William Clinger and Jonathan Rees.
Revised3 report on the algorithmic language Scheme.
SIGPLAN Notices, 21(12):37–79, December 1986.
|
| [10] |
William Clinger and Jonathan Rees.
Macros that work.
In Proc. 1991 ACM SIGPLAN Symposium on Principles of
Programming Languages, pages 155–162, Orlando, Florida, January 1991. ACM
Press.
|
| [11] |
William Clinger and Jonathan Rees.
Revised4 report on the algorithmic language Scheme.
Lisp Pointers, IV(3):1–55, July–September 1991.
|
| [12] |
William D. Clinger.
How to read floating point numbers accurately.
In Proc. Conference on Programming Language Design and
Implementation ’90, pages 92–101, White Plains, New York, USA, June 1990.
ACM.
|
| [13] |
William D Clinger and Michael Sperber.
SRFI 77: Preliminary proposal for R6RS arithmetic.
http://srfi.schemers.org/srfi-77/, 2005.
|
| [14] |
R. Kent Dybvig.
The Scheme Programming Language.
MIT Press, Cambridge, third edition, 2003.
http://www.scheme.com/tspl3/.
|
| [15] |
R. Kent Dybvig.
Chez Scheme Version 7 User’s Guide.
Cadence Research Systems, 2005.
http://www.scheme.com/csug7/.
|
| [16] |
R. Kent Dybvig.
SRFI 93: R6RS syntax-case macros.
http://srfi.schemers.org/srfi-93/, 2006.
|
| [17] |
R. Kent Dybvig, Robert Hieb, and Carl Bruggeman.
Syntactic abstraction in Scheme.
Lisp and Symbolic Computation, 1(1):53–75, 1988.
|
| [18] |
Matthias Felleisen and Matthew Flatt.
Programming languages and lambda calculi.
http://www.cs.utah.edu/plt/publications/pllc.pdf, 2003.
|
| [19] |
Carol Fessenden, William Clinger, Daniel P. Friedman, and Christopher Haynes.
Scheme 311 version 4 reference manual.
Indiana University, 1983.
Indiana University Computer Science Technical Report 137, Superseded
by [23].
|
| [20] |
Matthew Flatt.
PLT MzScheme: Language Manual.
Rice University, University of Utah, July 2006.
http://download.plt-scheme.org/doc/352/html/mzscheme/.
|
| [21] |
Matthew Flatt and Kent Dybvig.
SRFI 83: R6RS library syntax.
http://srfi.schemers.org/srfi-83/, 2005.
|
| [22] |
Matthew Flatt and Mark Feeley.
SRFI 75: R6RS unicode data.
http://srfi.schemers.org/srfi-75/, 2005.
|
| [23] |
Daniel P. Friedman, Christopher Haynes, Eugene Kohlbecker, and Mitchell Wand.
Scheme 84 interim reference manual.
Indiana University, January 1985.
Indiana University Computer Science Technical Report 153.
|
| [24] |
Lars T Hansen.
SRFI 11: Syntax for receiving multiple values.
http://srfi.schemers.org/srfi-11/, 2000.
|
| [25] |
IEEE standard 754-1985. IEEE standard for binary floating-point arithmetic,
1985.
Reprinted in SIGPLAN Notices, 22(2):9-25, 1987.
|
| [26] |
Richard Kelsey, William Clinger, and Jonathan Rees.
Revised5 report on the algorithmic language Scheme.
Higher-Order and Symbolic Computation, 11(1):7–105, 1998.
|
| [27] |
Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, and Bruce Duba.
Hygienic macro expansion.
In Proceedings of the 1986 ACM Conference on Lisp and
Functional Programming, pages 151–161, 1986.
|
| [28] |
Eugene E. Kohlbecker Jr.
Syntactic Extensions in the Programming Language Lisp.
PhD thesis, Indiana University, August 1986.
|
| [29] |
Peter Landin.
A correspondence between Algol 60 and Church’s lambda notation:
Part I.
Communications of the ACM, 8(2):89–101, February 1965.
|
| [30] |
Jacob Matthews and Robert Bruce Findler.
An operational semantics for R5RS Scheme.
In J. Michael Ashley and Michael Sperber, editors, Proceedings
of the Sixth Workshop on Scheme and Functional Programming, pages 41–54,
Tallin, Estonia, September 2005.
Indiana University Technical Report TR619.
|
| [31] |
Jacob Matthews, Robert Bruce Findler, Matthew Flatt, and Matthias Felleisen.
A visual environment for developing context-sensitive term rewriting
systems.
In Proc. 15th Conference on Rewriting Techniques and
Applications, Aachen, June 2004. Springer-Verlag.
|
| [32] |
MIT Department of Electrical Engineering and Computer Science.
Scheme manual, seventh edition, September 1984.
|
| [33] |
Paul Penfield Jr.
Principal values and branch cuts in complex APL.
In APL ’81 Conference Proceedings, pages 248–256, San
Francisco, September 1981. ACM SIGAPL.
Proceedings published as APL Quote Quad 12(1).
|
| [34] |
Jonathan A. Rees and Norman I. Adams IV.
T: a dialect of lisp or lambda: The ultimate software tool.
In ACM Conference on Lisp and Functional Programming, pages
114–122, Pittsburgh, Pennsylvania, 1982. ACM Press.
|
| [35] |
Jonathan A. Rees, Norman I. Adams IV, and James R. Meehan.
The T manual.
Yale University Computer Science Department, fourth edition, January
1984.
|
| [36] |
John C. Reynolds.
Definitional interpreters for higher-order programming languages.
In ACM Annual Conference, pages 717–740, July 1972.
|
| [37] |
Scheme standardization charter.
http://www.schemers.org/Documents/Standards/Charter/mar-2006.txt, March
2006.
|
| [38] |
Michael Sperber, William Clinger, R. Kent Dybvig, Matthew Flatt, Anton van
Straaten, Richard Kelsey, and Jonathan Rees.
Revised6 report on the algorithmic language Scheme — libraries
—.
http://www.r6rs.org/, 2007.
|
| [39] |
Michael Sperber, William Clinger, R. Kent Dybvig, Matthew Flatt, Anton van
Straaten, Richard Kelsey, and Jonathan Rees.
Revised6 report on the algorithmic language Scheme —
non-normative appendices —.
http://www.r6rs.org/, 2007.
|
| [40] |
Guy Lewis Steele Jr.
Rabbit: a compiler for Scheme.
Technical Report MIT Artificial Intelligence Laboratory Technical
Report 474, MIT, May 1978.
|
| [41] |
Guy Lewis Steele Jr.
Common Lisp: The Language.
Digital Press, Burlington, MA, second edition, 1990.
|
| [42] |
Guy Lewis Steele Jr. and Gerald Jay Sussman.
The revised report on Scheme, a dialect of Lisp.
Technical Report MIT Artificial Intelligence Memo 452, MIT, January
1978.
|
| [43] |
Gerald Jay Sussman and Guy Lewis Steele Jr.
Scheme: an interpreter for extended lambda calculus.
Technical Report MIT Artificial Intelligence Memo 349, MIT, December
1975.
|
| [44] |
Texas Instruments, Inc.
TI Scheme Language Reference Manual, November 1985.
Preliminary version 1.0.
|
| [45] |
The Unicode Consortium.
The Unicode standard, version 5.0.0.
defined by: The Unicode Standard, Version 5.0 (Boston, MA,
Addison-Wesley, 2007. ISBN 0-321-48091-0), 2007.
|
| [46] |
William M. Waite and Gerhard Goos.
Compiler Construction.
Springer-Verlag, 1984.
|
| [47] |
Andrew Wright and Matthias Felleisen.
A syntactic approach to type soundness.
Information and Computation, 115(1):38–94, 1994.
First appeared as Technical Report TR160, Rice University, 1991.
|