• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
      • Legacy-defrstobj
      • Proof-checker-array
      • Soft
      • C
      • Farray
      • Rp-rewriter
      • Instant-runoff-voting
      • Imp-language
      • Sidekick
      • Leftist-trees
      • Java
      • Riscv
      • Taspi
      • Bitcoin
      • 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
      • Aleo
        • Aleobft
        • Aleovm
        • Leo
          • Grammar
          • Early-version
            • Json2ast
            • Testing
            • Definition
              • Flattening
              • Abstract-syntax
                • Expression
                • Syntax-abstraction
                • Statement
                • Files
                • Input-files
                • Identifiers
                • Types
                • Struct-init
                • Branch
                • Statements
                • Format-strings
                • Input-syntax-abstraction
                • Expressions
                  • Binop
                  • Unop
                    • Unop-case
                      • Unop-fix
                      • Unopp
                      • Unop-equiv
                      • Unop-not
                      • Unop-kind
                      • Unop-square-root
                      • Unop-square
                      • Unop-neg
                      • Unop-inv
                      • Unop-double
                      • Unop-abs-wrapped
                      • Unop-abs
                    • Expression-option
                    • Struct-init-list-result
                    • Expression-option-result
                    • Unop-result
                    • Struct-init-result
                    • Expression-result
                    • Expression-list-result
                    • Binop-result
                    • Expression-fixtypes
                  • Output-files
                  • Addresses
                  • Literals
                  • Characters
                  • Expression-list
                  • Statement-list
                  • Output-syntax-abstraction
                  • Struct-init-list
                  • Branch-list
                  • Annotations
                  • Abstract-syntax-trees
                  • Symbols
                  • Keywords
                  • Programs
                  • Packages
                  • Bit-sizes
                • Dynamic-semantics
                • Compilation
                • Static-semantics
                • Concrete-syntax
        • Bigmems
        • Builtins
        • Execloader
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Community
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Unop

    Unop-case

    Case macro for the different kinds of unop 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 unop structure, or to split into cases based on its type.

    Short Form

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

    (unop-case x :neg)

    is essentially just a safer alternative to writing:

    (equal (unop-kind x) :neg)

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

    Long Form

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

    (unop-case x
      :neg ...
      :not ...
      :abs ...
      :abs-wrapped ...
      :double ...
      :inv ...
      :square-root ...
      :square ...)

    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 :neg case, you can use fty::defprod-style foo.bar style accessors for x without having to explicitly add a neg b* binder.