• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Error-checking
        • Apt
        • Abnf
        • Fty-extensions
        • Isar
        • Kestrel-utilities
          • Omaps
          • Directed-untranslate
          • Include-book-paths
          • Ubi
          • Checkpoint-list
          • Digits-any-base
          • Context-message-pair
          • Numbered-names
          • With-auto-termination
          • Theorems-about-true-list-lists
          • Make-termination-theorem
          • Sublis-expr+
          • Prove$
          • Defthm<w
          • System-utilities-non-built-in
          • Integer-range-fix
          • Add-const-to-untranslate-preprocess
          • Integers-from-to
          • Minimize-ruler-extenders
          • Unsigned-byte-fix
          • Signed-byte-fix
          • Defthmr
          • Paired-names
          • Unsigned-byte-list-fix
          • Signed-byte-list-fix
          • Show-books
          • Checkpoint-list-pretty
          • List-utilities
          • Skip-in-book
          • Typed-tuplep
          • Defunt
            • Keyword-value-list-to-alist
            • Magic-macroexpand
            • Top-command-number-fn
            • Bits-as-digits-in-base-2
            • Show-checkpoint-list
            • Ubyte11s-as-digits-in-base-2048
            • Named-formulas
            • Bytes-as-digits-in-base-256
            • String-utilities
            • Make-keyword-value-list-from-keys-and-value
            • Integer-range-listp
            • Defmacroq
            • Apply-fn-if-known
            • Trans-eval-error-triple
            • Checkpoint-info-list
            • Previous-subsumer-hints
            • Fms!-lst
            • Zp-listp
            • Doublets-to-alist
            • Trans-eval-state
            • Injections
            • Theorems-about-osets
            • Typed-list-utilities
            • Book-runes-alist
            • User-interface
            • Bits/ubyte11s-digit-grouping
            • Bits/bytes-digit-grouping
            • Message-utilities
            • Subsetp-eq-linear
            • Strict-merge-sort-<
            • Miscellaneous-enumerations
            • Maybe-unquote
            • Oset-utilities
            • Thm<w
            • Defthmd<w
          • Prime-field-constraint-systems
          • Soft
          • Bv
          • Imp-language
          • Event-macros
          • Bitcoin
          • Ethereum
          • Yul
          • Zcash
          • ACL2-programming-language
          • Prime-fields
          • Java
          • C
          • Syntheto
          • Number-theory
          • Cryptography
          • Lists-light
          • File-io-light
          • Json
          • Built-ins
          • Solidity
          • Axe
          • Std-extensions
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Execloader
        • Axe
      • Testing-utilities
      • Math
    • Kestrel-utilities

    Defunt

    Variant of defun that re-uses existing termination theorems automatically.

    General Form:
    
    (defunt fn (var1 ... varn) doc-string dcl ... dcl body)

    where the arguments are the same as for defun, but without any xargs that specify :measure, :hints, or :well-founded-relation. Those will be inserted automatically into a corresponding defun event, as necessary, by using a database of termination theorems from the community-books.

    To use this utility, first evaluate the following event.

    (include-book "kestrel/auto-termination/defunt-top" :dir :system)

    Examples may be found in the community book, books/kestrel/auto-termination/defunt-tests.lisp. Here is a log showing one such example.

    ACL2 !>(defunt f0 (x y)
             (if (endp x)
                 y
               (list (f0 (cddr x) (cons 23 y)) 100)))
    
    *Defunt note*: Using termination theorem for EVENS.
    
     F0
    ACL2 !>:pe f0
               2:x(DEFUNT F0 (X Y) ...)
                  
    >L             (DEFUN
                    F0 (X Y)
                    (DECLARE
                     (XARGS
                        :MEASURE (ACL2-COUNT X)
                        :HINTS
                        (("Goal" :BY (:FUNCTIONAL-INSTANCE F0-TERMINATION-LEMMA-3
                                                           (TD-STUB-2 F0))))))
                    (IF (ENDP X)
                        Y (LIST (F0 (CDDR X) (CONS 23 Y)) 100)))
    ACL2 !>

    Defunt works by consulting a book that contains a database of information for generating hints based on :termination-theorem lemma-instances. Information about the implementation, which is not necessary for using this utility, may be found (for those who are interested) in community-books file books/kestrel/auto-termination/README.