[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
# .	refset	f	refset → nat
# .	reflist	f	reflist → nat
# .	heap	f	heap → nat
# .	list-data	f	list → nat
. '	reflist	f	ref → reflist
. '	list	f	elem → list
. * .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. + .	nat-basic2	f	nat × nat → nat
. + .	reflist	f	ref × ref → reflist
. + .	list-data	f	elem × list → list
. + .	reflist	f	reflist × ref → reflist
. + .	list	f	list × list → list
. + .	reflist	f	reflist × reflist → reflist
. + .	list	f	list × elem → list
. + .	reflist	f	ref × reflist → reflist
. + .	list	f	elem × elem → list
. ++ .	reflist	f	reflist × ref → reflist
. ++ .	refset	f	refset × ref → refset
. ++ .	list-dup	f	list × elem → list
. ++ .	heap	f	heap × ref → heap
. +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
. -⊗ .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. -1	nat-basic1	f	nat → nat
. .butlast	reflist	f	reflist → reflist
. .butlast	list-last	f	list → list
. .first	list-data	f	list → elem
. .first	reflist	f	reflist → ref
. .last	reflist	f	reflist → ref
. .last	list-last	f	list → elem
. .left	cell	f	cell → ref
. .left:= .	cell	f	cell × ref → cell
. .rest	reflist	f	reflist → reflist
. .rest	list-data	f	list → list
. .right	cell	f	cell → ref
. .right:= .	cell	f	cell × ref → cell
. .val	cell	f	cell → elem
. .val:= .	cell	f	cell × elem → cell
. < .	reflist	p	reflist × reflist
. < .	list-data	p	list × list
. < .	nat-basic1	p	nat × nat
. < .	oelem	p	elem × elem
. => .	cell-heap	f	ref × cell → heap → bool
. =>?	maplet	f	ref → heap → bool
. =>_	maplet	f	ref → heap → bool
. > .	nat	p	nat × nat
. [ . ]	cell-heap	f	heap × ref → cell
. [ . ]	cell-heap	f	heap × ref × cell → heap
. \ .	refset	f	refset × refset → refset
. \ .	heap	f	heap × heap → heap
. \ .	heap	f	heap × refset → heap
. ∈ .	reflist	p	ref × reflist
. ∈ .	list	p	elem × list
. ∈ .	heap	p	ref × heap
. ∈ .	refset	p	ref × refset
. ∩ .	refset	f	refset × refset → refset
. ∪ .	refset	f	refset × refset → refset
. ∪ .	heap	f	heap × heap → heap
. ≡ .	separation	p	heap × heap
. ≤ .	nat	p	nat × nat
. ≥ .	nat	p	nat × nat
. ⊆ .	heap-sep	p	(heap → bool) × (heap → bool)
. ⊆ .	refset	p	refset × refset
. ⊑ .	reflist	p	reflist × reflist
. ⊑ .	list-last	p	list × list
. ⊒ .	reflist	p	reflist × reflist
. ⊒ .	list-last	p	list × list
. ⊥ .	heap	p	heap × heap
. and .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. or .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
[]	list-data	c	list
[]	reflist	c	reflist
_∃ .	cell-heap	f	(cell → heap → bool) → heap → bool
_∃ .	maplet	f	(ref × ref → heap → bool) → heap → bool
_∃ .	maplet	f	(ref → heap → bool) → heap → bool
{ . }	refset	f	ref → refset
{ . }	heap-sep	f	heap → heap → bool
∅	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
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	cell	v	elem
b	elem	v	elem
butlastn	list-last	f	nat × list → list
butlastn	reflist	f	nat × reflist → reflist
bv	heap-sep	v	bool
c	elem	v	elem
ce	cell	v	cell
ce0	cell-heap	v	cell
ce1	cell-heap	v	cell
cell	cell	s
disj	reflist	p	reflist × reflist
disj	list-dup	p	list × list
dls	dllist	f	ref × ref × list × reflist × ref × ref → heap → bool
dups	reflist	p	reflist
dups	list-dup	p	list
elem	elem	s
emp	heap-sep	p	heap
false	heap-sep	p	heap
fillfirst	list-last	f	nat × elem × list → list
fillfirst	reflist	f	nat × ref × reflist → reflist
head	dllist	v	ref
heap	heap	s
insert	implementation	pr	ref : heap
list	list-data	s
m	nat-basic2	v	nat
mkcell	cell	f	ref × ref × elem → cell
mklist	reflist	f	ref × nat → reflist
mklist	list-last	f	elem × nat → list
n	nat-basic1	v	nat
n0	nat-basic1	v	nat
n1	nat-basic1	v	nat
nat	nat-basic1	s
next	dllist	v	ref
not .	heap-sep	f	(heap → bool) → heap → bool
null	ref	c	ref
oP	cell-heap	v	cell → heap → bool
precise	heap-sep	p	(heap → bool)
prev	dllist	v	ref
r	ref	v	ref
r0	ref	v	ref
r1	ref	v	ref
r2	reflist	v	ref
rP	maplet	v	ref → heap → bool
ref	ref	s
reflist	reflist	s
refset	refset	s
remove	implementation	pr	ref : heap
rev	reflist	f	reflist → reflist
rev	list-last	f	list → list
rmdup	list-dup	f	list → list
rmdup	reflist	f	reflist → reflist
rrP	maplet	v	ref × ref → heap → bool
rs	refset	v	refset
rs0	refset	v	refset
rs1	refset	v	refset
rs2	refset	v	refset
rx	reflist	v	reflist
rx0	reflist	v	reflist
rx1	reflist	v	reflist
rx2	reflist	v	reflist
ry	reflist	v	reflist
ry0	reflist	v	reflist
ry1	reflist	v	reflist
ry2	reflist	v	reflist
rz	reflist	v	reflist
rz0	reflist	v	reflist
rz1	reflist	v	reflist
rz2	reflist	v	reflist
tail	dllist	v	ref
true	heap-sep	p	heap
x	list-data	v	list
x0	list-data	v	list
x1	list-data	v	list
x2	list-data	v	list
y	list-data	v	list
y0	list-data	v	list
y1	list-data	v	list
y2	list-data	v	list
z	list-data	v	list
z0	list-data	v	list
z1	list-data	v	list
z2	list-data	v	list