[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
# .	list-data	f	list → nat
. '	list	f	elem → list
. * .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. + .	nat-basic	f	nat × nat → nat
. + .	list-data	f	elem × list → list
. + .	list	f	list × list → list
. + .	list	f	list × elem → list
. ++ .	refset	f	refset × ref → refset
. ++ .	heap	f	heap × ref → heap
. ++ .	list-dup	f	list × elem → list
. +1	nat-basic	f	nat → nat
. +2 .	list	f	elem × elem → list
. - .	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
. .butlast	list-last	pf	list → list with λ x. x ≠ []
. .head	list-data	pf	list → elem with λ x. x ≠ []
. .last	list-last	pf	list → elem with λ x. x ≠ []
. .nxt	cell	f	cell → ref
. .nxt:= .	cell	f	cell × ref → cell
. .tail	list-data	pf	list → list with λ x. x ≠ []
. .val	cell	f	cell → elem
. .val:= .	cell	f	cell × elem → cell
. < .	nat-basic	p	nat × nat
. < .	list-data	p	list × list
. => .	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 × refset → heap
. \ .	heap	f	heap × heap → heap
. × .	cell	f	elem × ref → cell
. ∈ .	refset	p	ref × refset
. ∈ .	heap	p	ref × heap
. ∈ .	list	p	elem × list
. ∩ .	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
. ⊆ .	refset	p	refset × refset
. ⊆ .	heap	p	heap × heap
. ⊆ .	heap-sep	p	(heap → bool) × (heap → bool)
. ⊑ .	list-last	p	list × list
. ⊒ .	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
_∃ .	maplet	f	(ref → heap → bool) → heap → bool
_∃ .	maplet	f	(ref × ref → heap → bool) → heap → bool
_∃ .	cell-heap	f	(cell → 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
True	separation	p	bool
a	linked-list-seg	v	elem
alloc	ops	pr	: ref × heap (nondeterministic)
alloc#	ops	pr	refset : ref × heap (nondeterministic)
b	linked-list-seg	v	elem
butlastn	list-last	pf	nat × list → list with λ n, x. n ≤ # x
ce	linked-list-seg	v	cell
cell	cell	s
disj	list-dup	p	list × list
dom .	heap	f	heap → refset
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
free	ops	pr	ref : heap
h	linked-list-seg	v	heap
hP	linked-list-seg	v	heap → bool
heap	heap	s
ite	heap-sep	f	bool × (heap → bool) × (heap → bool) → heap → bool
list	list-data	s
ll-trav	linked-list-seg	f	ref × ref × list → heap → bool
ll-trav	linked-list-seg	f	ref × ref × ref × list → heap → bool
lls	linked-list-seg	f	ref × ref × list → heap → bool
ls	linked-list	f	ref × list → heap → bool
mklist	list-last	f	elem × nat → list
nat	nat-basic	s
not .	heap-sep	f	(heap → bool) → heap → bool
null	ref	c	ref
precise	heap-sep	p	(heap → bool)
r	linked-list-seg	v	ref
read	cell-heap	pr	ref × heap : : cell
ref	ref	s
refset	refset	s
rev	list-last	f	list → list
rmdup	list-dup	f	list → list
true	heap-sep	p	heap
write	cell-heap	pr	ref × cell : heap
x	linked-list-seg	v	list
y	linked-list-seg	v	list