[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
# .	path	f	path → nat
. '	path	f	string → path
. '	string	f	char → string
. + .	nat-basic	f	nat × nat → nat
. + .	path	f	path × string → path
. + .	string	f	char × string → string
. + .	path	f	path × path → path
. + .	string	f	string × string → string
. + .	path	f	string × path → path
. + .	string	f	string × char → string
. ++ .	path	f	path × string → path
. ++ .	string	f	string × char → string
. +1	nat-basic	f	nat → nat
. +2 .	string	f	char × char → string
. +2 .	path	f	string × string → path
. - .	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
. -1l .	path	f	path × string → path
. -l .	string	f	string × char → string
. -l .	path	f	path × string → path
. -p .	string	f	string × nat → string
. -p .	path	f	path × nat → path
. .butlast	string	pf	string → string with λ str. str ≠ ""
. .char1	string	pf	string → char with λ str. str ≠ ""
. .head	path	pf	path → string with λ p. p ≠ ε
. .last	path	pf	path → string with λ p. p ≠ ε
. .last	string	pf	string → char with λ str. str ≠ ""
. .rstring	string	pf	string → string with λ str. str ≠ ""
. .tail	path	pf	path → path with λ p. p ≠ ε
. < .	nat-basic	p	nat × nat
. < .	path	p	path × path
. > .	nat	p	nat × nat
. [ . ]	path	pf	path × nat × string → path with λ p, n, str. n < # p
. [ . ]	path	pf	path × nat → string with λ p, n. n < # p
. [ . ]	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
. ∈ .	path	p	string × path
. ≤ .	nat	p	nat × nat
. ≥ .	nat	p	nat × nat
. ⊑ .	path	p	path × path
. ⊑ .	string	p	string × string
. ⊒ .	path	p	path × path
. ⊒ .	string	p	string × string
ε	path	c	path
⊏	string	p	string × string
butlastn	path	pf	nat × path → path with λ n, p. n ≤ # p
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
disj	path	p	path × path
disj	string	p	string × string
dups	string	p	string
dups	path	p	path
fillfirst	string	f	nat × char × string → string
fillfirst	path	f	nat × string × path → path
firstn	path	pf	nat × path → path with λ n, p. n ≤ # p
firstn	string	pf	nat × string → string with λ n, str. n ≤ # str
frome	string	f	string × char → string
frome	path	f	path × string → path
lastn	path	pf	nat × path → path with λ n, p. n ≤ # p
lastn	string	pf	nat × string → string with λ n, str. n ≤ # str
m	nat-basic	v	nat
md	metadata	v	metadata
meta	permission-param	f	path × state → metadata
metadata	metadata	s
mklist	string	f	char × nat → string
mkpath	path	f	string × nat → path
n	nat-basic	v	nat
n0	nat-basic	v	nat
n1	nat-basic	v	nat
nat	nat-basic	s
p	path	v	path
p'	path	v	path
p0	path	v	path
p1	path	v	path
parent	path	pf	path → path with λ p. p ≠ ε
path	path	s
pos	string	f	char × string → nat
pos	path	f	string × path → nat
pr	permission	p	user × metadata
pw	permission	p	user × metadata
px	permission	p	user × metadata
q	path	v	path
restn	path	pf	nat × path → path with λ n, p. n ≤ # p
restn	string	pf	nat × string → string with λ n, str. n ≤ # str
rev	path	f	path → path
rev	string	f	string → string
rmdup	string	f	string → string
rmdup	path	f	path → path
st	permission-param	v	state
state	permission-param	s
str	string	v	string
str0	string	v	string
str1	string	v	string
str2	string	v	string
str3	string	v	string
string	string	s
sublist	path	pf	nat × nat × path → path with λ n, m, p. n + m ≤ # p
sublist	string	pf	nat × nat × string → string with λ n, m, str. n + m ≤ # str
user	user	s
user	user	v	user