References

[1]   Harold Abelson, Gerald Jay Sussman, and Julie Sussman. Structure and Interpretation of Computer Programs. MIT Press, Cambridge, Mass., second edition, 1996.

[2]   Will Clinger, R. Kent Dybvig, Michael Sperber, and Anton van Straaten. SRFI 76: R6RS records. http://srfi.schemers.org/srfi-76/, 2005.

[3]   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.

[4]   William Clinger and Jonathan Rees. Revised3 report on the algorithmic language Scheme. SIGPLAN Notices, 21(12):37–79, December 1986.

[5]   William Clinger and Jonathan Rees. Revised4 report on the algorithmic language Scheme. Lisp Pointers, IV(3):1–55, July–September 1991.

[6]   William D Clinger and Michael Sperber. SRFI 77: Preliminary proposal for R6RS arithmetic. http://srfi.schemers.org/srfi-77/, 2005.

[7]   Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. MIT Press and McGraw-Hill, second edition, 2001.

[8]   R. Kent Dybvig. The Scheme Programming Language. MIT Press, Cambridge, third edition, 2003. http://www.scheme.com/tspl3/.

[9]   R. Kent Dybvig. SRFI 93: R6RS syntax-case macros. http://srfi.schemers.org/srfi-93/, 2006.

[10]   R. Kent Dybvig, Robert Hieb, and Carl Bruggeman. Syntactic abstraction in Scheme. Lisp and Symbolic Computation, 1(1):53–75, 1988.

[11]   Sebastian Egner, Richard Kelsey, and Michael Sperber. Cleaning up the tower: Numbers in Scheme. In Olin Shivers and Oscar Waddell, editors, Proceedings of the Fifth Workshop on Scheme and Functional Programming, pages 109–120, Snowbird, October 2004. Indiana University Technical Report TR600.

[12]   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 [15].

[13]   Matthew Flatt and Kent Dybvig. SRFI 83: R6RS library syntax. http://srfi.schemers.org/srfi-83/, 2005.

[14]   Matthew Flatt and Marc Feeley. SRFI 75: R6RS unicode data. http://srfi.schemers.org/srfi-75/, 2005.

[15]   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.

[16]   Lars T Hansen. SRFI 11: Syntax for receiving multiple values. http://srfi.schemers.org/srfi-11/, 2000.

[17]   IEEE standard 754-1985. IEEE standard for binary floating-point arithmetic, 1985. Reprinted in SIGPLAN Notices, 22(2):9-25, 1987.

[18]   IEEE 754 revision work. http://grouper.ieee.org/groups/754/revision.html, 2006.

[19]   Aubrey Jaffer. SRFI 60: Integers as bits. http://srfi.schemers.org/srfi-60/, 2005.

[20]   Richard Kelsey, William Clinger, and Jonathan Rees. Revised5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation, 11(1):7–105, 1998.

[21]   Richard Kelsey and Michael Sperber. SRFI 34: Exception handling for programs. http://srfi.schemers.org/srfi-34/, 2002.

[22]   Peter Landin. A correspondence between Algol 60 and Church’s lambda notation: Part I. Communications of the ACM, 8(2):89–101, February 1965.

[23]   MIT Department of Electrical Engineering and Computer Science. Scheme manual, seventh edition, September 1984.

[24]   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).

[25]   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.

[26]   John C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM Annual Conference, pages 717–740, July 1972.

[27]   Scheme standardization charter. http://www.schemers.org/Documents/Standards/Charter/mar-2006.txt, March 2006.

[28]   Olin Shivers. SRFI 1: List library. http://srfi.schemers.org/srfi-1/, 1999.

[29]   Olin Shivers. SRFI 33: Integer bitwise-operation library. http://srfi.schemers.org/srfi-33/, 2002.

[30]   Michael Sperber. SRFI 74: Octet-addressed binary blocks. http://srfi.schemers.org/srfi-74/, 2005.

[31]   Michael Sperber, William Clinger, R. Kent Dybvig, Matthew Flatt, Anton van Straaten, Richard Kelsey, and Jonathan Rees. Revised6 report on the algorithmic language Scheme. http://www.r6rs.org/, 2007.

[32]   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.

[33]   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.

[34]   Guy Lewis Steele Jr. Rabbit: a compiler for Scheme. Technical Report MIT Artificial Intelligence Laboratory Technical Report 474, MIT, May 1978.

[35]   Guy Lewis Steele Jr. Common Lisp: The Language. Digital Press, Burlington, MA, second edition, 1990.

[36]   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.

[37]   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.