[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 → id) × (heap → bool) → heap → bool
# .	refset	f	refset → nat
# .	heap	f	heap → nat
. * .	separation-rg	f	(heap × heap → bool) × (heap × heap → bool) → heap × heap → bool
. * .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. + .	nat-basic2	f	nat × nat → nat
. ++ .	heap	f	heap × ref → heap
. ++ .	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
. -- .	refset	f	refset × ref → refset
. -- .	heap	f	heap × ref → heap
. -⊗ .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. -1	nat-basic1	f	nat → nat
. .id	gownership	f	idxO → id
. .O	gownership	f	idxO → ref → id
. < .	nat-basic1	p	nat × nat
. => .	maplet	f	ref × obj → heap → bool
. =>?	maplet	f	ref → heap → bool
. =>_	maplet	f	ref → heap → bool
. > .	nat	p	nat × nat
. [ . ]	heap	f	heap × ref → obj
. [ . ]	heap	f	heap × ref × obj → heap
. \ .	refset	f	refset × refset → refset
. \ .	heap	f	heap × refset → heap
. \ .	heap	f	heap × heap → heap
. ≤ .	nat	p	nat × nat
. ≥ .	nat	p	nat × nat
. → .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. ∈ .	heap	p	ref × heap
. ∈ .	refset	p	ref × refset
. ∪ .	refset	f	refset × refset → refset
. ∪ .	heap	f	heap × heap → heap
. ∩ .	refset	f	refset × refset → refset
. ∧ .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. ∨ .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. ⊥ .	heap	p	heap × heap
. ⊆ .	heap-sep	p	(heap → bool) × (heap → bool)
. ⊆ .	heap	p	heap × heap
. ⊆ .	refset	p	refset × refset
. × .	gownership	f	id × (ref → id) → idxO
. ⊗ .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
_∃ .	maplet	f	(obj → heap → bool) → heap → bool
_∃ .	maplet	f	(ref → heap → bool) → heap → bool
_∃ .	maplet	f	(ref × ref → heap → bool) → heap → bool
{ . }	refset	f	ref → refset
{ . }	heap-sep	f	heap → heap → bool
↑ .	separation-rg	f	(heap → bool) → heap × heap → bool
↓ .	separation-rg	f	(heap → bool) → heap × heap → bool
¬ .	heap-sep	f	(heap → bool) → heap → bool
∅	refset	c	refset
∅	heap	c	heap
⌜ . ⌝	heap-sep	f	bool → heap → bool
bv	heap-sep	v	bool
emp	heap-sep	p	heap
false	heap-sep	p	heap
guar	separation-rg	p	id × (ref → id) × heap × (ref → id) × heap
H	heap	v	heap
H0	heap	v	heap
H1	heap	v	heap
H2	heap	v	heap
H3	separation-rg	v	heap
H4	separation-rg	v	heap
H5	separation-rg	v	heap
heap	heap	s
id	ownership	v	id
id	ownership	s
id0	gownership	v	id
idxO	gownership	v	idxO
idxO	gownership	s
m	nat-basic2	v	nat
me	separation-rg	v	id
n	nat-basic1	v	nat
n0	nat-basic1	v	nat
n1	nat-basic1	v	nat
nat	nat-basic1	s
null	ref	c	ref
O	ownership	v	ref → id
o	obj	v	obj
O0	gownership	v	ref → id
o0	obj	v	obj
o1	obj	v	obj
O1	separation-rg	v	ref → id
O2	separation-rg	v	ref → id
obj	obj	s
oP	maplet	v	obj → heap → bool
P	heap-sep	v	heap → bool
P0	heap-sep	v	heap → bool
P1	heap-sep	v	heap → bool
P2	heap-sep	v	heap → bool
precise	heap-sep	p	(heap → bool)
Q	separation-rg	v	heap → bool
R	separation-rg	v	heap × heap → bool
r	ref	v	ref
r0	ref	v	ref
R0	separation-rg	v	heap × heap → bool
r1	ref	v	ref
R1	separation-rg	v	heap × heap → bool
R2	separation-rg	v	heap × heap → bool
ref	ref	s
refset	refset	s
rely	separation-rg	p	id × (ref → id) × heap × (ref → id) × heap
rP	maplet	v	ref → heap → bool
rrP	maplet	v	ref × ref → heap → bool
rs	refset	v	refset
rs0	refset	v	refset
rs1	refset	v	refset
rs2	refset	v	refset
true	heap-sep	p	heap