[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
# .	refset	f	refset → nat
# .	heap	f	heap → nat
. * .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. + .	nat-basic	f	nat × nat → nat
. ++ .	heap	f	heap × ref → heap
. ++ .	refset	f	refset × ref → refset
. +1	nat-basic	f	nat → nat
. - .	nat	pf	nat × nat → nat with λ n, m. n ≥ m
. -* .	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-basic	pf	nat → nat with λ n. n ≠ 0
. .left	node	f	node → ref
. .left	tree	pf	tree → tree with λ t. t ≠ leaf
. .left:= .	tree	pf	tree × tree → tree with λ t, t0. t ≠ leaf
. .left:= .	node	f	node × ref → node
. .right	node	f	node → ref
. .right	tree	pf	tree → tree with λ t. t ≠ leaf
. .right:= .	tree	pf	tree × tree → tree with λ t, t0. t ≠ leaf
. .right:= .	node	f	node × ref → node
. .val	node	f	node → elem
. .val	tree	pf	tree → elem with λ t. t ≠ leaf
. .val:= .	tree	pf	tree × elem → tree with λ t, a. t ≠ leaf
. .val:= .	node	f	node × elem → node
. < .	nat-basic	p	nat × nat
. => .	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
. \ .	refset	f	refset × refset → refset
. \ .	heap	f	heap × heap → heap
. \ .	heap	f	heap × refset → heap
. ∈ .	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)
. ⊆ .	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
{ . }	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	tree	v	elem
alloc	ops	pr	: ref × heap (nondeterministic nonfunctional)
b	elem	v	elem
branch	tree	f	tree × elem × tree → 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 (nonfunctional)
heap	heap	s
ite	heap-sep	f	bool × (heap → bool) × (heap → bool) → heap → bool
leaf	tree	c	tree
m	nat-basic	v	nat
mknode	node	f	ref × elem × ref → node
n	nat-basic	v	nat
n0	nat-basic	v	nat
n1	nat-basic	v	nat
nat	nat-basic	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	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
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 (nonfunctional)