E  References

[1]   Harold Abelson and Gerald Jay Sussman with Julie Sussman. Structure and Interpretation of Computer Programs (“SICP”). MIT Press, 2nd edition, 1996.

[2]   Milton Abramowitz and Irene A. Stegun, editors. Handbook of Mathematical Functions: with Formulas, Graphs, and Mathematical Tables. Dover Publications, 1965.

[3]   Per Bothner. The Kawa Scheme system.

[4]   William Clinger. Nondeterministic call by need is neither lazy nor by name. In Proc. ACM Symp. Lisp and Functional Programming, pages 226–234, 1982.

[5]   R. Kent Dybvig. The Scheme Programming Language. Prentice Hall PTR, 2nd edition, 1996.

[6]   Marc Feeley. Gambit Scheme System.

[7]   Matthias Felleisen. Transliterating Prolog into Scheme. Technical Report 182, Indiana U. Comp. Sci. Dept, 1985.

[8]   Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, and Shriram Krishnamurthi. How to Design Programs: An Introduction to Programming and Computing. MIT Press, 2001.

[9]   Matthew Flatt. MzScheme.

[10]   Daniel P. Friedman and Matthias Felleisen. The Little Schemer. MIT Press, 4th edition, 1996.

[11]   Daniel P. Friedman and Matthias Felleisen. The Seasoned Schemer. MIT Press, 1996.

[12]   Daniel P. Friedman, Mitchell Wand, and Christopher T. Haynes. Essentials of Programming Languages. MIT Press, McGraw-Hill, 1992.

[13]   FSF. Guile: Project GNU’s Extension Language.

[14]   Erick Gallesio. STk.

[15]   Ben Goetter. Pocket Scheme for the H/PC and P/PC.

[16]   Christopher T. Haynes. Logic continuations. In J. Logic Program., pages 157–176, 1987. vol 4.

[17]   Christopher T. Haynes and Daniel P. Friedman. Engines Build Process Abstractions. In Conf. ACM Symp. Lisp and Functional Programming, pages 18–24, 1984.

[18]   Christopher T. Haynes, Daniel P. Friedman, and Mitchell Wand. Continuations and Coroutines. In Conf. ACM Symp. Lisp and Functional Programming, pages 293–298, 1984.

[19]   J. A. H. Hunter. Mathematical Brain-Teasers. Dover Publications, 1976.

[20]   Aubrey Jaffer. SCM.

[21]   Shiro Kawai. Gauche: A Scheme Implementation.

[22]   Sonya E. Keene. Object-oriented Programming in Common Lisp: A Programmer’s Guide to CLOS. Addison-Wesley, 1989.

[23]   Richard Kelsey, William Clinger, and Jonathan Rees (eds). Revised̂5 Report on the Algorithmic Language Scheme (“R5RS”), 1998.

[24]   Gregor Kiczales, Jim des Rivières, and Daniel G. Bobrow. The Art of the Metaobject Protocol. MIT Press, 1991.

[25]   John McCarthy. A Basis for a Mathematical Theory of Computation. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems. North-Holland, 1967.

[26]   MIT Scheme Team. MIT Scheme.

[27]   Paul J. Nahin. Digital Dice: Computational Solutions to Practical Probability Problems. Princeton University Press, 2008.

[28]   NCSA. The Common Gateway Interface.

[29]   Christian Queinnec. Lisp in Small Pieces. Cambridge University Press, 1996.

[30]   Thomas L. Saaty and Paul C. Kainen. The Four-Color Problem: Assaults and Conquest. Dover Publications, 1986.

[31]   Manuel Serrano. Bigloo.

[32]   Leon Sterling and Ehud Shapiro. The Art of Prolog. MIT Press, 2nd edition, 1994.

[33]   Felix L. Winkelmann. Chicken: A practical and portable Scheme system.

[34]   Ramin Zabih, David McAllester, and David Chapman. Non-deterministic Lisp with dependency-directed backtracking. In AAAI-87, pages 59–64, 1987.