PrintForm
Definitions
grammar
1
Sections
AutomataTheory
Doc
At:
derive
refl
V,T:Type, G:Grammar(V;T), l:(V+T)*. l
l
By:
Unfold `derive` 0
THEN
Reduce 0
Generated subgoal:
1
1.
V:
Type
2.
T:
Type
3.
G:
Grammar(V;T)
4.
l:
(V+T)*
a:((V+T)* List
). l = a[0] & (
i:
(||a||-1). a[i]
a[(i+1)]) & a[(||a||-1)] = l
About: