[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
. ( . )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
. ==> ( . )heap-auxfRef[(A, B)] × A × B → Heap[(A, B)] → Bool
. => .mapletfRef[A] × A → Heap[A] → Bool
. =>?ex-mapletfRef[A] → Heap[A] → Bool
. =>_ex-mapletfRef[A] → Heap[A] → Bool
. > .natpNat × Nat
. [ . ]heap-auxfHeap[(A, B)] × Ref[(A, B)] × A × B → Heap[(A, B)]
. [ . ]heap-funp(Heap('A) → Bool) × Set(Ref('A)) × (Ref('A) → 'A)
. [ . ]heap-auxp(Heap(('A, 'B)) → Bool) × Set(Ref(('A, 'B))) × (Ref(('A, 'B)) → 'A) × (Ref(('A, 'B)) → 'B)
. [ . ]aheap-auxfHeap[(A, B)] × Ref[(A, B)] → B
. [ . ]oheap-auxfHeap[(A, B)] × Ref[(A, B)] → A
. \ .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]
. ≤ .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)
. map ( . )set-unionfSet[A] × (A → B) → Set[B]
. or .heap-sepf(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
_∃ .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
Refpolyrefs
Setset-basics
aheap-auxvB
alloc#heappr : Heap[A] → Ref[A] (nondeterministic)
bvheap-auxvBool
disjointset-unionpSet('A) × Set('A)
dom .heapfunsfHeap[A] → Set[Ref[A]]
empheap-seppHeap('A)
fheap-auxvRef[(A, B)] → A
falseheap-seppHeap('A)
gheap-auxvRef[(A, B)] → B
hheap-auxvHeap[(A, B)]
hPheap-auxvHeap[(A, B)] → Bool
hRheap-auxvHeap[(A, B)] → Bool
haheap-auxvHeap[(A, B)]
iteheap-sepfBool × (Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
mkheap-funfSet[Ref[A]] × (Ref[A] → A) → Heap[A]
mkheap-auxfSet[Ref[(A, B)]] × (Ref[(A, B)] → A) × (Ref[(A, B)] → B) → Heap[(A, B)]
not .heap-sepf(Heap[A] → Bool) → Heap[A] → Bool
nullpolyrefcRef[A]
oheap-auxvA
oaheap-auxv(A, B)
oaRheap-auxvA × B → Heap[(A, B)] → Bool
preciseheap-sepp(Heap('A) → Bool)
rheap-auxvRef[(A, B)]
rRheap-auxvRef[(A, B)] → Heap[(A, B)] → Bool
rrRheap-auxv(Ref[(A, B)], Ref[(A, B)]) → Heap[(A, B)] → Bool
rsheap-auxvSet[Ref[(A, B)]]
trueheap-seppHeap('A)