[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
# .	branch-array	f	branch-array → 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
. ++ .	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
. -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
. .branches	indexnode	f	index-node → branch-array
. .branches:= .	indexnode	f	index-node × branch-array → index-node
. .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 ≠ ""
. .leaf	indexnode	p	index-node
. .leaf:= .	indexnode	f	index-node × bool → index-node
. .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 ≠ ""
. .usedsize	indexnode	f	index-node → nat
. .usedsize:= .	indexnode	f	index-node × nat → index-node
. / .	nat-div	pf	nat × nat → nat with λ n, m. m ≠ 0
. < .	nat-basic	p	nat × nat
. > .	nat	p	nat × nat
. [ . ]	branch-array	pf	branch-array × nat × branch → branch-array with λ brar, n, br. n < # brar
. [ . ]	branch-array	pf	branch-array × nat → branch with λ brar, n. n < # brar
. [ . ]	string	pf	string × nat × char → string with λ str, n, char. n < # str
. [ . ]	string	pf	string × nat → char with λ str, n. n < # str
. ∈ .	string	p	char × string
. ∈ .	branch-array	p	branch × branch-array
. ≤ .	nat	p	nat × nat
. ≥ .	nat	p	nat × nat
. ⊑ .	string	p	string × string
. ⊒ .	string	p	string × string
⊏	string	p	string × string
ADR_DUMMY	constants	c	address
BRANCH_SIZE	constants	c	nat
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	indexnode	v	bool
boolvar0	indexnode	v	bool
br	branch	v	branch
br0	branch-array	v	branch
br1	branch-array	v	branch
branch	branch	s
branch-array	branch-array	s
brar	branch-array	v	branch-array
brar0	branch-array	v	branch-array
brar1	branch-array	v	branch-array
brar2	branch-array	v	branch-array
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
cmp	branch-array	pp	branch-array × branch × nat × nat with λ brar, br, m, n. m + n ≤ # brar
cmp	branch-array	pp	branch-array × nat × branch-array × nat × nat with λ brar, m, brar0, m0, n. m + n ≤ # brar ∧ m0 + n ≤ # brar0
copy	branch-array	pf	branch-array × nat × branch-array × nat × nat → branch-array with λ brar, m, brar0, m0, n. m + n ≤ # brar ∧ m0 + n ≤ # brar0
datakey	key	f	nat × nat → key
dentrykey	key	f	nat × string → key
disj	string	p	string × string
dups	string	p	string
fill	branch-array	pf	branch-array × branch × nat × nat → branch-array with λ brar, br, n, m. n + m ≤ # brar
fill	branch-array	f	branch-array × branch → branch-array
fillfirst	string	f	nat × char × string → string
firstn	string	pf	nat × string → string with λ n, str. n ≤ # str
frome	string	f	string × char → string
id○	branch-array	p	branch-array × branch-array × nat
idrange	branch-array	pp	branch-array × nat × nat with λ brar, m, n. m + n ≤ # brar
ind	indexnode	v	index-node
index-node	indexnode	s
indexnode	indexnode	f	branch-array × bool × nat → index-node
inodekey	key	f	nat → key
is-aligned	align	p	nat × nat
key	key	s
key	key	v	key
key0	branch	v	key
lastn	string	pf	nat × string → string with λ n, str. n ≤ # str
m	nat-basic	v	nat
m0	array-copy	v	nat
m1	key	v	nat
m2	key	v	nat
mkbranch	branch	f	key × address → branch
mkbrarray	branch-array	f	nat → branch-array
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
pos	string	f	char × string → nat
restn	string	pf	nat × string → string with λ n, str. n ≤ # str
rev	branch-array	pf	branch-array × nat → branch-array with λ brar, n. n ≤ # brar
rev	branch-array	f	branch-array → branch-array
rev	string	f	string → string
rmdup	string	f	string → string
str	string	v	string
str0	string	v	string
str1	string	v	string
str2	string	v	string
str3	string	v	string
string	string	s
subarray	branch-array	pf	branch-array × nat × nat → branch-array with λ brar, m, n. m + n ≤ # brar
sublist	string	pf	nat × nat × string → string with λ n, m, str. n + m ≤ # str