[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
# .list-dataflist → nat
# .streamfstream → natinf
# .set-basicfset → nat
. 'listfelem → list
. + .nat-basicfnat × nat → nat
. + .list-datafelem × list → list
. + .listflist × list → list
. + .listflist × elem → list
. + .nat-inffnatinf × natinf → natinf
. + .streamfelem × stream → stream
. + .streamfstream × stream → stream
. ++ .list-dupflist × elem → list
. ++ .set-basicfset × elem → set
. +1nat-basicfnat → nat
. +2 .listfelem × elem → list
. - .natpfnat × nat → nat with λ n, m. n ≥ m
. -- .set-unionfset × elem → set
. -1nat-basicpfnat → nat with λ n. n ≠ 0
. -1l .list-delflist × elem → list
. -l .list-delflist × elem → list
. -p .list-delflist × nat → list
. .butlastlist-lastpflist → list with λ x. x ≠ []
. .fstream-basicpfstream → nat → elem with λ σ. λ m. ∃ nf. σ = ⌜nf⌝
. .headlist-datapflist → elem with λ x. x ≠ []
. .lstream-basicpfstream → list with λ σ. finp(σ)
. .lastlist-lastpflist → elem with λ x. x ≠ []
. .nnat-infpfnatinf → nat with λ n∞. n∞ ≠ ∞
. .taillist-datapflist → list with λ x. x ≠ []
. < .nat-basicpnat × nat
. < .list-dataplist × list
. < .nat-infpnatinf × natinf
. > .natpnat × nat
. [ . ]list-delpflist × nat → elem with λ x, n. n < # x
. [ . ]list-delpflist × nat × elem → list with λ x, n, a. n < # x
. [ . ]streampfstream × nat → elem with λ σ, n. finp(σ) → ⌜n⌝ < # σ
. [ . ]streampfstream × nat × elem → stream with λ σ, n, a. finp(σ) → ⌜n⌝ < # σ
. \ .set-unionfset × set → set
. × .infgraph-gen-basicf(elem → bool) × (elem × elem → bool) → graph
. ∈ .listpelem × list
. ∈ .set-basicpelem × set
. ∩ .set-unionfset × set → set
. ∪ .set-unionfset × set → set
. ≤ .natpnat × nat
. ≤ .streampstream × stream
. ≥ .natpnat × nat
. ⊆ .set-basicpset × set
. ⊑ .list-lastplist × list
. ⊒ .list-lastplist × list
. from .streamf(nat → elem) × nat → nat → elem
. from .streampfstream × nat → stream with λ σ, n. finp(σ) → ⌜n⌝ < # σ ∨ ⌜n⌝ = # σ
. from .streampflist × nat → list with λ x, n. n ≤ # x
. to .streamf(nat → elem) × nat → list
. to .streampfstream × nat → stream with λ σ, n. finp(σ) → ⌜n⌝ < # σ ∨ ⌜n⌝ = # σ
. to .streampflist × nat → list with λ x, n. n ≤ # x
. to∞ .streampfstream × natinf → stream with λ σ, n∞. finp(σ) → n∞ < # σ ∨ n∞ = # σ
[]list-dataclist
[]streamcstream
{ . }set-unionfelem → set
∅set-basiccset
∞nat-infcnatinf
⌜ . ⌝stream-basicflist → stream
⌜ . ⌝stream-basicf(nat → elem) → stream
⌜ . ⌝nat-inffnat → natinf
butlastnlist-lastpfnat × list → list with λ n, x. n ≤ # x
disjlist-dupplist × list
dominfgraph-gen-basicfgraph → elem → bool
dupslist-dupplist
edgeinfgraph-gen-basicfgraph → elem × elem → bool
elemelems
fillfirstlist-lastfnat × elem × list → list
findepthfinitedepth-trees-genpgraph
finpstream-basicpstream
firstnlist-delpfnat × list → list with λ n, x. n ≤ # x
fromelist-delflist × elem → list
gfinitedepth-trees-genvgraph
graphinfgraph-gen-basics
hdstreampfstream → elem with λ σ. σ ≠ []
isrootinfgraph-genfgraph → elem → bool
lastnlist-delpfnat × list → list with λ n, x. n ≤ # x
listlist-datas
lsfinitedepth-trees-genfgraph → elem × elem → bool
minnat-inffnatinf × natinf → natinf
mklistlist-lastfelem × nat → list
natnat-basics
natinfnat-infs
nocyclefinitedepth-trees-genpgraph
pathinfgraph-genfgraph → elem × elem → bool
pathpinfgraph-genfgraph → stream → bool
poslist-delfelem × list → nat
restnlist-delpfnat × list → list with λ n, x. n ≤ # x
revlist-lastflist → list
rmduplist-dupflist → list
rootedfinitedepth-trees-genpgraph
setset-basics
streamstream-basics
sublistlist-delpfnat × nat × list → list with λ n, m, x. n + m ≤ # x
tlstreampfstream → stream with λ σ. σ ≠ []
treepfinitedepth-trees-genpgraph
xfinitedepth-trees-genvlist
yfinitedepth-trees-genvlist