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

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-pushprovedall subs proved ls-unique, ls-rec, ls-base,
ls-uniqueprovedall subs proved ls-unique-strng,
ls-unique-strngprovedall subs proved ls-rec, ls-null, ls-base,
owner-lst1provedall subs proved ls-rec, ls-base, ex-lst-shift, lst-rec,
lst-in-hpprovedall subs proved ls-rec, ls-base, ex-lst-shift, lst-rec,
lst-nullprovedall subs proved ls-null, lst-def,
lst-recprovedall subs proved lst-def,
ex-lst-shiftprovedall subs proved ex-lst,
ls-nullprovedall subs proved ls-rec, ls-base,
ls-oneprovedall subs proved ls-base, ls-rec,
owner-ls1provedall subs proved ls-rec, ls-base,
ls-unfold1provedall subs proved ls-rec, ls-base,
ls-fold1provedall subs proved ls-rec,
precise-lsprovedall subs proved ls-rec, ls-base,
ls-unfold2provedall subs proved ls-rec,
ex-lstaxiom
lst-defaxiom
ls-baseaxiom
ls-recaxiom