[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
# .	successors	f	successors → nat
# .	heap	f	heap → nat
# .	set-basic	f	set → nat
# .	refset	f	refset → nat
. * .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. + .	nat-basic2	f	nat × nat → nat
. ++ .	heap	f	heap × ref → heap
. ++ .	set-basic	f	set × elem → set
. ++ .	refset	f	refset × ref → refset
. +1	nat-basic1	f	nat → nat
. - .	nat	f	nat × nat → nat
. -* .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. -- .	successors	f	successors × elem → successors
. -- .	heap	f	heap × ref → heap
. -- .	set-union	f	set × elem → set
. -- .	refset	f	refset × ref → refset
. -> .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. -⊗ .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. -1	nat-basic1	f	nat → nat
. .edges	node	f	node → successors
. .edges:= .	node	f	node × successors → node
. .value	node	f	node → elem
. .value:= .	node	f	node × elem → node
. < .	nat-basic1	p	nat × nat
. => .	node-heap	f	ref × node → heap → bool
. =>?	maplet	f	ref → heap → bool
. =>_	maplet	f	ref → heap → bool
. > .	nat	p	nat × nat
. [ . ]	successors	f	successors × elem × ref → successors
. [ . ]	node-heap	f	heap × ref × node → heap
. [ . ]	successors	f	successors × elem → ref
. [ . ]	node-heap	f	heap × ref → node
. \ .	heap	f	heap × heap → heap
. \ .	set-union	f	set × set → set
. \ .	heap	f	heap × refset → heap
. \ .	successors	f	successors × set → successors
. \ .	refset	f	refset × refset → refset
. × .	successors	f	elem × ref → elemref
. ∈ .	heap	p	ref × heap
. ∈ .	refset	p	ref × refset
. ∈ .	successors	p	ref × successors
. ∈ .	successors	p	elem × successors
. ∈ .	set-basic	p	elem × set
. ∈ .	successors	p	elemref × successors
. ∩ .	set-union	f	set × set → set
. ∩ .	refset	f	refset × refset → refset
. ∪ .	set-union	f	set × set → set
. ∪ .	heap	f	heap × heap → heap
. ∪ .	refset	f	refset × refset → refset
. ≡ .	separation	p	heap × heap
. ≤ .	nat	p	nat × nat
. ≥ .	nat	p	nat × nat
. ⊆ .	heap-sep	p	(heap → bool) × (heap → bool)
. ⊆ .	heap	p	heap × heap
. ⊆ .	successors	p	successors × successors
. ⊆ .	refset	p	refset × refset
. ⊆ .	set-basic	p	set × set
. ⊗ .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. ⊥ .	heap	p	heap × heap
. and .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. or .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
_∃ .	node-heap	f	(node → heap → bool) → heap → bool
_∃ .	maplet	f	(ref → heap → bool) → heap → bool
_∃ .	maplet	f	(ref × ref → heap → bool) → heap → bool
{ . }	set-union	f	elem → set
{ . }	heap-sep	f	heap → heap → bool
{ . }	refset	f	ref → refset
∅	successors	c	successors
∅	set-basic	c	set
∅	refset	c	refset
∅	heap	c	heap
⌜ . ⌝	heap-sep	f	bool → heap → bool
H	heap	v	heap
H0	heap	v	heap
H1	heap	v	heap
H2	heap	v	heap
Node	node	f	elem × successors → node
P	heap-sep	v	heap → bool
P0	heap-sep	v	heap → bool
P1	heap-sep	v	heap → bool
P2	heap-sep	v	heap → bool
True	separation	p	bool
a	elem	v	elem
a0	store	v	elem
alloc	ops-impl	pr	: ref, heap
b	elem	v	elem
bv	heap-sep	v	bool
c	elem	v	elem
dom .	successors	f	successors → set
elem	elem	s
elemref	successors	s
elemrefvar	successors	v	elemref
emp	heap-sep	p	heap
false	heap-sep	p	heap
free	ops-impl	pr	ref : heap
heap	heap	s
m	nat-basic2	v	nat
n	nat-basic1	v	nat
n0	nat-basic1	v	nat
n1	nat-basic1	v	nat
nat	nat-basic1	s
nd	node	v	node
nd0	node-heap	v	node
nd1	node-heap	v	node
node	node	s
not .	heap-sep	f	(heap → bool) → heap → bool
null	ref	c	ref
oP	node-heap	v	node → heap → bool
precise	heap-sep	p	(heap → bool)
r	ref	v	ref
r0	ref	v	ref
r1	ref	v	ref
r2	successors	v	ref
rP	maplet	v	ref → heap → bool
read	node-heap	pr	ref, heap : node
ref	ref	s
refset	refset	s
rrP	maplet	v	ref × ref → heap → bool
rs	refset	v	refset
rs0	refset	v	refset
rs1	refset	v	refset
rs2	refset	v	refset
s	set-basic	v	set
s0	set-basic	v	set
s1	set-basic	v	set
s2	set-basic	v	set
set	set-basic	s
succ	successors	v	successors
succ0	successors	v	successors
succ1	successors	v	successors
succ2	successors	v	successors
successors	successors	s
true	heap-sep	p	heap
write	node-heap	pr	ref, node : heap