Description: spelling_corrections
Forwarded: not-needed
 Miscellaneous spelling corrections.
Author: Camm Maguire <camm@debian.org>

---
The information above should follow the Patch Tagging Guidelines, please
checkout http://dep.debian.net/deps/dep3/ to learn about the format. Here
are templates for supplementary fields that you might want to add:

Origin: <vendor|upstream|other>, <url of original patch>
Bug: <url in upstream bugtracker>
Bug-Debian: https://bugs.debian.org/<bugnumber>
Bug-Ubuntu: https://launchpad.net/bugs/<bugnumber>
Forwarded: <no|not-needed|url proving that it has been forwarded>
Reviewed-By: <name and email of someone who approved the patch>
Last-Update: 2021-02-02

Index: acl2-8.4dfsg/axioms.lisp
===================================================================
--- acl2-8.4dfsg.orig/axioms.lisp
+++ acl2-8.4dfsg/axioms.lisp
@@ -29188,7 +29188,7 @@ Lisp definition."
 ; where we want to avoid compilation because of the use of make-event, and we
 ; also want to avoid evaluation during pass 1 of initialization, because we are
 ; waiting for a suitable function-theory.  We cannot simply define when-logic
-; to be nil in raw Lisp, becase its use is not limited to the definition of
+; to be nil in raw Lisp, because its use is not limited to the definition of
 ; local.
 
   #-acl2-loop-only
Index: acl2-8.4dfsg/books/centaur/memoize/old/watch-raw.lsp
===================================================================
--- acl2-8.4dfsg.orig/books/centaur/memoize/old/watch-raw.lsp
+++ acl2-8.4dfsg/books/centaur/memoize/old/watch-raw.lsp
@@ -22,7 +22,7 @@
 
 (defmacro defn1 (f a &rest r)
   (when (intersection a lambda-list-keywords)
-    (error "DEFN1: ** In the defintion of ~s, the argument list ~s ~
+    (error "DEFN1: ** In the definition of ~s, the argument list ~s ~
             contains a member of lambda-list-keywords so do not ~
             use defn1."
            f a))
Index: acl2-8.4dfsg/books/centaur/sv/vl/vl-svstmt.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/centaur/sv/vl/vl-svstmt.lisp
+++ acl2-8.4dfsg/books/centaur/sv/vl/vl-svstmt.lisp
@@ -1149,7 +1149,7 @@ because... (BOZO)</p>
                                        x)))))
           (mv ok
               (warn :type :vl-delay-ignored
-                    :msg "Ignoring delay control on statment ~a0"
+                    :msg "Ignoring delay control on statement ~a0"
                     :args (list x))
               substmts))
 
Index: acl2-8.4dfsg/books/centaur/vl/server/public/lib/jquery-2.1.0.js
===================================================================
--- acl2-8.4dfsg.orig/books/centaur/vl/server/public/lib/jquery-2.1.0.js
+++ acl2-8.4dfsg/books/centaur/vl/server/public/lib/jquery-2.1.0.js
@@ -1071,7 +1071,7 @@ setDocument = Sizzle.setDocument = funct
 
 	// Support: IE<10
 	// Check if getElementById returns elements by name
