[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
# .node-indexfkey-set → nat
# .node-indexfnode-index → nat
# .stringfstring → nat
. 'stringfchar → string
. + .nat-basicfnat × nat → nat
. + .stringfchar × string → string
. + .stringfstring × char → string
. + .stringfstring × string → string
. ++ .node-indexfkey-set × key → key-set
. ++ .stringfstring × char → string
. +1nat-basicfnat → nat
. +2 .stringfchar × char → string
. - .natpfnat × nat → nat with λ n, m. n ≥ m
. -- .node-indexfnode-index × key → node-index
. -- .node-indexfkey-set × key → key-set
. -1nat-basicpfnat → nat with λ n. n ≠ 0
. -1l .stringfstring × char → string
. -l .stringfstring × char → string
. -p .stringfstring × nat → string
. .butlaststringpfstring → string with λ str. str ≠ ""
. .char1stringpfstring → char with λ str. str ≠ ""
. .data?keypkey
. .dentry?keypkey
. .inokeyfkey → nat
. .ino:= .keyfkey × nat → key
. .inode?keypkey
. .laststringpfstring → char with λ str. str ≠ ""
. .namekeypfkey → string with λ key. key.dentry?
. .name:= .keypfkey × string → key with λ key, str. key.dentry?
. .partkeypfkey → nat with λ key. key.data?
. .part:= .keypfkey × nat → key with λ key, m. key.data?
. .rstringstringpfstring → string with λ str. str ≠ ""
. < .nat-basicpnat × nat
. > .natpnat × nat
. [ . ]node-indexpfnode-index × key → address with λ ri, key. key ∈ ri
. [ . ]stringpfstring × nat × char → string with λ str, n, char. n < # str
. [ . ]stringpfstring × nat → char with λ str, n. n < # str
. [ . ]node-indexfnode-index × key × address → node-index
. \ .node-indexfkey-set × key-set → key-set
. \ .node-indexfnode-index × key-set → node-index
. | .node-indexfnode-index × key-set → node-index
. ∈ .node-indexpaddress × node-index
. ∈ .node-indexpkey × key-set
. ∈ .node-indexpkey × node-index
. ∈ .stringpchar × string
. ∩ .node-indexfkey-set × key-set → key-set
. ∪ .node-indexfkey-set × key-set → key-set
. ≤ .natpnat × nat
. ≥ .natpnat × nat
. ⊆ .node-indexpkey-set × key-set
. ⊆ .node-indexpnode-index × node-index
. ⊑ .stringpstring × string
. ⊒ .stringpstring × string
. ⊕ .node-indexfnode-index × node-index → node-index
{ . }node-indexfkey → key-set
∅node-indexcnode-index
∅node-indexckey-set
⊏stringpstring × string
addressaddresss
adraddressvaddress
adr0addressvaddress
adr1addressvaddress
adr2addressvaddress
adr3addressvaddress
adr4addressvaddress
adr5addressvaddress
butlastnstringpfnat × string → string with λ n, str. n ≤ # str
charchars
charcharvchar
char0charvchar
char1charvchar
char2charvchar
datakeykeyfnat × nat → key
dentrykeykeyfnat × string → key
disjstringpstring × string
dom .node-indexfnode-index → key-set
dupsstringpstring
fillfirststringfnat × char × string → string
firstnstringpfnat × string → string with λ n, str. n ≤ # str
fromestringfstring × char → string
inodekeykeyfnat → key
keykeys
keykeyvkey
key-setnode-indexs
key0node-indexvkey
key1node-indexvkey
ksnode-indexvkey-set
ks0node-indexvkey-set
ks1node-indexvkey-set
ks2node-indexvkey-set
lastnstringpfnat × string → string with λ n, str. n ≤ # str
mnat-basicvnat
m0keyvnat
m1keyvnat
m2keyvnat
mkliststringfchar × nat → string
nnat-basicvnat
n0nat-basicvnat
n1nat-basicvnat
natnat-basics
node-indexnode-indexs
posstringfchar × string → nat
restnstringpfnat × string → string with λ n, str. n ≤ # str
revstringfstring → string
rinode-indexvnode-index
ri0node-indexvnode-index
ri1node-indexvnode-index
ri2node-indexvnode-index
rmdupstringfstring → string
strstringvstring
str0stringvstring
str1stringvstring
str2stringvstring
str3stringvstring
stringstrings
subliststringpfnat × nat × string → string with λ n, m, str. n + m ≤ # str