def fresh

stelliferous@0.0.2.0 · proofs/storage_allocation_refinement.bend:53

import Base
import stelliferous@0.0.2.0/storage_allocation.bend as Allocation
import stelliferous@0.0.2.0/proofs/storage_tree_model.bend as Tree
import stelliferous@0.0.2.0/proofs/storage_refinement.bend as StorageLaws

53def fresh(~Element: Data,+depth: Nat,+value: Element) ->
54  {Allocation.array(~Element,depth,value) == Tree.pack(Element,Tree.fresh(Element,depth,value)) : Array<Element>}:
55  Equal.trans(Array<Element>,Allocation.array(~Element,depth,value),Array.new(Element,depth,value),
56    Tree.pack(Element,Tree.fresh(Element,depth,value)),array_same(Element,depth,value),StorageLaws.fresh(Element,depth,value))