Description: <short summary of the patch>
 TODO: Put a short summary on the line above and replace this paragraph
 with a longer explanation of this change. Complete the meta-information
 with other relevant fields (see below for details). To make it easier, the
 information below has been extracted from the changelog. Adjust it or drop
 it.
 .
 acl2 (8.4dfsg-1) unstable; urgency=medium
 .
   * New upstream release
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-10-13

--- acl2-8.4dfsg.orig/books/kestrel/java/atj/tutorial.lisp
+++ acl2-8.4dfsg/books/kestrel/java/atj/tutorial.lisp
@@ -1196,7 +1196,7 @@
   (atj-tutorial-section "Representation of the ACL2 Function Definitions")
 
   (xdoc::p
-   "AIJ represents ACL2 functions as decribed in @(see atj-tutorial-acl2-terms).
+   "AIJ represents ACL2 functions as described in @(see atj-tutorial-acl2-terms).
     The "
    (xdoc::seetopic "atj-tutorial-simplified-uml"
                    "simplified UML class diagram")
--- acl2-8.4dfsg.orig/books/projects/filesystems/hifat-to-lofat-inversion.lisp
+++ acl2-8.4dfsg/books/projects/filesystems/hifat-to-lofat-inversion.lisp
@@ -9403,7 +9403,7 @@
 ;; our guarantees that the transformation from lofat to hifat is
 ;; reversible. Then, the reasoning will involve the number of clusters
 ;; taken up for the on-disk representation of a lofat instance. That
-;; reasoning will also involve proving that we can allocate upto
+;; reasoning will also involve proving that we can allocate up to
 ;; (count-of-clusters fat32$c) clusters and no more.
 ;; But, this solution is not perfect - there still remains the problem
 ;; of clusters being shared across multiple files. So, if cluster 2
--- 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
@@ -627,13 +627,13 @@
                  (rp-statep
                   (mv-nth 1 (rp-rw term dont-rw context iff-flg hyp-flg limit rp-state state))))
         :flag rp-rw)
