[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
# .	string	f	string → nat
# .	node-index	f	key-set → nat
# .	node-index	f	node-index → nat
. % .	nat-div	pf	nat × nat → nat with λ n, m. m ≠ 0
. '	string	f	char → string
. * .	nat-mult	f	nat × nat → nat
. + .	nat-basic	f	nat × nat → nat
. + .	string	f	char × string → string
. + .	string	f	string × char → string
. + .	string	f	string × string → string
. ++ .	node-index	f	key-set × key → key-set
. ++ .	string	f	string × char → string
. +1	nat-basic	f	nat → nat
. +2 .	string	f	char × char → string
. - .	nat	pf	nat × nat → nat with λ n, m. n ≥ m
. -- .	node-index	f	node-index × key → node-index
. -- .	node-index	f	key-set × key → key-set
. -1	nat-basic	pf	nat → nat with λ n. n ≠ 0
. -1l .	string	f	string × char → string
. -l .	string	f	string × char → string
. -p .	string	f	string × nat → string
. .adr	branch	f	branch → address
. .adr:= .	branch	f	branch × address → branch
. .branch?	branch	p	branch
. .butlast	string	pf	string → string with λ str. str ≠ ""
. .char1	string	pf	string → char with λ str. str ≠ ""
. .data?	key	p	key
. .dentry?	key	p	key
. .entry?	branch	p	branch
. .ino	key	f	key → nat
. .ino:= .	key	f	key × nat → key
. .inode?	key	p	key
. .key	branch	f	branch → key
. .key:= .	branch	f	branch × key → branch
. .last	string	pf	string → char with λ str. str ≠ ""
. .name	key	pf	key → string with λ key. key.dentry?
. .name:= .	key	pf	key × string → key with λ key, str. key.dentry?
. .part	key	pf	key → nat with λ key. key.data?
. .part:= .	key	pf	key × nat → key with λ key, m. key.data?
. .rstring	string	pf	string → string with λ str. str ≠ ""
. / .	nat-div	pf	nat × nat → nat with λ n, m. m ≠ 0
. < .	nat-basic	p	nat × nat
. < .	key-order-def	p	key × key
. < .	string-less	p	char × char
. < .	string-less	p	string × string
. > .	nat	p	nat × nat
. [ . ]	node-index	pf	node-index × key → address with λ ri, key. key ∈ ri
. [ . ]	string	pf	string × nat × char → string with λ str, n, char. n < # str
. [ . ]	node-index	f	node-index × key × address → node-index
. [ . ]	string	pf	string × nat → char with λ str, n. n < # str
. \ .	node-index	f	key-set × key-set → key-set
. \ .	node-index	f	node-index × key-set → node-index
. \| .	node-index	f	node-index × key-set → node-index
. \|> .	node-index-restrict	f	node-index × key → node-index
. \|≤ .	node-index-restrict	f	node-index × key → node-index
. ∈ .	node-index	p	address × node-index
. ∈ .	node-index	p	key × key-set
. ∈ .	node-index	p	key × node-index
. ∈ .	string	p	char × string
. ∩ .	node-index	f	key-set × key-set → key-set
. ∪ .	node-index	f	key-set × key-set → key-set
. ≤ .	nat	p	nat × nat
. ≥ .	nat	p	nat × nat
. ⊆ .	node-index	p	key-set × key-set
. ⊆ .	node-index	p	node-index × node-index
. ⊑ .	string	p	string × string
. ⊒ .	string	p	string × string
. ⊕ .	node-index	f	node-index × node-index → node-index
{ . }	node-index	f	key → key-set
∅	node-index	c	node-index
∅	node-index	c	key-set
⊏	string	p	string × string
ADR_DUMMY	constants	c	address
BRANCH_SIZE	constants	c	nat
Boolvar	key-order	v	bool,flexible
MIN_SIZE	constants	c	nat
address	address	s
adr	address	v	address
adr0	address	v	address
adr1	address	v	address
adr2	address	v	address
adr3	address	v	address
adr4	address	v	address
adr5	address	v	address
align↑	align	f	nat × nat → nat
align↓	align	f	nat × nat → nat
boolvar	key-order	v	bool
boolvar0	key-order	v	bool
boolvar1	key-order	v	bool
br	branch	v	branch
branch	branch	s
butlastn	string	pf	nat × string → string with λ n, str. n ≤ # str
char	char	s
char	char	v	char
char0	char	v	char
char1	char	v	char
char2	char	v	char
char3	string-less	v	char
datakey	key	f	nat × nat → key
dentrykey	key	f	nat × string → key
disj	string	p	string × string
dom .	node-index	f	node-index → key-set
dups	string	p	string
fillfirst	string	f	nat × char × string → string
firstn	string	pf	nat × string → string with λ n, str. n ≤ # str
frome	string	f	string × char → string
ino	key-order-def	v	nat
inodekey	key	f	nat → key
is-aligned	align	p	nat × nat
key	key	s
key	key	v	key
key-set	node-index	s
key0	node-index	v	key
key1	node-index	v	key
ks	node-index	v	key-set
ks0	node-index	v	key-set
ks1	node-index	v	key-set
ks2	node-index	v	key-set
lastn	string	pf	nat × string → string with λ n, str. n ≤ # str
m	nat-basic	v	nat
m0	key	v	nat
m1	key	v	nat
m2	key	v	nat
mkbranch	branch	f	key × address → branch
mkentry	branch	f	key × address → branch
mklist	string	f	char × nat → string
n	nat-basic	v	nat
n0	nat-basic	v	nat
n1	nat-basic	v	nat
nat	nat-basic	s
node-index	node-index	s
pos	string	f	char × string → nat
restn	string	pf	nat × string → string with λ n, str. n ≤ # str
rev	string	f	string → string
ri	node-index	v	node-index
ri0	node-index	v	node-index
ri1	node-index	v	node-index
ri2	node-index	v	node-index
rmdup	string	f	string → string
sortedchars	string-less	c	string
str	string	v	string
str0	string	v	string
str1	string	v	string
str2	string	v	string
str3	string	v	string
string	string	s
sublist	string	pf	nat × nat × string → string with λ n, m, str. n + m ≤ # str