Thms list 3 autom Sections AutomataTheory Doc

lshort Def LShort(l) == Case of l; nil nil ; h.l' h.(LShort(l') \ h) (recursive)

Thm* St:Type, l:St*, eq:(StSt). LShort(l) St*

lremove Def l \ a == Case of l; nil nil ; h.l' if eq(a,h) l' \ a else h.(l' \ a) fi (recursive)

Thm* St:Type, l:St*, s:St, eq:(StSt). (l \ s) St*

About:
recursive_def_notice!abstractionlist_indnilifthenelseapplycons
alluniverselistfunctionboolmember