[Imprint][Data Privacy Statement][E-Mail]

Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Signature symbols in this unit

Symbol Specification Kind Type
# .heapfHeap[A] → Nat
# .set-basicfSet[A] → Nat
# .treefTree[A] → Nat
. ( . )heappfHeap[A] × Ref[A] → A with λ h, r. r ≠ null ∧ r ∈ h
. ( . := . )heappfHeap[A] × Ref[A] × A → Heap[A] with λ h, r, o. r ≠ null ∧ r ∈ h
. * .heap-sepf(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. + .nat-basicfNat × Nat → Nat
. ++ .set-basicfSet[A] × A → Set[A]
. ++ .heappfHeap[A] × Ref[A] → Heap[A] with λ h, r. r ≠ null ∧ ¬ r ∈ h
. +1nat-basicfNat → Nat
. - .natpfNat × Nat → Nat with λ n, m. n ≥ m
. -* .heap-sepf(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. -- .set-unionfSet[A] × A → Set[A]
. -- .heappfHeap[A] × Ref[A] → Heap[A] with λ h, r. r ≠ null ∧ r ∈ h
. -> .heap-sepf(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. -⊗ .heap-sepf(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. -1nat-basicpfNat → Nat with λ n. n ≠ 0
. < .nat-basicpNat × Nat
. => .mapletfRef[A] × A → Heap[A] → Bool
. =>?ex-mapletfRef[A] → Heap[A] → Bool
. =>_ex-mapletfRef[A] → Heap[A] → Bool
. > .natpNat × Nat
. \ .set-unionfSet[A] × Set[A] → Set[A]
. \ .heapfunsfHeap[A] × Set[Ref[A]] → Heap[A]
. \ .heapfunsfHeap[A] × Heap[A] → Heap[A]
. ∈ .heappRef('A) × Heap('A)
. ∈ .set-basicp'A × Set('A)
. ∩ .set-unionfSet[A] × Set[A] → Set[A]
. ∪ .set-unionfSet[A] × Set[A] → Set[A]
. ∪ .heapfunsfHeap[A] × Heap[A] → Heap[A]
. ≡ .separationpHeap('A) × Heap('A)
. ≤ .natpNat × Nat
. ≥ .natpNat × Nat
. ⊆ .set-basicpSet('A) × Set('A)
. ⊆ .heapfunspHeap('A) × Heap('A)
. ⊆ .heap-sepp(Heap('A) → Bool) × (Heap('A) → Bool)
. ⊗ .heap-sepf(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. ⊥ .heapfunspHeap('A) × Heap('A)
. and .heap-sepf(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. exists ( . )set-unionpSet('A) × ('A → Bool)
. filter ( . )set-unionfSet[A] × (A → Bool) → Set[A]
. forall ( . )set-unionpSet('A) × ('A → Bool)
. leftnodefNode[A] → Ref[Node[A]]
. lefttreepfTree[A] → Tree[A] with λ t. t ≠ leaf
. left:= .nodefNode[A] × Ref[Node[A]] → Node[A]
. left:= .treepfTree[A] × Tree[A] → Tree[A] with λ t, t0. t ≠ leaf
. map ( . )set-unionfSet[A] × (A → B) → Set[B]
. or .heap-sepf(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. rightnodefNode[A] → Ref[Node[A]]
. righttreepfTree[A] → Tree[A] with λ t. t ≠ leaf
. right:= .nodefNode[A] × Ref[Node[A]] → Node[A]
. right:= .treepfTree[A] × Tree[A] → Tree[A] with λ t, t0. t ≠ leaf
. valnodefNode[A] → A
. valtreepfTree[A] → A with λ t. t ≠ leaf
. val:= .nodefNode[A] × A → Node[A]
. val:= .treepfTree[A] × A → Tree[A] with λ t, val. t ≠ leaf
_∃ .mapletf(B → Heap[A] → Bool) → Heap[A] → Bool
_∃ .mapletf(B × C → Heap[A] → Bool) → Heap[A] → Bool
_∃ .mapletf(B × C × D → Heap[A] → Bool) → Heap[A] → Bool
{ . }set-unionfA → Set[A]
{ . }heap-sepfHeap[A] → Heap[A] → Bool
∅heapcHeap[A]
∅set-basiccSet[A]
⌜ . ⌝heap-sepfBool → Heap[A] → Bool
Heapheaps
Natnat-basics
Nodenodes
Refpolyrefs
Setset-basics
Treetrees
TrueseparationpBool
alinked-treevA
alloc#heappr : Heap[A] → Ref[A] (nondeterministic)
branchtreefTree[A] × A × Tree[A] → Tree[A]
disjointset-unionpSet('A) × Set('A)
dom .heapfunsfHeap[A] → Set[Ref[A]]
empheap-seppHeap('A)
falseheap-seppHeap('A)
hlinked-treevHeap[Node[A]]
hPlinked-treevHeap[Node[A]] → Bool
iteheap-sepfBool × (Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
leaftreecTree[A]
mknodenodefRef[Node[A]] × A × Ref[Node[A]] → Node[A]
not .heap-sepf(Heap[A] → Bool) → Heap[A] → Bool
nullpolyrefcRef[A]
preciseheap-sepp(Heap('A) → Bool)
rlinked-treevRef[Node[A]]
tlinked-treevTree[A]
trlinked-treefRef[Node[A]] × Tree[A] → Heap[Node[A]] → Bool
trueheap-seppHeap('A)