• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
      • Theories
      • Rule-classes
      • Proof-builder
      • Hons-and-memoization
      • Events
      • History
      • Parallelism
      • Programming
        • Defun
        • Declare
        • System-utilities
        • Stobj
        • State
        • Memoize
        • Mbe
        • Io
        • Defpkg
        • Apply$
        • Mutual-recursion
        • Loop$
        • Programming-with-state
        • Arrays
        • Characters
        • Time$
        • Loop$-primer
        • Fast-alists
        • Defmacro
        • Defconst
        • Evaluation
        • Guard
        • Equality-variants
        • Compilation
        • Hons
          • Normed
          • Hons-note
          • Hons-resize
          • Hons-wash
          • Hons-clear
          • Hons-copy
          • Maybe-wash-memory
          • Hons-equal
          • Hons-summary
          • Hons-equal-lite
            • Hons-sublis
            • Hons-wash!
            • Hons-clear!
            • Hons-copy-persistent
          • ACL2-built-ins
          • Developers-guide
          • System-attachments
          • Advanced-features
          • Set-check-invariant-risk
          • Numbers
          • Irrelevant-formals
          • Efficiency
          • Introduction-to-programming-in-ACL2-for-those-who-know-lisp
          • Redefining-programs
          • Lists
          • Invariant-risk
          • Errors
          • Defabbrev
          • Conses
          • Alists
          • Set-register-invariant-risk
          • Strings
          • Program-wrapper
          • Get-internal-time
          • Basics
          • Packages
          • Defmacro-untouchable
          • Primitive
          • <<
          • Revert-world
          • Set-duplicate-keys-action
          • Unmemoize
          • Symbols
          • Def-list-constructor
          • Easy-simplify-term
          • Defiteration
          • Defopen
          • Sleep
        • Start-here
        • Real
        • Debugging
        • Miscellaneous
        • Output-controls
        • Macros
        • Interfacing-tools
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Testing-utilities
      • Math
    • Hons
    • Hons-equal

    Hons-equal-lite

    (hons-equal-lite x y) is a non-recursive equality check that optimizes if its arguments are normed.

    In the logic, hons-equal-lite is just equal; we leave it enabled and would think it odd to ever prove a theorem about it.

    Under the hood, hons-equal-lite checks whether its arguments are normed, and if so it effectively becomes a eql check. Otherwise, it immediately calls equal to determine if its arguments are equal.

    The idea here is to strike a useful balance between equal and hons-equal. If both arguments happen to be normed, we get to use a very fast equality comparison. Otherwise, we just get out of the way and let equal do its work, without the extra overhead of recursively checking whether the subtrees of x and y are normed.

    Function: hons-equal-lite

    (defun hons-equal-lite (x y)
           (declare (xargs :guard t))
           (equal x y))