• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
        • Proof-support
        • Abstract-syntax
          • Syntax-abstraction
          • Expression
            • Expression-fix
            • Expression-case
            • Expressionp
            • Expression-count
              • Expression-equiv
              • Expression-mul
              • Expression-add
              • Expression-var
              • Expression-const
              • Expression-kind
            • Definition
            • Constraint
            • Definition-option
            • Abstract-syntax-operations
            • System
            • Convenience-constructors
            • System-result
            • Expression-result
            • Expression-list-result
            • Definition-result
            • Definition-list-result
            • Constraint-result
            • Constraint-list-result
            • Expression-list
            • Definition-list
            • Constraint-list
          • R1cs-subset
          • Semantics
          • Abstract-syntax-operations
          • Indexed-names
          • Well-formedness
          • Concrete-syntax
          • R1cs-bridge
          • Parser-interface
        • Legacy-defrstobj
        • Proof-checker-array
        • Soft
        • C
        • Farray
        • Rp-rewriter
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Leftist-trees
        • Java
        • Taspi
        • Bitcoin
        • Riscv
        • Des
        • Ethereum
        • X86isa
        • Sha-2
        • Yul
        • Zcash
        • Proof-checker-itp13
        • Regex
        • ACL2-programming-language
        • Json
        • Jfkr
        • Equational
        • Cryptography
        • Poseidon
        • Where-do-i-place-my-book
        • Axe
        • Bigmems
        • Builtins
        • Execloader
        • Aleo
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Expression

    Expression-count

    Measure for recurring over expression structures.

    Signature
    (expression-count x) → count
    Arguments
    x — Guard (expressionp x).
    Returns
    count — Type (natp count).

    Definitions and Theorems

    Function: expression-count

    (defun expression-count (x)
      (declare (xargs :guard (expressionp x)))
      (let ((__function__ 'expression-count))
        (declare (ignorable __function__))
        (case (expression-kind x)
          (:const 1)
          (:var 1)
          (:add (+ 3
                   (expression-count (expression-add->arg1 x))
                   (expression-count (expression-add->arg2 x))))
          (:mul (+ 3
                   (expression-count (expression-mul->arg1 x))
                   (expression-count (expression-mul->arg2 x)))))))

    Theorem: natp-of-expression-count

    (defthm natp-of-expression-count
      (b* ((count (expression-count x)))
        (natp count))
      :rule-classes :type-prescription)

    Theorem: expression-count-of-expression-fix-x

    (defthm expression-count-of-expression-fix-x
      (equal (expression-count (expression-fix x))
             (expression-count x)))

    Theorem: expression-count-expression-equiv-congruence-on-x

    (defthm expression-count-expression-equiv-congruence-on-x
      (implies (expression-equiv x x-equiv)
               (equal (expression-count x)
                      (expression-count x-equiv)))
      :rule-classes :congruence)

    Theorem: expression-count-of-expression-add

    (defthm expression-count-of-expression-add
      (implies t
               (< (+ (expression-count arg1)
                     (expression-count arg2))
                  (expression-count (expression-add arg1 arg2))))
      :rule-classes :linear)

    Theorem: expression-count-of-expression-add->arg1

    (defthm expression-count-of-expression-add->arg1
      (implies (equal (expression-kind x) :add)
               (< (expression-count (expression-add->arg1 x))
                  (expression-count x)))
      :rule-classes :linear)

    Theorem: expression-count-of-expression-add->arg2

    (defthm expression-count-of-expression-add->arg2
      (implies (equal (expression-kind x) :add)
               (< (expression-count (expression-add->arg2 x))
                  (expression-count x)))
      :rule-classes :linear)

    Theorem: expression-count-of-expression-mul

    (defthm expression-count-of-expression-mul
      (implies t
               (< (+ (expression-count arg1)
                     (expression-count arg2))
                  (expression-count (expression-mul arg1 arg2))))
      :rule-classes :linear)

    Theorem: expression-count-of-expression-mul->arg1

    (defthm expression-count-of-expression-mul->arg1
      (implies (equal (expression-kind x) :mul)
               (< (expression-count (expression-mul->arg1 x))
                  (expression-count x)))
      :rule-classes :linear)

    Theorem: expression-count-of-expression-mul->arg2

    (defthm expression-count-of-expression-mul->arg2
      (implies (equal (expression-kind x) :mul)
               (< (expression-count (expression-mul->arg2 x))
                  (expression-count x)))
      :rule-classes :linear)