-      (defthm rp-rw-rule-retuns-valid-rp-statp
+      (defthm rp-rw-rule-returns-valid-rp-statp
         (implies (rp-statep rp-state)
                  (rp-statep
                   (mv-nth 3 (rp-rw-rule term dont-rw rules-for-term context iff-flg outside-in-flg limit rp-state state))))
         :flag rp-rw-rule)
 
-      (defthm rp-rw-if-retuns-valid-rp-statp
+      (defthm rp-rw-if-returns-valid-rp-statp
         (implies (rp-statep rp-state)
                  (rp-statep
                   (mv-nth 1 (rp-rw-if term dont-rw context iff-flg hyp-flg limit
@@ -692,20 +692,20 @@
                  (valid-rp-state-syntaxp
                   (mv-nth 1 (rp-rw term dont-rw context iff-flg hyp-flg limit rp-state state))))
         :flag rp-rw)
-      (defthm rp-rw-rule-retuns-valid-valid-rp-state-syntaxp
+      (defthm rp-rw-rule-returns-valid-valid-rp-state-syntaxp
         (implies (valid-rp-state-syntaxp rp-state)
                  (valid-rp-state-syntaxp
                   (mv-nth 3 (rp-rw-rule term dont-rw rules-for-term context iff-flg outside-in-flg limit rp-state state))))
         :flag rp-rw-rule)
 
-      (defthm rp-rw-if-retuns-valid-valid-rp-state-syntaxp
+      (defthm rp-rw-if-returns-valid-valid-rp-state-syntaxp
         (implies (valid-rp-state-syntaxp rp-state)
                  (valid-rp-state-syntaxp
                   (mv-nth 1 (rp-rw-if term dont-rw context iff-flg hyp-flg limit
                                       rp-state state))))
         :flag rp-rw-if)
 
-      (defthm rp-rw-subterms-retuns-valid-valid-rp-state-syntaxp
+      (defthm rp-rw-subterms-returns-valid-valid-rp-state-syntaxp
         (implies (valid-rp-state-syntaxp rp-state)
                  (valid-rp-state-syntaxp
                   (mv-nth 1 (rp-rw-subterms subterms dont-rw context hyp-flg limit
@@ -758,14 +758,14 @@
                  (valid-rp-statep
                   (mv-nth 1 (rp-rw term dont-rw context iff-flg hyp-flg limit rp-state state))))
         :flag rp-rw)
-      (defthm rp-rw-rule-retuns-valid-rp-statep
+      (defthm rp-rw-rule-returns-valid-rp-statep
         (implies (and (valid-rp-statep rp-state)
                       (rp-statep rp-state))
                  (valid-rp-statep
                   (mv-nth 3 (rp-rw-rule term dont-rw rules-for-term context iff-flg outside-in-flg limit rp-state state))))
         :flag rp-rw-rule)
 
-      (defthm rp-rw-if-retuns-valid-rp-statep
+      (defthm rp-rw-if-returns-valid-rp-statep
         (implies (and (valid-rp-statep rp-state)
                       (rp-statep rp-state))
                  (valid-rp-statep
@@ -773,7 +773,7 @@
                                       rp-state state))))
         :flag rp-rw-if)
 
-      (defthm rp-rw-subterms-retuns-valid-d-rp-statep
+      (defthm rp-rw-subterms-returns-valid-d-rp-statep
         (implies (and (valid-rp-statep rp-state)
                       (rp-statep rp-state))
                  (valid-rp-statep
--- acl2-8.4dfsg.orig/books/projects/rp-rewriter/rp-rewriter.lisp
+++ acl2-8.4dfsg/books/projects/rp-rewriter/rp-rewriter.lisp
@@ -1300,7 +1300,7 @@ seconds~%"))
                 (cond ((equal action ':error)
                        (hard-error
                         'preprocess-then-rp-rw
-                        "Error! rp-rewriter did not reduce the term to t! To supress this error run:
+                        "Error! rp-rewriter did not reduce the term to t! To suppress this error run:
 (set-not-simplified-action :warning) or (set-not-simplified-action :none)
 Resulting  term is:~% ~p0 ~%"
                         (list (cons #\0 res-))))
--- acl2-8.4dfsg.orig/books/system/doc/acl2-doc.lisp
+++ acl2-8.4dfsg/books/system/doc/acl2-doc.lisp
@@ -20980,7 +20980,7 @@ subtree of X with T, without duplication
   argument justifying the consistency of the proof theory created if and when
   @('fn') is warranted.</p>
 
-  <p>The key to the inductive correctness of the algorithm implicity described
+  <p>The key to the inductive correctness of the algorithm implicitly described
   below is the fact that initially the only function symbol with a slot of ilk
   @(':FN') is @('apply$') and the only function with a slot of ilk @(':EXPR')
   is @('ev$').  In both functions it is the first argument slot that is so
@@ -89506,7 +89506,7 @@ it."
  a single variable when building a context (a so-called @(see type-alist)).
  (By a ``strong compound-recognizer call'' we mean a unary function that
  recognizes a union of primitive ACL2 types and has, either explicitly or
- implicity, a corresponding @(see compound-recognizer) rule; examples include
+ implicitly, a corresponding @(see compound-recognizer) rule; examples include
  @(tsee stringp), @(tsee integerp), and @(tsee true-listp).)  In particular,
  this change can strengthen the result of @(see forward-chaining).  Thanks to
  Eric Smith, who raised this issue by providing an example that we include in a
--- acl2-8.4dfsg.orig/doc.lisp
+++ acl2-8.4dfsg/doc.lisp
@@ -24139,7 +24139,7 @@ How Ilks Are Assigned
   consistency of the proof theory created if and when fn is
   warranted.
 
-  The key to the inductive correctness of the algorithm implicity
+  The key to the inductive correctness of the algorithm implicitly
   described below is the fact that initially the only function symbol
   with a slot of ilk :FN is apply$ and the only function with a slot
   of ilk :EXPR is ev$.  In both functions it is the first argument
@@ -87619,7 +87619,7 @@ Heuristic and Efficiency Improvements
   calls on a single variable when building a context (a so-called
   [type-alist]).  (By a ``strong compound-recognizer call'' we mean a
   unary function that recognizes a union of primitive ACL2 types and
-  has, either explicitly or implicity, a corresponding
+  has, either explicitly or implicitly, a corresponding
   [compound-recognizer] rule; examples include [stringp], [integerp],
   and [true-listp].)  In particular, this change can strengthen the
   result of [forward-chaining].  Thanks to Eric Smith, who raised
