scheme48.info-3 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247
  1. This is scheme48.info, produced by makeinfo version 6.7 from
  2. scheme48.texi.
  3. This manual is for Scheme48 version 1.3.
  4. Copyright (C) 2004, 2005, 2006 Taylor Campbell. All rights reserved.
  5. This manual includes material derived from works bearing the
  6. following notice:
  7. Copyright (C) 1993-2005 Richard Kelsey, Jonathan Rees, and Mike
  8. Sperber. All rights reserved.
  9. Redistribution and use in source and binary forms, with or without
  10. modification, are permitted provided that the following conditions
  11. are met:
  12. * Redistributions of source code must retain the above copyright
  13. notice, this list of conditions and the following disclaimer.
  14. * Redistributions in binary form must reproduce the above
  15. copyright notice, this list of conditions and the following
  16. disclaimer in the documentation and/or other materials
  17. provided with the distribution.
  18. * The name of the authors may not be used to endorse or promote
  19. products derived from this software without specific prior
  20. written permission.
  21. THIS SOFTWARE IS PROVIDED BY THE AUTHORS "AS IS" AND ANY EXPRESS OR
  22. IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  23. WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  24. DISCLAIMED. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT,
  25. INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  26. (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  27. SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28. HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  29. STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
  30. ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  31. POSSIBILITY OF SUCH DAMAGE.
  32. INFO-DIR-SECTION The Algorithmic Language Scheme
  33. START-INFO-DIR-ENTRY
  34. * Scheme48: (scheme48). Nearly complete reference manual for version 1.3
  35. END-INFO-DIR-ENTRY
  36. 
  37. File: scheme48.info, Node: Structure index, Prev: Binding index, Up: Top
  38. Structure index
  39. ***************
  40. [index]
  41. * Menu:
  42. * architecture: Miscellaneous I/O internals.
  43. (line 6)
  44. * arrays: Library data structures.
  45. (line 11)
  46. * ascii: ASCII character encoding.
  47. (line 6)
  48. * big-util: Library utilities. (line 109)
  49. * bitwise: Bitwise manipulation.
  50. (line 13)
  51. * byte-vectors: Bitwise manipulation.
  52. (line 36)
  53. * cells: Cells. (line 6)
  54. * channel-i/o: Channels. (line 108)
  55. * channel-ports: Channel ports. (line 6)
  56. * channels: Channels. (line 15)
  57. * code-quote: Miscellaneous features.
  58. (line 90)
  59. * conditions: Condition system. (line 6)
  60. * condvars: Higher-level synchronization.
  61. (line 12)
  62. * debug-messages: Miscellaneous features.
  63. (line 57)
  64. * define-record-types: Records. (line 10)
  65. * define-sync-record-types: Optimistic concurrency.
  66. (line 143)
  67. * defrecord: Records. (line 10)
  68. * destructuring: Library utilities. (line 12)
  69. * dump/restore: Library utilities. (line 257)
  70. * dynamic-externals: C interface. (line 49)
  71. * dynamic-externals <1>: Dynamic loading of C modules.
  72. (line 69)
  73. * enum-case: Integer enumerations.
  74. (line 43)
  75. * enum-sets: Enumerated/finite types and sets.
  76. (line 9)
  77. * enumerated: Integer enumerations.
  78. (line 6)
  79. * exceptions: Condition system. (line 6)
  80. * extended-ports: I/O extensions. (line 6)
  81. * external-calls: C interface. (line 49)
  82. * external-calls <1>: Calling C functions from Scheme.
  83. (line 6)
  84. * features: Miscellaneous features.
  85. (line 6)
  86. * filenames: Filenames. (line 6)
  87. * finite-types: Enumerated/finite types and sets.
  88. (line 9)
  89. * fluids: Fluid/dynamic bindings.
  90. (line 6)
  91. * formats: Common-Lisp-style formatting.
  92. (line 6)
  93. * handle: Condition system. (line 125)
  94. * i/o: Ports. (line 18)
  95. * i/o-internal: Ports. (line 108)
  96. * i/o-internal <1>: Port handlers. (line 6)
  97. * i/o-internal <2>: Buffered ports & handlers.
  98. (line 6)
  99. * i/o-internal <3>: Miscellaneous I/O internals.
  100. (line 6)
  101. * list-interfaces: Using the module system.
  102. (line 126)
  103. * load-dynamic-externals: C interface. (line 49)
  104. * load-dynamic-externals <1>: Dynamic loading of C modules.
  105. (line 6)
  106. * locks: Pessimistic concurrency.
  107. (line 17)
  108. * loopholes: Type annotations. (line 6)
  109. * mask-types: Boxed bitwise-integer masks.
  110. (line 6)
  111. * masks: Boxed bitwise-integer masks.
  112. (line 6)
  113. * meta-methods: Generic dispatch system.
  114. (line 6)
  115. * methods: Generic dispatch system.
  116. (line 6)
  117. * methods <1>: Writer. (line 58)
  118. * mvlet: Library utilities. (line 228)
  119. * nondeterminism: Library utilities. (line 83)
  120. * placeholders: Higher-level synchronization.
  121. (line 64)
  122. * ports: Port data type. (line 6)
  123. * posix: POSIX interface. (line 37)
  124. * posix-files: POSIX interface. (line 22)
  125. * posix-files <1>: POSIX file system access.
  126. (line 6)
  127. * posix-i/o: POSIX interface. (line 25)
  128. * posix-i/o <1>: POSIX I/O utilities. (line 6)
  129. * posix-platform-names: POSIX host OS and machine identification.
  130. (line 6)
  131. * posix-process-data: POSIX interface. (line 19)
  132. * posix-process-data <1>: POSIX process environment.
  133. (line 6)
  134. * posix-processes: POSIX interface. (line 16)
  135. * posix-processes <1>: POSIX processes. (line 6)
  136. * posix-regexps: POSIX interface. (line 34)
  137. * posix-regexps <1>: POSIX regular expressions.
  138. (line 17)
  139. * posix-signals: POSIX signals. (line 6)
  140. * posix-time: POSIX interface. (line 28)
  141. * posix-users: POSIX interface. (line 31)
  142. * posix-users <1>: POSIX users and groups.
  143. (line 6)
  144. * pp: Library utilities. (line 29)
  145. * prescheme: Module system architecture.
  146. (line 40)
  147. * prescheme <1>: Standard Pre-Scheme environment.
  148. (line 6)
  149. * prescheme <2>: Running Pre-Scheme as Scheme.
  150. (line 6)
  151. * prescheme-compiler: Invoking the Pre-Scheme compiler.
  152. (line 40)
  153. * proposals: Optimistic concurrency.
  154. (line 34)
  155. * ps-flonums: Pre-Scheme floating point operation.
  156. (line 6)
  157. * ps-flonums <1>: Running Pre-Scheme as Scheme.
  158. (line 6)
  159. * ps-memory: Low-level Pre-Scheme memory manipulation.
  160. (line 6)
  161. * ps-memory <1>: Running Pre-Scheme as Scheme.
  162. (line 6)
  163. * ps-receive: Multiple return values in Pre-Scheme.
  164. (line 6)
  165. * ps-receive <1>: Running Pre-Scheme as Scheme.
  166. (line 6)
  167. * ps-record-types: Pre-Scheme record types.
  168. (line 6)
  169. * ps-record-types <1>: Running Pre-Scheme as Scheme.
  170. (line 6)
  171. * queues: Queues. (line 6)
  172. * reading: Reader. (line 6)
  173. * receiving: Library utilities. (line 213)
  174. * record-types: Records. (line 134)
  175. * records: Records. (line 216)
  176. * records-internal: Records. (line 186)
  177. * reduce: Macros for writing loops.
  178. (line 9)
  179. * regexp: POSIX regular expressions.
  180. (line 76)
  181. * rendezvous: Rendezvous base combinators.
  182. (line 6)
  183. * rendezvous-async-channels: Rendezvous communication channels.
  184. (line 46)
  185. * rendezvous-channels: Rendezvous communication channels.
  186. (line 9)
  187. * rendezvous-jars: Rendezvous-synchronized cells.
  188. (line 39)
  189. * rendezvous-placeholders: Rendezvous-synchronized cells.
  190. (line 9)
  191. * rendezvous-time: Rendezvous base combinators.
  192. (line 59)
  193. * scheme: Module system architecture.
  194. (line 40)
  195. * search-trees: Library data structures.
  196. (line 54)
  197. * shared-bindings: C interface. (line 49)
  198. * shared-bindings <1>: Shared bindings between Scheme and C.
  199. (line 6)
  200. * silly: Miscellaneous features.
  201. (line 46)
  202. * simple-conditions: Condition system. (line 166)
  203. * simple-signals: Condition system. (line 65)
  204. * sockets: TCP & UDP sockets. (line 6)
  205. * sockets <1>: TCP & UDP sockets. (line 27)
  206. * sparse-vectors: Library data structures.
  207. (line 103)
  208. * spatial: Resource statistics and control.
  209. (line 60)
  210. * srfi-7: SRFI 7. (line 6)
  211. * srfi-9: Records. (line 10)
  212. * strong: Library utilities. (line 64)
  213. * structure-refs: Module configuration language.
  214. (line 23)
  215. * tables: Hash tables. (line 6)
  216. * threads: Basic thread operations.
  217. (line 6)
  218. * threads-internal: Custom thread synchronization.
  219. (line 6)
  220. * time: Library utilities. (line 283)
  221. * traverse: Resource statistics and control.
  222. (line 83)
  223. * udp-sockets: TCP & UDP sockets. (line 6)
  224. * udp-sockets <1>: TCP & UDP sockets. (line 47)
  225. * usual-resumer: Suspending and resuming heap images.
  226. (line 41)
  227. * util: Various utilities. (line 6)
  228. * weak: Weak references. (line 6)
  229. * write-images: Suspending and resuming heap images.
  230. (line 23)
  231. * writing: Writer. (line 6)