▼ |  | 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. https://www2.ccs.neu.edu/racket/pubs/scheme2007-ctf.pdf
[Danvy90] |  | Olivier Danvy and Andre Filinski, “Abstracting Control,” LISP and Functional Programming, 1990. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.6.960&rep=rep1&type=pdf
[Felleisen88a] |  | Matthias Felleisen, “The theory and practice of first-class prompts,” Principles of Programming Languages, 1988. https://www.cs.tufts.edu/~nr/cs257/archive/matthias-felleisen/prompts.pdf
[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. https://help.luddy.indiana.edu/techreports/TRNNN.cgi?trnum=TR248
[Feltey18] |  | Daniel Feltey, Ben Greenman, Christophe Scholliers, Robert Bruce Findler, and Vincent St-Amour, “Collapsible Contracts: Fixing a Pathology of Gradual Typing,” Object-Oriented Programming, Systems, and Languages (OOPSLA), 2018. https://www.ccis.northeastern.edu/~types/publications/collapsible/fgsfs-oopsla-2018.pdf
[Flatt02] |  | Matthew Flatt, “Composable and Compilable Macros: You Want it When?,” International Conference on Functional Programming (ICFP), 2002. http://www.cs.utah.edu/plt/publications/gpce13-f-color.pdf
[Friedman95] |  | Daniel P. Friedman, C. T. Haynes, and R. Kent Dybvig, “Exception system proposal,” web page, 1995. https://web.archive.org/web/20161012054505/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. http://www.ccs.neu.edu/home/shivers/papers/scheme02/article/threads.pdf
[Greenberg15] |  | Michael Greenberg, “Space-Efficient Manifest Contracts,” Principles of Programming Languages (POPL), 2015. https://cs.pomona.edu/~michael/papers/popl2015_space.pdf
[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. http://gallium.inria.fr/~remy/ftp/prompt.pdf
[Haynes84] |  | Christopher T. Haynes and Daniel P. Friedman, “Engines Build Process Abstractions,” Symposium on LISP and Functional Programming, 1984. https://legacy.cs.indiana.edu/ftp/techreports/TR159.pdf
[Hayes97] |  | Barry Hayes, “Ephemerons: a New Finalization Mechanism,” Object-Oriented Languages, Programming, Systems, and Applications, 1997. https://static.aminer.org/pdf/PDF/000/522/273/ephemerons_a_new_finalization_mechanism.pdf
[Hieb90] |  | Robert Hieb and R. Kent Dybvig, “Continuations and Concurrency,” Principles and Practice of Parallel Programming, 1990. https://legacy.cs.indiana.edu/ftp/techreports/TR256.pdf
[Lamport79] |  | Leslie Lamport, “How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs,” IEEE Transactions on Computers, 179. https://www.microsoft.com/en-us/research/uploads/prod/2016/12/How-to-Make-a-Multiprocessor-Computer-That-Correctly-Executes-Multiprocess-Programs.pdf
[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. https://www.iro.umontreal.ca/~lecuyer/myftp/papers/streams00.pdf
[Queinnec91] |  | Queinnec and Serpette, “A Dynamic Extent Control Operator for Partial Continuations,” Principles of Programming Languages, 1991. https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.40.9946&rep=rep1&type=pdf
[Reppy99] |  | John H. Reppy, Concurrent Programming in ML, Cambridge University Press, 1999. https://doi.org/10.1017/CBO9780511574962
[Roux14] |  | Pierre Roux, “Innocuous Double Rounding of Basic Arithmetic Operations,” Journal of Formalized Reasoning, 7(1), 2014.
[Sapin18] |  | Simon Sapin, “The WTF-8 Encoding.” 2018. http://simonsapin.github.io/wtf-8/
[Shan04] |  | Ken Shan, “Shift to Control,” Workshop on Scheme and Functional Programming, 2004. http://homes.sice.indiana.edu/ccshan/recur/recur.pdf
[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. https://www2.ccs.neu.edu/racket/pubs/lasc1990-sf.pdf
[Sitaram93] |  | Dorai Sitaram, “Handling Control,” Programming Language Design and Implementation, 1993. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.7256
[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 →