[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
# .	set-basic	f	Set[A] → Nat
# .	heap-old	f	Heap[A] → Nat
. ( . )	heap-old	pf	Heap[A] × Ref[A] → A with λ h, r. r ≠ null ∧ r ∈ h
. ( . := . )	heap-old	pf	Heap[A] × Ref[A] × A → Heap[A] with λ h, r, o. r ≠ null ∧ r ∈ h
. + .	nat-basic	f	Nat × Nat → Nat
. ++ .	set-basic	f	Set[A] × A → Set[A]
. ++ .	heap-old	pf	Heap[A] × Ref[A] → Heap[A] with λ h, r. r ≠ null ∧ ¬ r ∈ h
. +1	nat-basic	f	Nat → Nat
. - .	nat	pf	Nat × Nat → Nat with λ n, m. n ≥ m
. -- .	set-union	f	Set[A] × A → Set[A]
. -- .	heap-old	pf	Heap[A] × Ref[A] → Heap[A] with λ h, r. r ≠ null ∧ r ∈ h
. -1	nat-basic	pf	Nat → Nat with λ n. n ≠ 0
. < .	nat-basic	p	Nat × Nat
. > .	nat	p	Nat × Nat
. \ .	set-union	f	Set[A] × Set[A] → Set[A]
. \ .	heap-old	f	Heap[A] × Set[Ref[A]] → Heap[A]
. \ .	heap-old	f	Heap[A] × Heap[A] → Heap[A]
. ∈ .	set-basic	p	'A × Set('A)
. ∈ .	heap-old	p	Ref('A) × Heap('A)
. ∩ .	set-union	f	Set[A] × Set[A] → Set[A]
. ∪ .	set-union	f	Set[A] × Set[A] → Set[A]
. ∪ .	heap-old	f	Heap[A] × Heap[A] → Heap[A]
. ≤ .	nat	p	Nat × Nat
. ≥ .	nat	p	Nat × Nat
. ⊆ .	set-basic	p	Set('A) × Set('A)
. ⊆ .	heap-old	p	Heap('A) × Heap('A)
. ⊥ .	heap-old	p	Heap('A) × Heap('A)
. exists ( . )	set-union	p	Set('A) × ('A → Bool)
. filter ( . )	set-union	f	Set[A] × (A → Bool) → Set[A]
. forall ( . )	set-union	p	Set('A) × ('A → Bool)
. map ( . )	set-union	f	Set[A] × (A → B) → Set[B]
{ . }	set-union	f	A → Set[A]
∅	set-basic	c	Set[A]
∅	heap-old	c	Heap[A]
Heap	heap-old	s
Nat	nat-basic	s
Ref	polyref	s
Set	set-basic	s
d	heap-old	v	A
disjoint	set-union	p	Set('A) × Set('A)
dom .	heap-old	f	Heap[A] → Set[Ref[A]]
h	heap-old	v	Heap[A]
hP	heap-old	v	Heap[A] → Bool
null	polyref	c	Ref[A]
o	heap-old	v	A
r	heap-old	v	Ref[A]
rs	heap-old	v	Set[Ref[A]]