• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
        • Proof-support
        • Semantics
          • Exec-proof-tree
          • Assertion-list->constr-list
          • Assertion-list->asg-list
          • Eval-expr-list
          • Eval-expr
          • Assignment-wfp
          • Assertion
          • Proof-outcome
          • Proof-list-outcome
          • Assertion-list-from
          • Definition-satp
          • Constraint-satp
          • Assignment
          • System-satp
          • Constraint-list-satp
          • Assertion-list
          • Assignment-list
          • Proof-trees
            • Proof-tree
              • Proof-tree-case
              • Proof-tree-relation
                • Make-proof-tree-relation
                • Proof-tree-relation->sub
                • Proof-tree-relation->asgfree
                • Proof-tree-relation->args
                • Proof-tree-relation->name
                • Proof-tree-relation->asg
                • Change-proof-tree-relation
                • Proof-tree-equiv
                • Proof-tree-equal
                • Proof-treep
                • Proof-tree-kind
                • Proof-tree-fix
                • Proof-tree-count
              • Proof-tree-list
          • Lifting
          • R1cs-subset
          • Well-formedness
          • Abstract-syntax
          • Concrete-syntax
          • R1cs-bridge
          • Parser-interface
        • Legacy-defrstobj
        • C
        • Proof-checker-array
        • Soft
        • Farray
        • Rp-rewriter
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Ethereum
        • Leftist-trees
        • Java
        • Riscv
        • Taspi
        • Bitcoin
        • Zcash
        • Des
        • X86isa
        • Sha-2
        • Yul
        • Proof-checker-itp13
        • Regex
        • ACL2-programming-language
        • Json
        • Jfkr
        • Equational
        • Cryptography
        • Axe
        • Poseidon
        • Where-do-i-place-my-book
        • Aleo
        • 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
    • Proof-tree-relation

    Change-proof-tree-relation

    Modifying constructor for proof-tree-relation structures.

    Syntax
    (change-proof-tree-relation x 
                                [:asg <asg>] 
                                [:name <name>] 
                                [:args <args>] 
                                [:sub <sub>] 
                                [:asgfree <asgfree>]) 
    

    This is an often useful alternative to make-proof-tree-relation.

    We construct a new proof-tree-relation structure that is a copy of x, except that you can explicitly change some particular fields. Any fields you don't mention just keep their values from x.

    Definition

    This is an ordinary change- macro introduced by fty::defprod.

    Macro: change-proof-tree-relation

    (defmacro change-proof-tree-relation (x &rest args)
     (std::change-aggregate 'proof-tree-relation
                            x args
                            '((:asg . proof-tree-relation->asg)
                              (:name . proof-tree-relation->name)
                              (:args . proof-tree-relation->args)
                              (:sub . proof-tree-relation->sub)
                              (:asgfree . proof-tree-relation->asgfree))
                            'change-proof-tree-relation
                            'nil))