• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Apt
        • Error-checking
        • Fty-extensions
        • Isar
        • Kestrel-utilities
        • Set
        • Soft
        • C
        • Bv
        • Imp-language
        • Event-macros
        • Java
        • Bitcoin
        • Ethereum
        • Yul
        • Zcash
        • ACL2-programming-language
        • Prime-fields
        • Json
        • Syntheto
          • Process-syntheto-toplevel-fn
          • Translation
          • Language
            • Static-semantics
            • Abstract-syntax
              • Expression
              • Expression-sum-field-list
              • Type
              • Binary-op
                • Binary-op-fix
                • Binary-op-case
                  • Binary-opp
                  • Binary-op-equiv
                  • Binary-op-kind
                  • Binary-op-sub
                  • Binary-op-rem
                  • Binary-op-or
                  • Binary-op-ne
                  • Binary-op-mul
                  • Binary-op-lt
                  • Binary-op-le
                  • Binary-op-implies
                  • Binary-op-implied
                  • Binary-op-iff
                  • Binary-op-gt
                  • Binary-op-ge
                  • Binary-op-eq
                  • Binary-op-div
                  • Binary-op-and
                  • Binary-op-add
                • Expression-product-field-list
                • Abstract-syntax-operations
                • Function-definition-list->header-list
                • Type-definition-list->name-list
                • Initializer-list->value-list
                • Function-header-list->name-list
                • Typed-variable-list->type-list
                • Typed-variable-list->name-list
                • Branch-list->condition-list
                • Alternative-list->name-list
                • Function-specifier
                • Expression-variable-list
                • Type-subset
                • Field-list->type-list
                • Field-list->name-list
                • Function-specification
                • Identifier
                • Toplevel
                • Function-definer
                • Function-header
                • Type-definer
                • Literal
                • Type-product
                • Function-definition
                • Type-sum
                • Maybe-expression
                • Transform-argument-value
                • Transform
                • Theorem
                • Quantifier
                • Maybe-function-specification
                • Maybe-typed-variable
                • Maybe-type-definition
                • Maybe-function-header
                • Maybe-function-definition
                • Maybe-type-sum
                • Maybe-type-subset
                • Maybe-type-product
                • Maybe-type-definer
                • Maybe-theorem
                • Maybe-type
                • Initializer
                • Type-definition
                • Alternative
                • Unary-op
                • Typed-variable
                • Branch
                • Field
                • Transform-argument
                • Type-recursion
                • Program
                • Function-recursion
                • Typed-variable-list
                • Toplevel-name
                • Toplevel-list
                • Initializer-list
                • Expression-fixtypes
                • Toplevel-fn-names
                • Lookup-transform-argument
                • Function-definition-names
                • Type-definition-list
                • Transform-argument-list
                • Function-header-list
                • Function-definition-list
                • Alternative-list
                • Type-list
                • Identifier-set
                • Identifier-list
                • Field-list
                • Expression-list
                • Branch-list
                • Extract-default-param-alist
                • Create-arg-defaults-table
              • Outcome
              • Abstract-syntax-operations
              • Outcome-list
              • Outcomes
            • Process-syntheto-toplevel
            • Shallow-embedding
          • File-io-light
          • Cryptography
          • Number-theory
          • Lists-light
          • Axe
          • Builtins
          • Solidity
          • Helpers
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Axe
        • Execloader
      • Math
      • Testing-utilities
    • Binary-op

    Binary-op-case

    Case macro for the different kinds of binary-op structures.

    This is an ACL2::fty sum-type case macro, typically introduced by fty::defflexsum or fty::deftagsum. It allows you to safely check the type of a binary-op structure, or to split into cases based on its type.

    Short Form

    In its short form, binary-op-case allows you to safely check the type of a binary-op structure. For example:

    (binary-op-case x :eq)

    is essentially just a safer alternative to writing:

    (equal (binary-op-kind x) :eq)

    Why is using binary-op-case safer? When we directly inspect the kind with equal, there is no static checking being done to ensure that, e.g., :eq is a valid kind of binary-op structure. That means there is nothing to save you if, later, you change the kind keyword for this type from :eq to something else. It also means you get no help if you just make a typo when writing the :eq symbol. Over the course of developing VL, we found that such issues were very frequent sources of errors!

    Long Form

    In its longer form, binary-op-case allows you to split into cases based on the kind of structure you are looking at. A typical example would be:

    (binary-op-case x
      :eq ...
      :ne ...
      :gt ...
      :ge ...
      :lt ...
      :le ...
      :and ...
      :or ...
      :implies ...
      :implied ...
      :iff ...
      :add ...
      :sub ...
      :mul ...
      :div ...
      :rem ...)

    It is also possible to consolidate ``uninteresting'' cases using :otherwise.

    For convenience, the case macro automatically binds the fields of x for you, as appropriate for each case. That is, in the :eq case, you can use fty::defprod-style foo.bar style accessors for x without having to explicitly add a eq b* binder.