Thms
nfa
1
Sections
AutomataTheory
Doc
map
Def
map(f;as) == Case of as; nil
nil ; a.as'
f(a).map(f;as') (recursive)
Thm*
A,B:Type, f:(A
B), l:A*. map(f;l)
B*
About:
nil ; a.as' f(a).map(f;as') (recursive)
A,B:Type, f:(A
B), l:A*. map(f;l) 
B* nil ; a.as' f(a).map(f;as') (recursive)
