)
(V+T)*)*V
Thm* 
V,T:Type{i}. Grammar(V;T) 
Type{i'}
== {l:(T*)| ||l|| > 0 }
Thm* T:Type. (T List) Type
0 ; a.as' ||as'||+1 (recursive)
Thm* A:Type, l:A*. ||l|| 
Thm* ||nil||
Thm* i,j:. i > j Prop
| grammar |
Def Grammar(V;T) == ((V+T List)(V+T)*)*V
Thm* |
| list_p |
Def T List == {l:(T*)| ||l|| > 0 }
Thm* |
| length |
Def ||as|| == Case of as; nil 0 ; a.as' ||as'||+1 (recursive)
Thm*
Thm* ||nil|| |
| gt |
Def i > j == j < i
Thm* |
About:
 |  |  |  |  |  |  |  |
 |  |  |  |  |  |  |  |