• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
      • Theories
      • Rule-classes
        • Type-prescription
        • Rewrite
        • Meta
        • Linear
          • Force
          • Syntaxp
          • Bind-free
          • Linear-arithmetic
            • Linear-arithmetic-with-complex-coefficients
            • Heavy-linear-p
            • Backchain-limit
            • Non-linear-arithmetic
            • Case-split
            • Linear-arithmetic-with-complex-coefficients
          • Definition
          • Clause-processor
          • Tau-system
          • Forward-chaining
          • Equivalence
          • Congruence
          • Free-variables
          • Executable-counterpart
          • Induction
          • Type-reasoning
          • Compound-recognizer
          • Rewrite-quoted-constant
          • Elim
          • Well-founded-relation-rule
          • Built-in-clause
          • Well-formedness-guarantee
          • Patterned-congruence
          • Rule-classes-introduction
          • Guard-holders
          • Refinement
          • Type-set-inverter
          • Generalize
          • Corollary
          • Induction-heuristics
          • Backchaining
          • Default-backchain-limit
        • Proof-builder
        • Recursion-and-induction
        • Hons-and-memoization
        • Events
        • Parallelism
        • History
        • Programming
        • Operational-semantics
        • Real
        • Start-here
        • Debugging
        • Miscellaneous
        • Output-controls
        • Macros
        • Interfacing-tools
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Linear-arithmetic
    • System-attachments

    Heavy-linear-p

    Extend the use of linear-arithmetic during rewriting

    This topic concerns an advanced control for the ACL2 prover.

    This zero-ary attachable system function supports extending the usual use of linear-arithmetic during rewriting, specifically with the test (first) argument of a call of IF. To get this additional power, possibly at considerable loss of efficiency, evaluate (defattach-system heavy-linear-p constant-t-function-arity-0). To restore the default behavior, evaluate (defattach-system heavy-linear-p constant-nil-function-arity-0).