▼ |  | The Racket Reference

1 | Language Model
2 | Notation for Documentation
3 | Syntactic Forms
4 | Datatypes
5 | Structures
6 | Classes and Objects
7 | Units
8 | Contracts
9 | Pattern Matching
10 | Control Flow
11 | Concurrency and Parallelism
12 | Macros
13 | Input and Output
14 | Reflection and Security
15 | Operating System
16 | Memory Management
17 | Unsafe Operations
18 | Running Racket
| Bibliography
| Index

top ← prev up next →

### Bibliography

[C99] |  | ISO/IEC, “ISO/IEC 9899:1999 Cor. 3:2007(E)).” 2007.
[Culpepper07] |  | Ryan Culpepper, Sam Tobin-Hochstadt, and Matthew Flatt, “Advanced Macrology and the Implementation of Typed Scheme,” Workshop on Scheme and Functional Programming, 2007.
[Danvy90] |  | Olivier Danvy and Andre Filinski, “Abstracting Control,” LISP and Functional Programming, 1990.
[Felleisen88a] |  | Matthias Felleisen, “The theory and practice of first-class prompts,” Principles of Programming Languages, 1988.
[Felleisen88] |  | Matthias Felleisen, Mitch Wand, Dan Friedman, and Bruce Duba, “Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps,” LISP and Functional Programming, 1988.
[Flatt02] |  | Matthew Flatt, “Composable and Compilable Macros: You Want it When?,” International Conference on Functional Programming (ICFP), 2002.
[Friedman95] |  | Daniel P. Friedman, C. T. Haynes, and R. Kent Dybvig, “Exception system proposal,” web page, 1995. http://www.cs.indiana.edu/scheme-repository/doc.proposals.exceptions.html
[Gasbichler02] |  | Martin Gasbichler and Michael Sperber, “Processes vs. User-Level Threads in Scsh,” Workshop on Scheme and Functional Programming, 2002.
[Gunter95] |  | Carl Gunter, Didier Remy, and Jon Rieke, “A Generalization of Exceptions and Control in ML-like Languages,” Functional Programming Languages and Computer Architecture, 1995.
[Haynes84] |  | Christopher T. Haynes and Daniel P. Friedman, “Engines Build Process Abstractions,” Symposium on LISP and Functional Programming, 1984.
[Hayes97] |  | Barry Hayes, “Ephemerons: a New Finalization Mechanism,” Object-Oriented Languages, Programming, Systems, and Applications, 1997.
[Hieb90] |  | Robert Hieb and R. Kent Dybvig, “Continuations and Concurrency,” Principles and Practice of Parallel Programming, 1990.
[L'Ecuyer02] |  | Pierre L’Ecuyer, Richard Simard, E. Jack Chen, and W. David Kelton, “An Object-Oriented Random-Number Package With Many Long Streams and Substreams,” Operations Research, 50(6), 2002.
[Queinnec91] |  | Queinnec and Serpette, “A Dynamic Extent Control Operator for Partial Continuations,” Principles of Programming Languages, 1991.
[Shan04] |  | Ken Shan, “Shift to Control,” Workshop on Scheme and Functional Programming, 2004.
[Sperber07] |  | Michael Sperber, R. Kent Dybvig, Matthew Flatt, and Anton van Straaten (editors), “The Revised6 Report on the Algorithmic Language Scheme.” 2007. http://www.r6rs.org/
[Sitaram90] |  | Dorai Sitaram and Matthias Felleisen, “Control Delimiters and Their Hierarchies,” Lisp and Symbolic Computation, 1990.
[Sitaram93] |  | Dorai Sitaram, “Handling Control,” Programming Language Design and Implementation, 1993.
[SRFI-42] |  | Sebastian Egner, “SRFI-42: Eager Comprehensions,” SRFI, 2003. http://srfi.schemers.org/srfi-42/
[Strickland12] |  | T. Stephen Strickland, Sam Tobin-Hochstadt, Matthew Flatt, and Robert Bruce Findler, “Chaperones and Impersonators: Run-time Support for Reasonable Interposition,” Object-Oriented Programming, Systems, and Languages (OOPSLA), 2012. http://www.eecs.northwestern.edu/~robby/pubs/papers/oopsla2012-stff.pdf

top ← prev up next →