[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
!	separation-rg	f	Id × (Ref[A] → Id) × (Heap[A] → Bool) → Heap[A] → Bool
# .	heap	f	Heap[A] → Nat
# .	set-basic	f	Set[A] → Nat
. ( . )	heap	pf	Heap[A] × Ref[A] → A with λ h, r. r ≠ null ∧ r ∈ h
. ( . := . )	heap	pf	Heap[A] × Ref[A] × A → Heap[A] with λ h, r, o. r ≠ null ∧ r ∈ h
. * .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. + .	nat-basic	f	Nat × Nat → Nat
. ++ .	set-basic	f	Set[A] × A → Set[A]
. ++ .	heap	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
. -* .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. -- .	set-union	f	Set[A] × A → Set[A]
. -- .	heap	pf	Heap[A] × Ref[A] → Heap[A] with λ h, r. r ≠ null ∧ r ∈ h
. -> .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. -⊗ .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. -1	nat-basic	pf	Nat → Nat with λ n. n ≠ 0
. < .	nat-basic	p	Nat × Nat
. => .	maplet	f	Ref[A] × A → Heap[A] → Bool
. =>?	ex-maplet	f	Ref[A] → Heap[A] → Bool
. =>_	ex-maplet	f	Ref[A] → Heap[A] → Bool
. > .	nat	p	Nat × Nat
. \ .	set-union	f	Set[A] × Set[A] → Set[A]
. \ .	heapfuns	f	Heap[A] × Set[Ref[A]] → Heap[A]
. \ .	heapfuns	f	Heap[A] × Heap[A] → Heap[A]
. × .	gownership	f	Id × (Ref[A] → Id) → IdxO[A]
. ∈ .	heap	p	Ref('A) × Heap('A)
. ∈ .	set-basic	p	'A × Set('A)
. ∩ .	set-union	f	Set[A] × Set[A] → Set[A]
. ∪ .	set-union	f	Set[A] × Set[A] → Set[A]
. ∪ .	heapfuns	f	Heap[A] × Heap[A] → Heap[A]
. ≤ .	nat	p	Nat × Nat
. ≥ .	nat	p	Nat × Nat
. ⊆ .	set-basic	p	Set('A) × Set('A)
. ⊆ .	heapfuns	p	Heap('A) × Heap('A)
. ⊆ .	heap-sep	p	(Heap('A) → Bool) × (Heap('A) → Bool)
. ⊗ .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. ⊥ .	heapfuns	p	Heap('A) × Heap('A)
. O	gownership	f	IdxO[A] → Ref[A] → Id
. and .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
. 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)
. id	gownership	f	IdxO[A] → Id
. map ( . )	set-union	f	Set[A] × (A → B) → Set[B]
. or .	heap-sep	f	(Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
_∃ .	maplet	f	(B → Heap[A] → Bool) → Heap[A] → Bool
_∃ .	maplet	f	(B × C → Heap[A] → Bool) → Heap[A] → Bool
_∃ .	maplet	f	(B × C × D → Heap[A] → Bool) → Heap[A] → Bool
{ . }	set-union	f	A → Set[A]
{ . }	heap-sep	f	Heap[A] → Heap[A] → Bool
∅	heap	c	Heap[A]
∅	set-basic	c	Set[A]
⌜ . ⌝	heap-sep	f	Bool → Heap[A] → Bool
Heap	heap	s
Id	ownership	s
IdxO	gownership	s
Nat	nat-basic	s
Ref	polyref	s
Set	set-basic	s
alloc#	heap	pr	: Heap[A] → Ref[A] (nondeterministic)
disjoint	set-union	p	Set('A) × Set('A)
dom .	heapfuns	f	Heap[A] → Set[Ref[A]]
emp	heap-sep	p	Heap('A)
false	heap-sep	p	Heap('A)
guar	separation-rg	p	Id × (Ref('A) → Id) × Heap('A) × (Ref('A) → Id) × Heap('A)
h	separation-rg	v	Heap[A]
hO	separation-rg	v	Ref[A] → Id
hP	separation-rg	v	Heap[A] → Bool
id	separation-rg	v	Id
ite	heap-sep	f	Bool × (Heap[A] → Bool) × (Heap[A] → Bool) → Heap[A] → Bool
me	separation-rg	v	Id
not .	heap-sep	f	(Heap[A] → Bool) → Heap[A] → Bool
null	polyref	c	Ref[A]
o	separation-rg	v	A
of	separation-rg	v	Ref[A] → Id
ohP	separation-rg	v	A → Heap[A] → Bool
precise	heap-sep	p	(Heap('A) → Bool)
r	separation-rg	v	Ref[A]
rely	separation-rg	p	Id × (Ref('A) → Id) × Heap('A) × (Ref('A) → Id) × Heap('A)
true	heap-sep	p	Heap('A)