[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,

Lemma dependency for Specification linked-list

A lemma (entry) may depend on lemmas (entries) below its position, but never on lemmas above its position. This means the list is a topological order of the dependency graph. An entry 'all subs proved' means that all used lemmas are (transitively) proved.

Name:	Status:	Subs proved?	Used:
ls-union	proved	all subs proved	ls-rec, ls-null, ls-base,
ls-null	proved	all subs proved	ls-rec, ls-base,
ls-one	proved	all subs proved	ls-base, ls-rec,
ls-unfold1	proved	all subs proved	ls-rec, ls-base,
ls-fold1	proved	all subs proved	ls-rec,
precise-ls	proved	all subs proved	ls-rec, ls-base,
ls-unfold2	proved	all subs proved	ls-rec,
ls-base	axiom
ls-rec	axiom