Thms
action
sets
Sections
AutomataTheory
Doc
lpower
Def
(L
n) == if n=
0
nil else (L
n-1) @ L fi (recursive)
Thm*
Alph:Type, L:Alph*, n:
. (L
n)
Alph*
append
Def
as @ bs == Case of as; nil
bs ; a.as'
a.(as' @ bs) (recursive)
Thm*
T:Type, as,bs:T*. (as @ bs)
T*
eq_int
Def
i=
j == if i=j
true
; false
fi
Thm*
i,j:
. i=
j
About: