1: @node References, C to Scheme mapping, Library modules - Utilities, Top
    2: @appendix References
    3: @c NODE ???????
    4: 
    5: @table @asis
    6: @anchor{r5rs}
    7: @item [R5RS]
    8: R. Kelsey, W. Clinger, J. Rees (eds.),
    9: Revised^5 Report on the Algorithmic Language Scheme,
   10: Higher-Order and Symbolic Computation, 11(1), September, 1998
   11: and ACM SIGPLAN Notices, 33(9), October, 1998. @*
   12: @url{http://www.schemers.org/Documents/Standards/R5RS/}.
   13: 
   14: @anchor{onecont}
   15: @item [1CC]
   16: Carl Bruggeman, Oscar Waddell and R. Kent Dybvig,
   17: Representing control in the presence of one-shot continuations,
   18: in @i{Proceedings of SIGPLAN '96}, pp. 99--107, 1996.
   19: 
   20: @anchor{meyers86}
   21: @item [Meyers86]
   22: Eugene Myers, 
   23: An O(ND) Difference Algorithm and Its Variations,
   24: @i{Algorithmica} Vol. 1 No. 2, pp. 251-266, 1986.
   25: 
   26: @anchor{mop}
   27: @item [MOP]
   28: Gregor Kiczales, Jim Des Rivieres, Daniel Bobrow,
   29: The Art of Metaobject Protocol, 
   30: The MIT Press.
   31: 
   32: @anchor{dylan}
   33: @item [Dylan]
   34: Kim Barrett, Bob Cassels, Paul Haahr,
   35: David A. Moon, Keith Playford, P. Tucker Withington,
   36: A Monotonic Superclass Linearization for Dylan,
   37: in @i{Proceedings of OOPSLA 96}, October 1996.@*
   38: @url{http://www.webcom.com/~haahr/dylan/linearization-oopsla96.html}.
   39: 
   40: @anchor{fairthreads}
   41: @item [FairThreads]
   42: F. Boussinot, Java Fair Threads, @*
   43: @url{http://www-sop.inria.fr/mimosa/rp/FairThreads/html/FairThreads.html}.
   44: 
   45: @anchor{rfc1321}
   46: @item [RFC1321]
   47: R. Rivest,
   48: The MD5 Message-Digest Algorithm. @*
   49: April 1992. @*
   50: @url{ftp://ftp.isi.edu/in-notes/rfc1321.txt}.
   51: 
   52: @anchor{rfc2045}
   53: @item [RFC2045]
   54: N. Freed, N. Borenstein: Multipurpose Internet Mail Extension
   55: (MIME) Part One: Format of Internet Message Bodies,
   56: November 1996. @*
   57: @url{ftp://ftp.isi.edu/in-notes/rfc2045.txt}.
   58: 
   59: @anchor{rfc2396}
   60: @item [RFC2396]
   61: T. Berners-Lee, R. Fielding, L. Masinter,
   62: Uniform Resource Identifiers (URI): Generic Syntax,
   63: August 1998. @*
   64: @url{ftp://ftp.isi.edu/in-notes/rfc2396.txt}.
   65: 
   66: @anchor{rfc2616}
   67: @item [RFC2616]
   68: R. Fielding et al, Hypertext Transfer Protocol -- HTTP/1.1, June 1999. @*
   69: @url{ftp://ftp.isi.edu/in-notes/rfc2616.txt}.
   70: 
   71: @anchor{rfc2822}
   72: @item [RFC2822]
   73: P. Resnick (ed.), Internet Message Format, April 2001. @*
   74: @url{ftp://ftp.isi.edu/in-notes/rfc2822.txt}.
   75: 
   76: @anchor{rfc2965}
   77: @item [RFC2965]
   78: D. Kristol, L. Montulli, HTTP State Management Mechanism,
   79: October 2000. @*
   80: @url{ftp://ftp.isi.edu/in-notes/rfc2965.txt}.
   81: 
   82: @anchor{rfc3174}
   83: @item [RFC3174]
   84: D. Eastlake, 3rd and P. Jones,
   85: US Secure Hash Algorithm 1 (SHA1). @*
   86: September 2001. @*
   87: @url{ftp://ftp.isi.edu/in-notes/rfc3174.txt}.
   88: 
   89: @anchor{srfi-0}
   90: @item [SRFI-0]
   91: Marc Feeley, Feature-based conditional expansion construct, May  1999.@*
   92: @url{http://srfi.schemers.org/srfi-0/srfi-0.html}.
   93: 
   94: @anchor{srfi-1}
   95: @item [SRFI-1]
   96: Olin Shivers, List Library, October 1999. @*
   97: @url{http://srfi.schemers.org/srfi-1/srfi-1.html}.
   98: 
   99: @anchor{srfi-2}
  100: @item [SRFI-2]
  101: Oleg Kiselyov, @code{AND-LET*}: an @code{AND} with local bindings, a guarded 
  102: @code{LET*} special form, March 1998. @*
  103: @url{http://srfi.schemers.org/srfi-2/srfi-2.html}.
  104: 
  105: @anchor{srfi-4}
  106: @item [SRFI-4]
  107: Marc Feeley, Homogeneous numeric vector types, May 1999.@*
  108: @url{http://srfi.schemers.org/srfi-4/srfi-4.html}.
  109: 
  110: @anchor{srfi-6}
  111: @item [SRFI-6]
  112: William D Clinger, Basic String Ports, July 1999. @*
  113: @url{http://srfi.schemers.org/srfi-6/srfi-6.html}.
  114: 
  115: @anchor{srfi-8}
  116: @item [SRFI-8]
  117: John David Stone, receive: Binding to multiple values, August 1999. @*
  118: @url{http://srfi.schemers.org/srfi-8/srfi-8.html}.
  119: 
  120: @anchor{srfi-9}
  121: @item [SRFI-9]
  122: Richard Kelsey, Defining Record Types, September 1999.@*
  123: @url{http://srfi.schemers.org/srfi-9/srfi-9.html}.
  124: 
  125: @anchor{srfi-10}
  126: @item [SRFI-10]
  127: Oleg Kiselyov, @code{#,} external form, January 2000.@*
  128: @url{http://srfi.schemers.org/srfi-10/srfi-10.html}.
  129: 
  130: @anchor{srfi-11}
  131: @item [SRFI-11]
  132: Lars T Hansen, Syntax for receiving multiple values, March 2000. @*
  133: @url{http://srfi.schemers.org/srfi-11/srfi-11.html}.
  134: 
  135: @anchor{srfi-13}
  136: @item [SRFI-13]
  137: Olin Shivers, String Libraries, December 2000. @*
  138: @url{http://srfi.schemers.org/srfi-13/srfi-13.html}.
  139: 
  140: @anchor{srfi-14}
  141: @item [SRFI-14]
  142: Olin Shivers, Character-set Library, December 2000. @*
  143: @url{http://srfi.schemers.org/srfi-14/srfi-14.html}.
  144: 
  145: @anchor{srfi-17}
  146: @item [SRFI-17]
  147: Per Bothner, Generalized @code{set!}, July 2000. @*
  148: @url{http://srfi.schemers.org/srfi-17/srfi-17.html}.
  149: 
  150: @anchor{srfi-18}
  151: @item [SRFI-18]
  152: Marc Feeley, Multithreading Support, April 2000. @*
  153: @url{http://srfi.schemers.org/srfi-18/srfi-18.html}.
  154: 
  155: @anchor{srfi-19}
  156: @item [SRFI-19]
  157: Will Fitzgerald, Time Data Types and Procedures, August 2000. @*
  158: @url{http://srfi.schemers.org/srfi-19/srfi-19.html}.
  159: 
  160: @anchor{srfi-21}
  161: @item [SRFI-21]
  162: Marc Feeley, Readl-time Multithreading Support, April 2000. @*
  163: @url{http://srfi.schemers.org/srfi-21/srfi-21.html}.
  164: 
  165: @anchor{srfi-22}
  166: @item [SRFI-22]
  167: Martin Gasbichler and Michael Sperber, 
  168: Running Scheme Scripts on Unix, January 2002. @*
  169: @url{http://srfi.schemers.org/srfi-22/srfi-22.html}.
  170: 
  171: @anchor{srfi-23}
  172: @item [SRFI-23]
  173: Stephan Housen, Error reporting mechanism, April 2001.@*
  174: @url{http://srfi.schemers.org/srfi-23/srfi-23.html}.
  175: 
  176: @anchor{srfi-25}
  177: @item [SRFI-25]
  178: Jussi Piitulainen, Multi-dimensional Array Primitives, June 2002.@*
  179: @url{http://srfi.schemers.org/srfi-25/srfi-25.html}.
  180: 
  181: @anchor{srfi-26}
  182: @item [SRFI-26]
  183: Sebastian Egner, Notation for Specializing Parameters without Currying, June 2002.@*
  184: @url{http://srfi.schemers.org/srfi-26/srfi-26.html}.
  185: 
  186: @anchor{srfi-27}
  187: @item [SRFI-27]
  188: Sebastian Egner, Sources of Random Bits, June 2002.@*
  189: @url{http://srfi.schemers.org/srfi-27/srfi-27.html}.
  190: 
  191: @anchor{srfi-28}
  192: @item [SRFI-28]
  193: Scott G. Miller, Basic Format Strings, June 2002.@*
  194: @url{http://srfi.schemers.org/srfi-28/srfi-28.html}.
  195: 
  196: 
  197: @anchor{srfi-37}
  198: @item [SRFI-37]
  199: Anthony Carrico, Args-fold: a program argument processor, Jan. 2003.@*
  200: @url{http://srfi.schemers.org/srfi-37/srfi-37.html}.
  201: 
  202: @anchor{ssax}
  203: @item [SSAX]
  204: Oleg Kiselyov, XML and Scheme, @*
  205: @url{http://pobox.com/~oleg/ftp/Scheme/xml.html}.@*
  206: The SSAX distribution is also available at sourceforge:@*
  207: @url{http://ssax.sourceforge.net/}.
  208: 
  209: @anchor{MT}
  210: @item [MT]
  211: M. Matsumoto and T. Nishimura, "Mersenne Twister: A 623-dimensionally
  212: equidistributed uniform pseudorandom number generator", ACM Trans. on
  213: Modeling and Computer Simulation Vol. 8, No. 1, Januray pp.3-30 1998.@*
  214: @url{http://www.math.keio.ac.jp/~matumoto/emt.html}
  215: 
  216: @anchor{oleg1}
  217: @item [OLEG1]
  218: Oleg Kiselyov, Making sense of an input stream,@*
  219: @url{http://pobox.com/~oleg/ftp/Scheme/parsing.html}.
  220: 
  221: @anchor{oleg2}
  222: @item [OLEG2]
  223: Oleg Kiselyov, General ways to traverse collections,,@*
  224: @url{http://pobox.com/~oleg/ftp/Scheme/enumerators-callcc.html}.
  225: 2000.
  226: @end table