[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
# .	tree	f	tree → nat
# .	list-data	f	list → nat
#oc	list-perm	f	elem × list → nat
. % .	nat-div	pf	nat × nat → nat with λ n, m. m ≠ 0
. '	list	f	elem → list
. * .	heap-sep	f	(heap → bool) × (heap → bool) → heap → bool
. * .	nat-mult	f	nat × nat → nat
. + .	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
. -1l .	list-del	f	list × elem → list
. -l .	list-del	f	list × elem → list
. -p .	list-del	f	list × nat → list
. .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 ≠ []
. .left	node	f	node → ref
. .left	tree	pf	tree → tree with λ t. t ≠ leaf
. .left:= .	node	f	node × ref → node
. .left:= .	tree	pf	tree × tree → tree with λ t, t0. t ≠ leaf
. .right	node	f	node → ref
. .right	tree	pf	tree → tree with λ t. t ≠ leaf
. .right:= .	node	f	node × ref → node
. .right:= .	tree	pf	tree × tree → tree with λ t, t0. t ≠ leaf
. .tail	list-data	pf	list → list with λ x. x ≠ []
. .toList	linked-tree-list	f	tree → list
. .val	node	f	node → elem
. .val	tree	pf	tree → elem with λ t. t ≠ leaf
. .val:= .	node	f	node × elem → node
. .val:= .	tree	pf	tree × elem → tree with λ t, val. t ≠ leaf
. / .	nat-div	pf	nat × nat → nat with λ n, m. m ≠ 0
. < .	nat-basic	p	nat × nat
. < .	oelem	p	elem × elem
. < .	list-data	p	list × list
. => .	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
. [ . ]	list-getput	pf	list × nat → elem with λ x, n. n < # x
. [ . ]	list-getput	pf	list × nat × elem → list with λ x, n, a. n < # x
. \ .	refset	f	refset × refset → refset
. \ .	heap	f	heap × refset → heap
. \ .	heap	f	heap × heap → heap
. \ .	list-set	f	list × list → list
. ^ .	nat-pot	f	nat × nat → nat
. ~ .	linked-tree-list	p	nat × nat
. ∈ .	refset	p	ref × refset
. ∈ .	heap	p	ref × heap
. ∈ .	list	p	elem × list
. ∈ .	linked-tree-list	p	elem × tree
. ∩ .	refset	f	refset × refset → refset
. ∪ .	refset	f	refset × refset → refset
. ∪ .	heap	f	heap × heap → heap
. ∪ .	list-set	f	list × list → list
. ≡ .	separation	p	heap × heap
. ≤ .	nat	p	nat × nat
. ≤ .	linked-tree-list	p	tree × elem
. ≤ .	linked-tree-list	p	elem × tree
. ≥ .	nat	p	nat × nat
. ⊆ .	refset	p	refset × refset
. ⊆ .	heap	p	heap × heap
. ⊆ .	heap-sep	p	(heap → bool) × (heap → bool)
. ⊆ .	list-set	p	list × list
. ⊆m .	list-perm	p	list × list
. ⊑ .	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
_∃ .	node-heap	f	(node → 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
2^ .	nat-pot	f	nat → nat
True	separation	p	bool
a	DLL2BST	v	elem
alloc	ops	pr	: ref × heap (nondeterministic)
alloc#	ops	pr	refset : ref × heap (nondeterministic)
b	DLL2BST	v	elem
balanced	linked-tree-list	p	tree
branch	tree	f	tree × elem × tree → tree
butlastn	list-last	pf	nat × list → list with λ n, x. n ≤ # x
c	DLL2BST	v	elem
count	DLL2BST	v	nat
disj	list-dup	p	list × list
dll	dlinked-list	f	ref × list → heap → bool
dll_to_bst#	DLL2BST	pr	ref : heap : ref
dll_to_bst_iter#	DLL2BST	pr	ref : heap : ref
dll_to_bst_rec#	DLL2BST	pr	ref × nat : heap : ref × ref
dlls	dlinked-list	f	ref × ref × ref × list → heap → bool
dom .	heap	f	heap → refset
dups	list-dup	p	list
elem	elem	s
emp	heap-sep	p	heap
even	nat-even	p	nat
false	heap-sep	p	heap
fillfirst	list-last	f	nat × elem × list → list
filter	list-set	f	list × list → list
firstn	list-del	pf	nat × list → list with λ n, x. n ≤ # x
free	ops	pr	ref : heap
frome	list-del	f	list × elem → list
h	DLL2BST	v	heap
hP	DLL2BST	v	heap → bool
half	DLL2BST	v	nat
head	DLL2BST	v	ref
heap	heap	s
ins≤	olist	f	elem × list → list
ite	heap-sep	f	bool × (heap → bool) × (heap → bool) → heap → bool
k	DLL2BST	v	nat
lastn	list-del	pf	nat × list → list with λ n, x. n ≤ # x
leaf	tree	c	tree
left	DLL2BST	v	ref
list	list-data	s
log	nat-pot	pf	nat × nat → nat with λ m, m0. m0 ≠ 0
log2 .	nat-pot	pf	nat → nat with λ m0. m0 ≠ 0
m	DLL2BST	v	nat
max	nat-even	f	nat × nat → nat
max	olist-min-max	pf	list → elem with λ x. x ≠ []
merge	olist	f	list × list → list
mid	DLL2BST	v	nat
min	nat-even	f	nat × nat → nat
min	olist-min-max	pf	list → elem with λ x. x ≠ []
mklist	list-last	f	elem × nat → list
mknode	node	f	ref × elem × ref → node
n	DLL2BST	v	nat
nat	nat-basic	s
next	DLL2BST	v	ref
node	node	s
not .	heap-sep	f	(heap → bool) → heap → bool
null	ref	c	ref
odd	nat-even	p	nat
ordered<	olist	p	list
ordered≤	olist	p	list
ordered≤	linked-tree-list	p	tree
perm	list-perm	p	list × list
pos	list-del	f	elem × list → nat
precise	heap-sep	p	(heap → bool)
r	DLL2BST	v	ref
read	node-heap	pr	ref × heap : : node
ref	ref	s
refset	refset	s
restn	list-del	pf	nat × list → list with λ n, x. n ≤ # x
rev	list-last	f	list → list
right	DLL2BST	v	ref
rmdup	list-dup	f	list → list
root	DLL2BST	v	ref
size	DLL2BST	v	nat
size#	DLL2BST	pr	ref × heap : : nat
size_iter#	DLL2BST	pr	ref × heap : : nat
sort	olist-sort	f	list → list
sublist	list-del	pf	nat × nat × list → list with λ n, m, x. n + m ≤ # x
t	DLL2BST	v	tree
temp	DLL2BST	v	ref
tr	linked-tree	f	ref × tree → heap → bool
tree	tree	s
true	heap-sep	p	heap
write	node-heap	pr	ref × node : heap
x	DLL2BST	v	list
y	DLL2BST	v	list
z	DLL2BST	v	list