2.28.8 References

• [1] E. Weisstein: Totally Ordered Set, Mathworld at Wolfram Research. TotallyOrderedSet.html
• [2] E. Weisstein: Equivalence Relation, Mathworld at Wolfram Research. mathworld.wolfram.com/EquivalenceRelation.html
• [3] R. Kelsey, W. Clinger, J. Rees (eds.): Revised5 Report on the Algorithmic Language Scheme, Higher-Order and Symbolic Computation, Vol. 11, No. 1, August, 1998.
  www.schemers.org/Documents/Standards/R5RS/
• [4] Y. Matsumoto: Programming Ruby. The Pragmatic Programmer’s Guide.
  www.ruby-doc.org/docs/ProgrammingRuby/
• [5] G. van Rossum, F. L. Drake, Jr., (ed.): Python Library Reference. Release 2.4 of 30 November 2004. Section 2.1 “built-in functions”. Python Software Foundation.
  http://docs.python.org/lib/lib.html
• [6] S. Peyton Jones (ed.): Haskell 98 Language and Libraries The Revised Report, December 2002.
  http://www.haskell.org/definition/
• [7] ANSI-C ISO/IEC 9899:1999, published 1 December.
  http://www.open-std.org/jtc1/sc22/wg14/www/standards
• [8] J. A. Soegaard: Data Structures Galore for PLT Scheme.
  http://planet.plt-scheme.org:80/207.1/docs/soegaard/galore.plt/1/1/doc.txt
• [9] L. T. Hansen: SRFI-16 Syntax for procedures of variable arity.
  http://srfi.schemers.org/srfi-16/
• [10] R. Kelsey: SRFI-9 Defining record types.
  http://srfi.schemers.org/srfi-9/
• [11] S. Houben: SRFI-23 Error reporting mechanism.
  http://srfi.schemers.org/srfi-23/
• [12] S. Egner: SRFI-27 Sources of random bits.
  http://srfi.schemers.org/srfi-27/
• [13] O. Shivers: SRFI-32 Sort libraries. Section “Ordering, comparison functions & stability” and mail-archive msg000{23,24,33}.html. SRFI has been withdrawn July 17, 2003.
  http://srfi.schemers.org/srfi-32/
• [14] S. Egner: SRFI-42 Eager comprehensions.
  http://srfi.schemers.org/srfi-42/
• [15] PLT Scheme.
  http://www.plt-scheme.org/
• [16] R. Kelsey, J. Rees: Scheme48, version 1.1.
  http://s48.org/
• [17] Chicken, version 1.70.
  www.call-with-current-continuation.org.