[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
# .	tree	f	tree → nat
# .	set-basic	f	set → nat
# .	heap	f	heap → 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
. -- .	set-union	f	set × elem → set
. -- .	heap	f	heap × ref → heap
. -- .	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
. .butleftmost	search-tree	f	tree → tree
. .butmax	oset	f	set → set
. .butmin	oset	f	set → set
. .insert ( . )	search-tree	f	tree × elem → tree
. .left	node	f	node → ref
. .left	tree	f	tree → tree
. .left:= .	tree	f	tree × tree → tree
. .left:= .	node	f	node × ref → node
. .leftmost	search-tree	f	tree → elem
. .max	oset	f	set → elem
. .min	oset	f	set → elem
. .right	node	f	node → ref
. .right	tree	f	tree → tree
. .right:= .	tree	f	tree × tree → tree
. .right:= .	node	f	node × ref → node
. .set	data-refinement	f	tree → set
. .val	node	f	node → elem
. .val	tree	f	tree → elem
. .val:= .	tree	f	tree × elem → tree
. .val:= .	node	f	node × elem → node
. < .	oset	p	set × elem
. < .	oset	p	elem × set
. < .	nat-basic1	p	nat × nat
. < .	oelem	p	elem × elem
. => .	node-heap	f	ref × node → heap → bool
. =>?	maplet	f	ref → heap → bool
. =>_	maplet	f	ref → heap → bool
. > .	nat	p	nat × nat
. [ . ]	node-heap	f	heap × ref → node
. [ . ]	node-heap	f	heap × ref × node → heap
. \ .	set-union	f	set × set → set
. \ .	heap	f	heap × heap → heap
. \ .	refset	f	refset × refset → refset
. \ .	heap	f	heap × refset → heap
. ∈ .	search-tree	p	elem × tree
. ∈ .	heap	p	ref × heap
. ∈ .	refset	p	ref × refset
. ∈ .	set-basic	p	elem × set
. ∩ .	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)
. ⊆ .	set-basic	p	set × set
. ⊆ .	heap	p	heap × heap
. ⊆ .	refset	p	refset × refset
. ⊗ .	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
∅	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
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	tree	v	elem
alloc	ops	pr	: ref, heap
b	elem	v	elem
branch	tree	f	tree × elem × tree → tree
bst	search-tree	p	tree
bv	heap-sep	v	bool
c	elem	v	elem
elem	elem	s
emp	heap-sep	p	heap
false	heap-sep	p	heap
free	ops	pr	ref : heap
heap	heap	s
ite	heap-sep	f	bool × (heap → bool) × (heap → bool) → heap → bool
leaf	tree	c	tree
m	nat-basic1	v	nat
mknode	node	f	ref × elem × 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
not .	heap-sep	f	(heap → bool) → heap → bool
null	ref	c	ref
oP	node-heap	v	node → heap → bool
ordered_set_delete_min	ordered-set	pr	: elem, set
ordered_set_insert	ordered-set	pr	elem : set
precise	heap-sep	p	(heap → bool)
r	ref	v	ref
r0	ref	v	ref
r1	ref	v	ref
r2	node	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
search_tree_delete_min	search-tree	pr	: elem, ref, heap
search_tree_insert	search-tree	pr	elem : ref, heap
search_tree_mknode	search-tree	pr	ref, elem, ref : ref, heap
set	set-basic	s
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	heap-sep	p	heap
write	node-heap	pr	ref, node : heap