Thms nfa 1 Sections AutomataTheory Doc

append Def as @ bs == Case of as; nil bs ; a.as' a.(as' @ bs) (recursive)

Thm* T:Type, as,bs:T*. (as @ bs) T*

gt Def i > j == j < i

Thm* i,j:. i > j Prop

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

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

length Def ||as|| == Case of as; nil 0 ; a.as' ||as'||+1 (recursive)

Thm* A:Type, l:A*. ||l||

Thm* ||nil||

About:
recursive_def_notice!abstractionlist_indnatural_numberaddalluniverselist
memberintniltokenimpliesless_thanpropcons