-	// The broken getElementById methods don't pick up programatically-set names,
+	// The broken getElementById methods don't pick up programmatically-set names,
 	// so use a roundabout getElementsByName test
 	support.getById = assert(function( div ) {
 		docElem.appendChild( div ).id = expando;
Index: acl2-8.4dfsg/books/centaur/vl2014/server/public/lib/jquery-2.1.0.js
===================================================================
--- acl2-8.4dfsg.orig/books/centaur/vl2014/server/public/lib/jquery-2.1.0.js
+++ acl2-8.4dfsg/books/centaur/vl2014/server/public/lib/jquery-2.1.0.js
@@ -1071,7 +1071,7 @@ setDocument = Sizzle.setDocument = funct
 
 	// Support: IE<10
 	// Check if getElementById returns elements by name
-	// The broken getElementById methods don't pick up programatically-set names,
+	// The broken getElementById methods don't pick up programmatically-set names,
 	// so use a roundabout getElementsByName test
 	support.getById = assert(function( div ) {
 		docElem.appendChild( div ).id = expando;
Index: acl2-8.4dfsg/books/coi/termination/assuming/compiler.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/coi/termination/assuming/compiler.lisp
+++ acl2-8.4dfsg/books/coi/termination/assuming/compiler.lisp
@@ -167,7 +167,7 @@
   (syn::or-fn args))
 
 ;; Here we define the function that actually rips apart the body of a
-;; function defintion and creates candidates for the stubbed out foo
+;; function definition and creates candidates for the stubbed out foo
 ;; functions.
 
 (defun lambda-bod (expr)
Index: acl2-8.4dfsg/books/interface/infix/infix.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/interface/infix/infix.lisp
+++ acl2-8.4dfsg/books/interface/infix/infix.lisp
@@ -275,7 +275,7 @@ Below is such a call with keywords suppl
 -
 -   :mode       - if not provided (thus defaulting to nil) we look for
 -                 "fl-theory.lisp" and load it if present.  If not, we use
--                 the mode of the last successfull call to infix-file or
+-                 the mode of the last successful call to infix-file or
 -                 query whether you want to use Scribe or Latex mode.
 -                 In this last case you will need to know where the basic
 -                 theory files are located.  Simplest is to create a trivial
@@ -3795,7 +3795,7 @@ In which case we don't want to print *no
   (pprinc " recursively.")
   (no-tab-command-trailer))
 
-(define-command-printer q "Quiting ACL2.")
+(define-command-printer q "Quitting ACL2.")
 (define-command-printer redef "Allow redefinition without undoing.")
 (define-command-printer redef!
  "!!! ACL2 system hacker's redefinition command:
Index: acl2-8.4dfsg/books/kestrel/alists-light/lookup-eq.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/kestrel/alists-light/lookup-eq.lisp
+++ acl2-8.4dfsg/books/kestrel/alists-light/lookup-eq.lisp
@@ -13,7 +13,7 @@
 
 ;; STATUS: In-progress
 
-(include-book "lookup-equal") ;; included becase we rewrite lookup-eq to lookup-eqal
+(include-book "lookup-equal") ;; included because we rewrite lookup-eq to lookup-eqal
 
 ;; Look up KEY in ALIST, using eq as the test.
 (defund lookup-eq (key alist)
Index: acl2-8.4dfsg/books/kestrel/alists-light/lookup.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/kestrel/alists-light/lookup.lisp
+++ acl2-8.4dfsg/books/kestrel/alists-light/lookup.lisp
@@ -13,7 +13,7 @@
 
 ;; STATUS: In-progress
 
-(include-book "lookup-equal") ;; included becase we rewrite lookup to lookup-eqal
+(include-book "lookup-equal") ;; included because we rewrite lookup to lookup-eqal
 
 ;; Look up KEY in ALIST, using eql as the test (like assoc).
 (defund lookup (key alist)
Index: acl2-8.4dfsg/books/kestrel/ethereum/addresses.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/kestrel/ethereum/addresses.lisp
+++ acl2-8.4dfsg/books/kestrel/ethereum/addresses.lisp
@@ -76,6 +76,6 @@
   (xdoc::topstring
    (xdoc::p
     "We calculate the public key from the private key,
-     and then use @(tsee public-key-to-address) to calculate the addres."))
+     and then use @(tsee public-key-to-address) to calculate the address."))
   (public-key-to-address (secp256k1-priv-to-pub priv-key))
   :hooks (:fix))
Index: acl2-8.4dfsg/books/projects/avr-isa/avr8_isa.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/projects/avr-isa/avr8_isa.lisp
+++ acl2-8.4dfsg/books/projects/avr-isa/avr8_isa.lisp
@@ -59,7 +59,7 @@
 ;; each flag is 1 for true and 0 for false
 ;; regs is a list of 32 registers
 ;; each register is an integer (assumed to be 8-bits, but unbounded for now.)
-;; memory is an alist (addr val) representing the memory. Every addres is an integer. 
+;; memory is an alist (addr val) representing the memory. Every address is an integer. 
 ;; We currently do not distinguish between data and program space or between I/, RAM, etc.
   (list pc regs flags stack program memory))
 
Index: acl2-8.4dfsg/books/projects/rp-rewriter/proofs/rp-rw-lemmas.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/projects/rp-rewriter/proofs/rp-rw-lemmas.lisp
+++ acl2-8.4dfsg/books/projects/rp-rewriter/proofs/rp-rw-lemmas.lisp
@@ -640,7 +640,7 @@
                                       rp-state state))))
         :flag rp-rw-if)
 
-      (defthm rp-rw-subterms-retuns-valid-rp-statp
+      (defthm rp-rw-subterms-returns-valid-rp-statp
         (implies (rp-statep rp-state)
                  (rp-statep
                   (mv-nth 1 (rp-rw-subterms subterms dont-rw context hyp-flg limit
Index: acl2-8.4dfsg/books/projects/sidekick/public/lib/jquery-2.1.0.js
===================================================================
--- acl2-8.4dfsg.orig/books/projects/sidekick/public/lib/jquery-2.1.0.js
+++ acl2-8.4dfsg/books/projects/sidekick/public/lib/jquery-2.1.0.js
@@ -1071,7 +1071,7 @@ setDocument = Sizzle.setDocument = funct
 
 	// Support: IE<10
 	// Check if getElementById returns elements by name
-	// The broken getElementById methods don't pick up programatically-set names,
+	// The broken getElementById methods don't pick up programmatically-set names,
 	// so use a roundabout getElementsByName test
 	support.getById = assert(function( div ) {
 		docElem.appendChild( div ).id = expando;
Index: acl2-8.4dfsg/books/projects/x86isa/utils/paging-structures.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/projects/x86isa/utils/paging-structures.lisp
+++ acl2-8.4dfsg/books/projects/x86isa/utils/paging-structures.lisp
@@ -148,7 +148,7 @@
    (res1 bitp)    ;; Ignored
    (ps bitp)      ;; Page size (Must be 0)
    (res2 4bits)  ;; Ignored
-   (pd 40bits)   ;; Physical addres of 4-K aligned PD referenced by this entry
+   (pd 40bits)   ;; Physical address of 4-K aligned PD referenced by this entry
    (res3 11bits) ;; Ignored and/or Reserved
    (xd bitp))     ;; If IA32_EFER.NXE = 1, Execute disable;
   ;; otherwise 0 (reserved)
@@ -175,7 +175,7 @@
    (res1 3bits)  ;; Ignored
    (pat bitp)     ;; PAT
    (res2 8bits)  ;; Reserved
-   (page 31bits) ;; Physical addres of the 2MB page referenced by this entry
+   (page 31bits) ;; Physical address of the 2MB page referenced by this entry
    (res3 11bits) ;; Ignored and/or Reserved
    (xd bitp) ;; If IA32_EFER.NXE = 1, Execute disable; otherwise 0 (reserved)
    )
@@ -198,7 +198,7 @@
    (res1 bitp)    ;; Ignored
    (ps bitp)       ;; Page size (Must be 0)
    (res2 4bits)  ;; Ignored
-   (pt 40bits)    ;; Physical addres of the 4K-aligned
+   (pt 40bits)    ;; Physical address of the 4K-aligned
    ;; page table referenced by this entry
    (res3 11bits) ;; Ignored and/or Reserved
    (xd bitp)       ;; If IA32_EFER.NXE = 1, Execute
Index: acl2-8.4dfsg/books/quicklisp/bundle/software/trivial-gray-streams-20181018-git/test/test-framework.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/quicklisp/bundle/software/trivial-gray-streams-20181018-git/test/test-framework.lisp
+++ acl2-8.4dfsg/books/quicklisp/bundle/software/trivial-gray-streams-20181018-git/test/test-framework.lisp
@@ -56,5 +56,5 @@
 (defmacro test ((name) &body body)
   "If the BODY signals a SERIOUS-CONDITION
 this macro returns a failed TEST-RESULT; otherwise
-returns a successfull TEST-RESULT."
+returns a successful TEST-RESULT."
   `(test-impl (quote ,name) (lambda () ,@body)))
Index: acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel11/rel9-rtl-pkg/lib/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/rtl.lisp
@@ -393,7 +393,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel11/rel9-rtl-pkg/support/lib1/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/rtl.lisp
@@ -393,7 +393,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl-new-proofs.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl-new-proofs.lisp
+++ acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl-new-proofs.lisp
@@ -490,7 +490,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits_alt x
 i j) when x is negative.  However, bits_alt behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl-new.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl-new.lisp
+++ acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl-new.lisp
@@ -400,7 +400,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits_alt x
 i j) when x is negative.  However, bits_alt behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl-proofs.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl-proofs.lisp
+++ acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl-proofs.lisp
@@ -539,7 +539,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2.delta1/rtl.lisp
@@ -393,7 +393,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel11/rel9-rtl-pkg/support/lib2/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/rtl.lisp
@@ -393,7 +393,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel11/rel9-rtl-pkg/support/lib3/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/rtl.lisp
@@ -393,7 +393,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel11/rel9-rtl-pkg/support/support/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rtl.lisp
@@ -341,7 +341,7 @@ Most of the functions introduced are dis
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel4/lib/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel4/lib/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel4/lib/rtl.lisp
@@ -346,7 +346,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel4/support/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel4/support/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel4/support/rtl.lisp
@@ -324,7 +324,7 @@ Most of the functions introduced are dis
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel9/lib/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel9/lib/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel9/lib/rtl.lisp
@@ -393,7 +393,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel9/support/lib1/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel9/support/lib1/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel9/support/lib1/rtl.lisp
@@ -393,7 +393,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel9/support/lib2.delta1/rtl-new-proofs.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel9/support/lib2.delta1/rtl-new-proofs.lisp
+++ acl2-8.4dfsg/books/rtl/rel9/support/lib2.delta1/rtl-new-proofs.lisp
@@ -490,7 +490,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits_alt x
 i j) when x is negative.  However, bits_alt behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel9/support/lib2.delta1/rtl-new.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel9/support/lib2.delta1/rtl-new.lisp
+++ acl2-8.4dfsg/books/rtl/rel9/support/lib2.delta1/rtl-new.lisp
@@ -400,7 +400,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits_alt x
 i j) when x is negative.  However, bits_alt behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel9/support/lib2.delta1/rtl-proofs.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel9/support/lib2.delta1/rtl-proofs.lisp
+++ acl2-8.4dfsg/books/rtl/rel9/support/lib2.delta1/rtl-proofs.lisp
@@ -539,7 +539,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel9/support/lib2.delta1/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel9/support/lib2.delta1/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel9/support/lib2.delta1/rtl.lisp
@@ -393,7 +393,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel9/support/lib2/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel9/support/lib2/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel9/support/lib2/rtl.lisp
@@ -393,7 +393,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel9/support/lib3/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel9/support/lib3/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel9/support/lib3/rtl.lisp
@@ -393,7 +393,7 @@
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/rtl/rel9/support/support/rtl.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/rtl/rel9/support/support/rtl.lisp
+++ acl2-8.4dfsg/books/rtl/rel9/support/support/rtl.lisp
@@ -336,7 +336,7 @@ Most of the functions introduced are dis
 #|
 Note: We recently changed mod-.  This definition is a little weird, since it may rely on the value of (bits x
 i j) when x is negative.  However, bits behaves properly in this case.  In fact, Eric proved this theorem
-about the old defintion of mod-:
+about the old definition of mod-:
 
 (thm
  (implies (and (bvecp x n)
Index: acl2-8.4dfsg/books/system/doc/acl2-doc.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/system/doc/acl2-doc.lisp
+++ acl2-8.4dfsg/books/system/doc/acl2-doc.lisp
@@ -5688,7 +5688,7 @@ and @(tsee include-book)"
   function for the function it analyzed.  Warrants are crucial to stating and
   proving theorems about function symbols being applied with @('apply$').  We
   illustrated warrants in the ``Examples'' section above and discuss them
-  further in the secion on ``Theorems Involving @('Apply$')'' below.  See also
+  further in the section on ``Theorems Involving @('Apply$')'' below.  See also
   @(tsee warrant).</p>
 
   <p>@('Apply$') is a defined function in the ACL2 source code.  We exhibit its
@@ -20365,7 +20365,7 @@ subtree of X with T, without duplication
 
  <p>(Of interest only to users of @(tsee apply$).)  Special handling is applied
  when attempting to attach to a so-called <i>warrant</i>, which is produced by
- an appication of @(tsee defwarrant) (or @(tsee defun$)).  In that case it is
+ an application of @(tsee defwarrant) (or @(tsee defun$)).  In that case it is
  legal to attach the function @('true-apply$-warrant') to the warrant, without
  any proof obligation.  This attachment is actually performed automatically by
  @('defwarrant'), so users (even users of @('apply$')) need not deal
@@ -21805,7 +21805,7 @@ subtree of X with T, without duplication
   event of failure to admit it, and trying to expand the class of
   @('loop$')-recursive functions that can be successfully handled.  We have not
   yet even looked at inductions for @('ON') @('loop$')s and @('FROM/TO/BY')
-  @('loop$')s, so that might be easy.  Induction for @('loop$')s over arbtrary
+  @('loop$')s, so that might be easy.  Induction for @('loop$')s over arbitrary
   target expressions may be infeasible!  We just need more examples of
   @('loop$')-recursive functions and successful (hand-written) induction hints
   for them.</p>")
@@ -45780,7 +45780,7 @@ tables in the current Hons Space."
   @('fn').</p>
 
   <p>By the way, both @('collect$') and @('always$') are pre-defined in
-  ACL2 because they are part of the support for the @(tsee loop$) statment.</p>
+  ACL2 because they are part of the support for the @(tsee loop$) statement.</p>
 
   <p><b>Lesson 6:</b> You can run scions on warranted function symbols:</p>
 
@@ -54868,7 +54868,7 @@ forms allowed for a @('let') form are  @
   @('loop$') bodies.  (We also generate conjectures for the recursive calls the
   other @('loop$')-expression components, e.g., the @('when') clause, exactly
   analogously, but we speak of the @('loop$') body only below.  We also focus
-  on simple @('loop$')s here but the conjectures decribed generalize to fancy
+  on simple @('loop$')s here but the conjectures described generalize to fancy
   @('loop$')s.)  Given a recursive call inside the body of a @('loop$') with
   iteration variable <i>v</i>, we first generate a new variable symbol,
   <i>v'</i>.  Certain terms, e.g., tests and arguments to recursive calls, will
@@ -102975,7 +102975,7 @@ arithmetic) for libraries of @(see books
  returned @(tsee state) is the same as the world of the input state even if the
  evaluation of @('form') modifies the world of the input state.</p>
 
- <p>To see @('revert-world') in action, consider the following defintion.</p>
+ <p>To see @('revert-world') in action, consider the following definition.</p>
 
  @({
  (defun test-revert-world (state)
@@ -114244,7 +114244,7 @@ arithmetic) for libraries of @(see books
  see @(see set-inhibit-output-lst) &mdash; or if you prefer, you may inhibit
  just specified component of the summary &mdash; see @(see
  set-inhibited-summary-types).  The components are listed in the constant
- @('*summary-types*') and most are available programatically: see @(see
+ @('*summary-types*') and most are available programmatically: see @(see
  get-event-data).  Some are omitted, however, if they would otherwise be empty.
  Here is a brief summary of the components, listed alphabetically.  Most are
  printed with an initial field indicator, e.g., ``@('Rules: ')''; a few, as
@@ -127582,7 +127582,7 @@ introduction-to-the-tau-system) for more
  @('(verify-guards name)') to be successful.  If the guards of some @('LAMBDA')
  object requires hints to prove, the hints may be supplied to
  @('verify-guards') as you would for any other failing guard obligation in
- @('name').  When successfull, the @('LAMBDA') objects thus verified are added,
+ @('name').  When successful, the @('LAMBDA') objects thus verified are added,
  behind the scenes, to the compiled lambda cache (see @(tsee print-cl-cache))
  to speed up @('apply$') in the evaluation theory.</p>
 
Index: acl2-8.4dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc1.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc1.lisp
+++ acl2-8.4dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc1.lisp
@@ -82,7 +82,7 @@
 (in-theory (disable statementp))
 
 ;;---------------
-;; index-of-name gets the index of a label statment so that
+;; index-of-name gets the index of a label statement so that
 ;; we can set the program counter when we execute goto, call, and
 ;; branch statements.
 
Index: acl2-8.4dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase1.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/workshops/2000/sumners1/cdeq/cdeq-phase1.lisp
+++ acl2-8.4dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase1.lisp
@@ -131,7 +131,7 @@
 
 #|----------------------------------------------------------------------------|#
 
-;;;; BEGIN invariant defintion ;;;;
+;;;; BEGIN invariant definition ;;;;
 
 (DEFUN inv (st) (declare (ignore st)) t)
 
Index: acl2-8.4dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase2.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/workshops/2000/sumners1/cdeq/cdeq-phase2.lisp
+++ acl2-8.4dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase2.lisp
@@ -313,7 +313,7 @@
 
 #|----------------------------------------------------------------------------|#
 
-;;;; BEGIN invariant defintion ;;;;
+;;;; BEGIN invariant definition ;;;;
 
 ;; a few more macros for predicates for defining the
 ;; current "state" of the deque.
Index: acl2-8.4dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase3.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/workshops/2000/sumners1/cdeq/cdeq-phase3.lisp
+++ acl2-8.4dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase3.lisp
@@ -135,7 +135,7 @@
 
 #|----------------------------------------------------------------------------|#
 
-;;;; BEGIN invariant defintion ;;;;
+;;;; BEGIN invariant definition ;;;;
 
 (DEFUN inv (st) (declare (ignore st)) t)
 
Index: acl2-8.4dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase4.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/workshops/2000/sumners1/cdeq/cdeq-phase4.lisp
+++ acl2-8.4dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase4.lisp
@@ -343,7 +343,7 @@
 
 #|----------------------------------------------------------------------------|#
 
-;;;; BEGIN invariant defintion ;;;;
+;;;; BEGIN invariant definition ;;;;
 
 (defthm get-top-nil-implies-atom
   (implies (not (get-top x)) (not (consp x))))
Index: acl2-8.4dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/workshops/2011/verbeek-schmaltz/sources/perm.lisp
+++ acl2-8.4dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.lisp
@@ -3,7 +3,7 @@
 
 (in-package "ACL2")
 
-;; The following book contains the defintion of del.
+;; The following book contains the definition of del.
 ;; We load this book, to prevent mutliple defintions,
 ;; of the same function.
 (include-book "meta/term-defuns" :dir :system)
Index: acl2-8.4dfsg/books/workshops/2013/van-gastel-schmaltz/books/perm.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/workshops/2013/van-gastel-schmaltz/books/perm.lisp
+++ acl2-8.4dfsg/books/workshops/2013/van-gastel-schmaltz/books/perm.lisp
@@ -3,7 +3,7 @@
 
 (in-package "ACL2")
 
-;; The following book contains the defintion of del.
+;; The following book contains the definition of del.
 ;; We load this book, to prevent mutliple defintions,
 ;; of the same function.
 (include-book "meta/term-defuns" :dir :system)
Index: acl2-8.4dfsg/books/workshops/2017/sumners/support/bakery.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/workshops/2017/sumners/support/bakery.lisp
+++ acl2-8.4dfsg/books/workshops/2017/sumners/support/bakery.lisp
@@ -59,7 +59,7 @@ conditions sufficient to prove the remai
 
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;;; bakery specification defintion
+;;;; bakery specification definition
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
 (in-theory (enable o-p o<))
@@ -132,7 +132,7 @@ conditions sufficient to prove the remai
 
 (def-tr-system-defs bake-spec)
 
-;;;; bakery implementation defintion
+;;;; bakery implementation definition
 
 (defun lex< (p q r s)
   (or (< p r) (and (equal p r) (< q s))))
Index: acl2-8.4dfsg/books/workshops/2020/sumners/bakery.lisp
===================================================================
--- acl2-8.4dfsg.orig/books/workshops/2020/sumners/bakery.lisp
+++ acl2-8.4dfsg/books/workshops/2020/sumners/bakery.lisp
@@ -11,7 +11,7 @@
 (include-book "centaur/gl/shape-spec" :dir :system)
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;;; bakery specification defintion
+;;;; bakery specification definition
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
 (defmacro make-signed-byte-type (name size)
Index: acl2-8.4dfsg/books/xdoc/fancy/lib/jquery-2.1.0.js
===================================================================
--- acl2-8.4dfsg.orig/books/xdoc/fancy/lib/jquery-2.1.0.js
+++ acl2-8.4dfsg/books/xdoc/fancy/lib/jquery-2.1.0.js
@@ -1071,7 +1071,7 @@ setDocument = Sizzle.setDocument = funct
 
 	// Support: IE<10
 	// Check if getElementById returns elements by name
-	// The broken getElementById methods don't pick up programatically-set names,
+	// The broken getElementById methods don't pick up programmatically-set names,
 	// so use a roundabout getElementsByName test
 	support.getById = assert(function( div ) {
 		docElem.appendChild( div ).id = expando;
Index: acl2-8.4dfsg/defuns.lisp
===================================================================
--- acl2-8.4dfsg.orig/defuns.lisp
+++ acl2-8.4dfsg/defuns.lisp
@@ -9791,7 +9791,7 @@
                    your counterfeit version:  the loop$ expression~%~Y01 ~
                    actually translates to~%~Y21, which when converted to ~
                    runnable raw Lisp is~%~Y31, but your counterfeit claimed the ~
-                   runnable raw Lisp of its tranlation is~%~Y41."
+                   runnable raw Lisp of its translation is~%~Y41."
                   key
                   nil
                   tkey
Index: acl2-8.4dfsg/doc.lisp
===================================================================
--- acl2-8.4dfsg.orig/doc.lisp
+++ acl2-8.4dfsg/doc.lisp
@@ -8267,7 +8267,7 @@ Specification of APPLY$
   the function it analyzed.  Warrants are crucial to stating and
   proving theorems about function symbols being applied with apply$.
   We illustrated warrants in the ``Examples'' section above and
-  discuss them further in the secion on ``Theorems Involving Apply$''
+  discuss them further in the section on ``Theorems Involving Apply$''
   below.  See also [warrant].
 
   Apply$ is a defined function in the ACL2 source code.  We exhibit its
@@ -23522,7 +23522,7 @@ Miscellaneous Remarks, with discussion o
 
   (Of interest only to users of [apply$].)  Special handling is applied
   when attempting to attach to a so-called warrant, which is produced
-  by an appication of [defwarrant] (or [defun$]).  In that case it is
+  by an application of [defwarrant] (or [defun$]).  In that case it is
   legal to attach the function true-apply$-warrant to the warrant,
   without any proof obligation.  This attachment is actually
   performed automatically by defwarrant, so users (even users of
@@ -24927,7 +24927,7 @@ Restrictions
   class of loop$-recursive functions that can be successfully
   handled.  We have not yet even looked at inductions for ON loop$s
   and FROM/TO/BY loop$s, so that might be easy.  Induction for loop$s
-  over arbtrary target expressions may be infeasible!  We just need
+  over arbitrary target expressions may be infeasible!  We just need
   more examples of loop$-recursive functions and successful
   (hand-written) induction hints for them.")
  (DEFINE-PC-HELP
@@ -49406,7 +49406,7 @@ Subtopics
   It checks that every element of lst satisfies its :FN argument fn.
 
   By the way, both collect$ and always$ are pre-defined in ACL2 because
-  they are part of the support for the [loop$] statment.
+  they are part of the support for the [loop$] statement.
 
   Lesson 6: You can run scions on warranted function symbols:
 
@@ -58944,7 +58944,7 @@ Measure Conjectures
   loop$ bodies.  (We also generate conjectures for the recursive
   calls the other loop$-expression components, e.g., the when clause,
   exactly analogously, but we speak of the loop$ body only below.  We
-  also focus on simple loop$s here but the conjectures decribed
+  also focus on simple loop$s here but the conjectures described
   generalize to fancy loop$s.)  Given a recursive call inside the
   body of a loop$ with iteration variable v, we first generate a new
   variable symbol, v'.  Certain terms, e.g., tests and arguments to
@@ -103907,7 +103907,7 @@ Subtopics
   returned [state] is the same as the world of the input state even
   if the evaluation of form modifies the world of the input state.
 
-  To see revert-world in action, consider the following defintion.
+  To see revert-world in action, consider the following definition.
 
     (defun test-revert-world (state)
      (declare (xargs :mode :program :stobjs state))
@@ -115312,7 +115312,7 @@ Subtopics
   avoided --- see [set-inhibit-output-lst] --- or if you prefer, you
   may inhibit just specified component of the summary --- see
   [set-inhibited-summary-types].  The components are listed in the
-  constant *summary-types* and most are available programatically:
+  constant *summary-types* and most are available programmatically:
   see [get-event-data].  Some are omitted, however, if they would
   otherwise be empty.  Here is a brief summary of the components,
   listed alphabetically.  Most are printed with an initial field
@@ -128397,7 +128397,7 @@ Remarks
   for name and all must be proved for (verify-guards name) to be
   successful.  If the guards of some LAMBDA object requires hints to
   prove, the hints may be supplied to verify-guards as you would for
-  any other failing guard obligation in name.  When successfull, the
+  any other failing guard obligation in name.  When successful, the
   LAMBDA objects thus verified are added, behind the scenes, to the
   compiled lambda cache (see [print-cl-cache]) to speed up apply$ in
   the evaluation theory.
Index: acl2-8.4dfsg/other-events.lisp
===================================================================
--- acl2-8.4dfsg.orig/other-events.lisp
+++ acl2-8.4dfsg/other-events.lisp
@@ -32042,7 +32042,7 @@
 ; 'macros-with-raw-code, but that also seems the right thing to do.
 
 ; Thus, this function is essentially (eval form), except that instead of
-; returning the value(s) from that evaluation, it retuns a new state where the
+; returning the value(s) from that evaluation, it returns a new state where the
 ; xxx-with-raw-code state globals are extended, according to the definitions of
 ; ACL2 macros and functions that have changed when form is evaluated.
 
