PLT Scheme -> Racket

collects/mzlib/scribblings/class100.scrbl

@@ -7,7 +7,7 @@
 @mzlib[#:mode title class100]
 
 The @scheme[class100] and @scheme[class100*] forms provide a syntax
-close to that of @scheme[class] and @scheme[class*] in PLT Scheme
+close to that of @scheme[class] and @scheme[class*] in Racket
 versions 100 through 103, but with the semantics of the current
 @schememodname[scheme/class]-based class system. For a class defined
 with @scheme[class100], keyword-based initialization arguments can be

collects/mzlib/scribblings/cml.scrbl

@@ -5,7 +5,7 @@
 @mzlib[#:mode title cml]
 
 The @schememodname[mzlib/cml] library defines a number of procedures
-that wrap PLT Scheme concurrency procedures. The wrapper procedures
+that wrap Racket concurrency procedures. The wrapper procedures
 have names and interfaces that more closely match those of Concurrent
 ML @cite["Reppy99"].
 

collects/mzlib/scribblings/defmacro.scrbl

@@ -56,7 +56,7 @@ original expression supplies the lexical context and source location
 for converted elements.
 
 @bold{Important:} Although @scheme[define-macro] is non-hygienic, it
-is still restricted by PLT Scheme's phase separation rules.  This
+is still restricted by Racket's phase separation rules.  This
 means that a macro cannot access run-time bindings, because it is
 executed in the syntax-expansion phase.  Translating code that
 involves @scheme[define-macro] or @scheme[defmacro] from an

collects/mzlib/scribblings/restart.scrbl

@@ -6,7 +6,7 @@
 @mzlib[#:mode title restart]
 
 @margin-note{See @scheme[scheme/sandbox] for a more general way to
-             simulate running a new PLT Scheme process.}
+             simulate running a new Racket process.}
 
 @defproc[(restart-mzscheme [init-argv (vectorof string?)]
                            [adjust-flag-table (any/c . -> . any/c)]

collects/preprocessor/scribblings/mztext.scrbl

@@ -185,13 +185,13 @@ their arity (preferring a the nullary treatment over the unary one):
        (format "<a href=~s>@tt{~a}</a>" (get-arg) (get-arg)))
     @(define (reftt)
        (format "<a href=~s>~a</a>" (get-arg) (tt)))
-    @ttref{www.racket-lang.org}{PLT Scheme}
-    @reftt{www.racket-lang.org}{PLT Scheme}
+    @ttref{www.racket-lang.org}{Racket}
+    @reftt{www.racket-lang.org}{Racket}
 
   ==>
 
-    <a href="www.racket-lang.org"><tt>PLT Scheme</tt></a>
-    <a href="www.racket-lang.org"><tt>PLT Scheme</tt></a>
+    <a href="www.racket-lang.org"><tt>Racket</tt></a>
+    <a href="www.racket-lang.org"><tt>Racket</tt></a>
 }|
 
   Note that in @scheme[reftt] we use @scheme[tt] without arguments since it will
@@ -204,11 +204,11 @@ their arity (preferring a the nullary treatment over the unary one):
     @defcommand{tt}{X}{<tt>X</tt>}
     @defcommand{ref}{url text}{<a href="url">text</a>}
     @defcommand{ttref}{url text}{<a href="url">@tt{text}</a>}
-    @ttref{www.racket-lang.org}{PLT Scheme}
+    @ttref{www.racket-lang.org}{Racket}
 
   ==>
 
-    <a href="www.racket-lang.org"><tt>PLT Scheme</tt></a>
+    <a href="www.racket-lang.org"><tt>Racket</tt></a>
 }|}
 
   @item{A procedure of arity 1 is invoked differently---it is applied on a

collects/unstable/scribblings/define.scrbl

@@ -47,8 +47,8 @@ do nothing if the name(s) is(are) already bound.  The
 @scheme[define-values-if-unbound] and @scheme[define-syntaxes-if-unbound] forms
 raise a syntax error if some of the given names are bound and some are not.
 
-These are useful for writing programs that are portable across versions of PLT
-Scheme with different bindings, to provide an implementation of a binding for
+These are useful for writing programs that are portable across versions of
+Racket with different bindings, to provide an implementation of a binding for
 versions that do not have it but use the built-in one in versions that do.
 
 @defexamples[
@@ -84,7 +84,7 @@ redirecting it to the corresponding @scheme[old] identifier.
 
 This form provides forward declarations of identifiers to be defined later.  It
 is useful for macros which expand to mutually recursive definitions, including
-forward references, that may be used at the PLT Scheme top level.
+forward references, that may be used at the Racket top level.
 
 }
 

collects/unstable/scribblings/hash.scrbl

@@ -85,7 +85,7 @@ Reports whether @scheme[h] maps keys according to @scheme[equal?].
 @defproc[(hash-has-key? [h hash?] [k any/c]) boolean?]{
 
 Reports whether @scheme[h] has an entry for @scheme[k].  This function is
-re-exported from @schememodname[scheme/base].  In versions of PLT Scheme before
+re-exported from @schememodname[scheme/base].  In versions of Racket before
 @scheme[hash-has-key?] was implemented, this module provides its own definition.
 
 @defexamples[