delete extra paren

book.tex

@@ -909,7 +909,7 @@ defined in Figure~\ref{fig:r0-concrete-syntax}.
 \newcommand{\LintGrammarRacket}{
   \begin{array}{rcl}
     \Type &::=& \key{Integer} \\
-    \Exp{} &::=& \Int{} \MID \CREAD \RP \MID \CNEG{\Exp} \MID \CADD{\Exp}{\Exp}
+    \Exp{} &::=& \Int{} \MID \CREAD \MID \CNEG{\Exp} \MID \CADD{\Exp}{\Exp}
       \MID \CSUB{\Exp}{\Exp}
   \end{array}
 }
@@ -19900,7 +19900,7 @@ polymorphism, which we describe below.
 \item[Uniform representation] generates one version of each
   polymorphic function but requires all values to have a common
   ``boxed'' format, such as the tagged values of type \code{Any} in
-  \LangAny{}. Both polymorphic and non-polymorphic (i.e. monomorhic)
+  \LangAny{}. Both polymorphic and non-polymorphic (i.e. monomorphic)
   code is compiled similarly to code in a dynamically typed language
   (like \LangDyn{}), in which primitive operators require their
   arguments to be projected from \code{Any} and their results are
@@ -19921,7 +19921,7 @@ polymorphism, which we describe below.
   and polymorphic (e.g. when a polymorphic function is instantiated
   and called). This approach is compatible with separate compilation
   and first-class polymorphism and maintains efficiency in monomorphic
-  code. The tradeoff is increased overhead at the boundary between
+  code. The trade off is increased overhead at the boundary between
   monomorphic and polymorphic code.  This approach is used in
   implementations of ML~\citep{Leroy:1992qb} and Java, starting in
   Java 5 with the addition of autoboxing.
@@ -20497,7 +20497,17 @@ registers.
 % LocalWords:  ProgramDefs TailCall tailjmp IndirectCallq TailJmp rT
 % LocalWords:  prepending addstart addconclusion Cardelli Llambda typ
 % LocalWords:  Llambda InterpLlambda AnnAssign Dunfield bodyT str fvs
-% LocalWords:  TypeCheckLlambda annot dereference clos fvts closTy
+% LocalWords:  TypeCheckLlambda annot dereference clos fvts closTy tg
 % LocalWords:  Minamide AllocateClosure Gilray Milner morphos subtype
-% LocalWords:  polymorphism untyped AnyType dataclass untag Ldyn
-% LocalWords:  lookup
+% LocalWords:  polymorphism untyped AnyType dataclass untag Ldyn conc
+% LocalWords:  lookup InterpLdyn elif tagof Lany TypeCheckLany tv orq
+% LocalWords:  AnnLambda InterpLany ClosureTuple ValueOf TagOf imulq
+% LocalWords:  untagged multi Tobin Hochstadt zr mn Gronski kd ret Tp
+% LocalWords:  Tif src tgt Lcast wr contravariant PVector un Lgradual
+% LocalWords:  Lgradualp Llambdapp Llambdaproxy Wadler qv quicksort
+% LocalWords:  Henglein nz coercions Grift parametetric parameterized
+% LocalWords:  parameterizing stroustrup subst tys targs decls defs
+% LocalWords:  pts ats prt pxs axs Decl Monomorphization NESL CLU qb
+% LocalWords:  monomorphization Blelloch monomorphic Bracha unboxed
+% LocalWords:  instantiation Lpoly Lpolyp typechecker mcons ebp jge
+% LocalWords:  notq setle setg setge