[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
# .	tree	f	tree → nat
# .	heap	f	heap → nat
. % .	int-div	f	int × int → int
. * .	int-mult	f	int × int → int
. * .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. + .	nat-basic2	f	nat × nat → nat
. + .	int-basic2	f	int × int → int
. ++ .	refset	f	refset × ref → refset
. ++ .	heap	f	heap × ref → heap
. +1	nat-basic1	f	nat → nat
. +1	int-basic1	f	int → int
. - .	int-abs	f	int × int → int
. - .	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
. -1	int-basic1	f	int → int
. .left	node	f	node → ref
. .left	tree	f	tree → tree
. .left:= .	tree	f	tree × tree → tree
. .left:= .	node	f	node × ref → node
. .right	node	f	node → ref
. .right	tree	f	tree → tree
. .right:= .	tree	f	tree × tree → tree
. .right:= .	node	f	node × ref → node
. .val	int-tree	f	node → int
. .val	int-tree	f	tree → int
. .val:= .	int-tree	f	node × int → node
. .val:= .	int-tree	f	tree × int → tree
. / .	int-div	f	int × int → int
. < .	int-basic1	p	int × int
. < .	nat-basic1	p	nat × nat
. => .	node-heap	f	ref × node → heap → bool
. =>?	maplet	f	ref → heap → bool
. =>_	maplet	f	ref → heap → bool
. > .	int-abs	p	int × int
. > .	nat	p	nat × nat
. [ . ]	node-heap	f	heap × ref → node
. [ . ]	node-heap	f	heap × ref × node → heap
. \ .	refset	f	refset × refset → refset
. \ .	heap	f	heap × refset → heap
. \ .	heap	f	heap × heap → heap
. ≤ .	int-abs	p	int × int
. ≤ .	nat	p	nat × nat
. ≥ .	int-abs	p	int × int
. ≥ .	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)
. ⊆ .	refset	p	refset × refset
. ≡ .	separation	p	heap × heap
_∃ .	maplet	f	(ref → heap → bool) → heap → bool
_∃ .	node-heap	f	(node → heap → bool) → heap → bool
_∃ .	maplet	f	(ref × ref → heap → bool) → heap → bool
{ . }	refset	f	ref → refset
{ . }	heap-sep	f	heap → heap → bool
~ .	int-abs	f	int → int
¬ .	heap-sep	f	(heap → bool) → heap → bool
∅	refset	c	refset
∅	heap	c	heap
⌜ . ⌝	heap-sep	f	bool → heap → bool
abs	int-abs	f	int → int
alloc	ops	pr	: ref × heap
Boolvar	int-tree	v	bool,flexible
boolvar	int-tree	v	bool
boolvar0	int-tree	v	bool
boolvar1	int-tree	v	bool
branch	int-tree	f	tree × int × tree → tree
bv	heap-sep	v	bool
emp	heap-sep	p	heap
even	int-min	p	int
false	heap-sep	p	heap
free	ops	pr	ref : heap
H	heap	v	heap
H0	heap	v	heap
H1	heap	v	heap
H2	heap	v	heap
heap	heap	s
i	int-basic1	v	int
i0	int-basic1	v	int
i1	int-tree	v	int
int	int-basic1	s
j	int-basic1	v	int
j0	int-basic1	v	int
leaf	tree	c	tree
m	nat-basic2	v	nat
max	int-min	f	int × int → int
min	int-min	f	int × int → int
mknode	int-tree	f	ref × int × ref → node
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
null	ref	c	ref
odd	int-min	p	int
oP	node-heap	v	node → 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)
r	ref	v	ref
r0	ref	v	ref
r1	ref	v	ref
r2	node	v	ref
read	node-heap	pr	ref × heap : node
ref	ref	s
refset	refset	s
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
sgn	int-min	f	int → int
t	tree	v	tree
t0	tree	v	tree
t1	tree	v	tree
t2	tree	v	tree
tr	linked-tree	f	ref × tree → heap → bool
tree	tree	s
True	separation	p	bool
true	heap-sep	p	heap
write	node-heap	pr	ref × node : heap