• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
      • Std/lists
      • Std/alists
      • Obags
      • Std/util
      • Std/strings
      • Std/osets
      • Std/io
      • Std/basic
      • Std/system
        • Fresh-logical-name-with-$s-suffix
        • Irrelevant-formals-info
        • Std/system/function-queries
          • Defun-sk-queries
          • Tail-recursive-p
          • Termination-theorem$
          • Unwrapped-nonexec-body+
          • Measure
            • Termination-theorem-example
            • Measure-debug
            • Make-termination-theorem
            • Termination-theorem
              • Make-termination-theorem
              • ACL2-pc::prove-termination
            • Tthm
          • Arity+
          • Ubody
          • Ruler-extenders+
          • Recursive-calls
          • Guard-theorem-no-simplify$
          • Well-founded-relation+
          • Unwrapped-nonexec-body
          • Measured-subset+
          • Ruler-extenders
          • Measure+
          • Number-of-results+
          • Induction-machine+
          • Non-executablep+
          • Pure-raw-p
          • Irecursivep+
          • Formals+
          • Stobjs-out+
          • Definedp+
          • Number-of-results
          • Induction-machine
          • Ubody+
          • Guard-theorem-no-simplify
          • Uguard
          • Rawp
          • Defchoose-queries
          • Uguard+
          • Stobjs-in+
          • No-stobjs-p+
          • Irecursivep
          • Well-founded-relation
          • Definedp
          • Guard-verified-p+
          • Primitivep+
          • No-stobjs-p
          • Measured-subset
          • Guard-verified-p
          • Primitivep
          • Non-executablep
          • Fundef-disabledp
          • Ibody
          • Fundef-enabledp
          • Std/system/arity
        • Std/system/term-queries
        • Std/system/term-transformations
        • Std/system/enhanced-utilities
        • Install-not-normalized-event
        • Install-not-normalized-event-lst
        • Std/system/term-function-recognizers
        • Genvar$
        • Std/system/event-name-queries
        • Pseudo-tests-and-call-listp
        • Maybe-pseudo-event-formp
        • Add-suffix-to-fn-or-const
        • Chk-irrelevant-formals-ok
        • Table-alist+
        • Pseudo-tests-and-callp
        • Add-suffix-to-fn-or-const-lst
        • Known-packages+
        • Add-suffix-to-fn-lst
        • Unquote-term
        • Event-landmark-names
        • Add-suffix-lst
        • Std/system/theorem-queries
        • Unquote-term-list
        • Std/system/macro-queries
        • Pseudo-command-landmark-listp
        • Install-not-normalized$
        • Pseudo-event-landmark-listp
        • Known-packages
        • Std/system/partition-rest-and-keyword-args
        • Rune-enabledp
        • Rune-disabledp
        • Included-books
        • Std/system/pseudo-event-formp
        • Std/system/plist-worldp-with-formals
        • Std/system/w
        • Std/system/geprops
        • Std/system/arglistp
        • Std/system/constant-queries
      • Std/typed-lists
      • Std/bitsets
      • Std/testing
      • Std/typed-alists
      • Std/stobjs
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Math
    • Testing-utilities
  • Lemma-instance
  • Measure
  • Hints

Termination-theorem

Use a (functional instance of a) previously-proved measure theorem

See lemma-instance for a discussion of :termination-theorem and :termination-theorem! lemma instances, and see tthm for a related user-level query utility. Also see termination-theorem-example for simple examples of the use of measure (termination) theorems in hints. For a related utility, see make-termination-theorem.

Subtopics

Make-termination-theorem
Create a copy of a function's termination theorem that calls stubs.
ACL2-pc::prove-termination
(macro) Prove termination efficiently by using a previous termination theorem.