• 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

    Make-proof-tree-relation

    Basic constructor macro for proof-tree-relation structures.

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

    This is the usual way to construct proof-tree-relation structures. It simply conses together a structure with the specified fields.

    This macro generates a new proof-tree-relation structure from scratch. See also change-proof-tree-relation, which can "change" an existing structure, instead.

    Definition

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

    Macro: make-proof-tree-relation

    (defmacro make-proof-tree-relation (&rest args)
      (std::make-aggregate 'proof-tree-relation
                           args
                           '((:asg)
                             (:name)
                             (:args)
                             (:sub)
                             (:asgfree))
                           'make-proof-tree-relation
                           nil))

    Function: proof-tree-relation

    (defun proof-tree-relation (asg name args sub asgfree)
      (declare (xargs :guard (and (assignmentp asg)
                                  (namep name)
                                  (expression-listp args)
                                  (proof-tree-listp sub)
                                  (assignmentp asgfree))))
      (declare (xargs :guard t))
      (let ((__function__ 'proof-tree-relation))
        (declare (ignorable __function__))
        (b* ((asg (mbe :logic (assignment-fix asg)
                       :exec asg))
             (name (mbe :logic (name-fix name) :exec name))
             (args (mbe :logic (expression-list-fix args)
                        :exec args))
             (sub (mbe :logic (proof-tree-list-fix sub)
                       :exec sub))
             (asgfree (mbe :logic (assignment-fix asgfree)
                           :exec asgfree)))
          (cons :relation (list asg name args sub asgfree)))))