• 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
      • Taspi
      • Bitcoin
      • Riscv
      • Des
      • Ethereum
        • Mmp-trees
        • Semaphore
        • Database
        • Cryptography
        • Rlp
          • Rlp-tree
            • Rlp-tree-case
              • Rlp-tree-equiv
              • Rlp-treep
              • Rlp-tree-leaf
              • Rlp-tree-branch
              • Rlp-tree-kind
              • Rlp-tree-list
              • Rlp-tree-fix
              • Rlp-tree-count
            • Rlp-decoding-executable
            • Rlp-decodability
            • Rlp-encoding
            • Rlp-decoding-declarative
            • Rlp-big-endian-representations
          • Transactions
          • Hex-prefix
          • Basics
          • Addresses
        • 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
    • Rlp-tree

    Rlp-tree-case

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

    Short Form

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

    (rlp-tree-case x :leaf)

    is essentially just a safer alternative to writing:

    (equal (rlp-tree-kind x) :leaf)

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

    Long Form

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

    (rlp-tree-case x
      :leaf ...
      :branch ...)

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