Thms exponent Sections AutomataTheory Doc

en Def en(l) == if null(l) 0 else hd(l)+en(tl(l))n fi (recursive)

Thm* n:, l:n*. en(l)

tl Def tl(l) == Case of l; nil nil ; h.t t

Thm* A:Type, l:A*. tl(l) A*

hd Def hd(l) == Case of l; nil "?" ; h.t h

Thm* A:Type, l:A*. ||l||1 hd(l) A

null Def null(as) == Case of as; nil true ; a.as' false

Thm* T:Type, as:T*. null(as)

Thm* null(nil)

About:
!abstractionlist_indbtruebfalsealluniverse
listmemberboolniltokenimplies
natural_numberrecursive_def_noticeifthenelseaddmultiply