[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
# .	heap	f	heap → nat
# .	reflist	f	reflist → nat
# .	list-data	f	list → nat
. '	reflist	f	ref → reflist
. '	list	f	elem → list
. * .	nat-mult	f	nat × nat → nat
. * .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. + .	nat-basic	f	nat × nat → nat
. + .	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
. ++ .	reflist	f	reflist × ref → reflist
. ++ .	refset	f	refset × ref → refset
. ++ .	list-dup	f	list × elem → list
. ++ .	heap	f	heap × ref → heap
. +1	nat-basic	f	nat → nat
. +2 .	list	f	elem × elem → list
. +2 .	reflist	f	ref × ref → reflist
. - .	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
. -1l .	list-del	f	list × elem → list
. -l .	list-del	f	list × elem → list
. -p .	list-del	f	list × nat → list
. .butlast	reflist	pf	reflist → reflist with λ rx. rx ≠ []
. .butlast	list-last	pf	list → list with λ x. x ≠ []
. .head	list-data	pf	list → elem with λ x. x ≠ []
. .head	reflist	pf	reflist → ref with λ rx. rx ≠ []
. .last	reflist	pf	reflist → ref with λ rx. rx ≠ []
. .last	list-last	pf	list → elem with λ x. x ≠ []
. .nxt	cell	f	cell → ref
. .nxt:= .	cell	f	cell × ref → cell
. .tail	reflist	pf	reflist → reflist with λ rx. rx ≠ []
. .tail	list-data	pf	list → list with λ x. x ≠ []
. .val	cell	f	cell → elem
. .val:= .	cell	f	cell × elem → cell
. < .	reflist	p	reflist × reflist
. < .	list-data	p	list × list
. < .	nat-basic	p	nat × nat
. => .	cell-heap	f	ref × cell → heap → bool
. =>?	maplet	f	ref → heap → bool
. =>_	maplet	f	ref → heap → bool
. > .	nat	p	nat × nat
. [ . ]	list-del	pf	list × nat × elem → list with λ x, n, a. n < # x
. [ . ]	list-del	pf	list × nat → elem with λ x, n. n < # x
. [ . ]	cell-heap	f	heap × ref → cell
. [ . ]	cell-heap	f	heap × ref × cell → heap
. \ .	heap	f	heap × heap → heap
. \ .	refset	f	refset × refset → refset
. \ .	heap	f	heap × refset → heap
. × .	cell	f	elem × ref → cell
. ∈ .	reflist	p	ref × reflist
. ∈ .	list	p	elem × list
. ∈ .	refset	p	ref × refset
. ∈ .	heap	p	ref × heap
. ∩ .	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
. ⊆ .	heap	p	heap × heap
. ⊑ .	reflist	p	reflist × reflist
. ⊑ .	list-last	p	list × list
. ⊒ .	reflist	p	reflist × reflist
. ⊒ .	list-last	p	list × list
. ⊗ .	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
[]	list-data	c	list
[]	reflist	c	reflist
_∃ .	del-lists	f	(list → heap → bool) → heap → bool
_∃ .	cell-heap	f	(cell → 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	cell	v	elem
alloc	ops	pr	: ref × heap (nondeterministic nonfunctional)
b	elem	v	elem
butlastn	reflist	pf	nat × reflist → reflist with λ n, rx. n ≤ # rx
butlastn	list-last	pf	nat × list → list with λ n, x. n ≤ # x
bv	heap-sep	v	bool
c	elem	v	elem
caterpillar_add#	caterpillar-asm	pr	elem × nat : list × nat × list (nonfunctional)
caterpillar_get#	caterpillar-asm	pr	nat × list × list : : list
caterpillar_init#	caterpillar-asm	pr	nat : : nat × list × nat × list
ce	cell	v	cell
ce0	cell	v	cell
ce1	cell	v	cell
ceP	cell-heap	v	cell → heap → bool
cell	cell	s
del-list	del-lists	f	reflist × nat → heap → bool
disj	reflist	p	reflist × reflist
disj	list-dup	p	list × list
dropn	list-prefixn	f	nat × list → list
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
firstn	list-del	pf	nat × list → list with λ n, x. n ≤ # x
free	ops	pr	ref : heap (nonfunctional)
frome	list-del	f	list × elem → list
h	implementation-asm	v	nat
heap	heap	s
ite	heap-sep	f	bool × (heap → bool) × (heap → bool) → heap → bool
lastn	list-del	pf	nat × list → list with λ n, x. n ≤ # x
list	list-data	s
ll-trav	linked-list-seg	f	ref × ref × ref × list → heap → bool
ll-trav	linked-list-seg	f	ref × ref × list → heap → bool
lls	linked-list-seg	f	ref × ref × list → heap → bool
ls	linked-list	f	ref × list → heap → bool
m	nat-basic	v	nat
mklist	list-last	f	elem × nat → list
mklist	reflist	f	ref × nat → reflist
n	nat-basic	v	nat
n0	nat-basic	v	nat
n1	nat-basic	v	nat
nat	nat-basic	s
not .	heap-sep	f	(heap → bool) → heap → bool
null	ref	c	ref
pos	list-del	f	elem × list → nat
precise	heap-sep	p	(heap → bool)
prefixn	list-prefixn	f	nat × list → list
r	ref	v	ref
r0	ref	v	ref
r1	ref	v	ref
r2	linked-list-seg	v	ref
rP	maplet	v	ref → heap → bool
read	cell-heap	pr	ref × heap : cell
ref	ref	s
reflist	reflist	s
refset	refset	s
restn	list-del	pf	nat × list → list with λ n, x. n ≤ # x
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
rxs	implementation-asm	v	ref
ry	reflist	v	reflist
rys	implementation-asm	v	ref
rz	reflist	v	reflist
slice	list-prefixn	f	nat × nat × list → list
sublist	list-del	pf	nat × nat × list → list with λ n, m, x. n + m ≤ # x
to_delete	implementation-asm	v	reflist
tree_buffer_heap_add#	implementation-asm	pr	elem × nat : heap × ref × ref × nat × reflist (nondeterministic nonfunctional)
tree_buffer_heap_get#	implementation-asm	pr	heap × ref × ref × nat : : list
tree_buffer_heap_init#	implementation-asm	pr	nat : : heap × ref × ref × nat × nat × reflist
tree_buffer_heap_process_one#	implementation-asm	pr	: heap × reflist (nonfunctional)
tree_buffer_heap_process_queue#	implementation-asm	pr	: heap × reflist (nonfunctional)
true	heap-sep	p	heap
write	cell-heap	pr	ref × cell : heap (nonfunctional)
x	list-data	v	list
x0	list-data	v	list
x1	list-data	v	list
xP	del-lists	v	list → heap → bool
xs	caterpillar-asm	v	list
xs_len	implementation-asm	v	nat
y	list-data	v	list
ys	caterpillar-asm	v	list
z	list-data	v	list