Thms grammar 1 Sections AutomataTheory Doc

list_p Def T List == {l:(T*)| ||l|| > 0 }

Thm* T:Type. (T List) Type

length Def ||as|| == Case of as; nil 0 ; a.as' ||as'||+1 (recursive)

Thm* A:Type, l:A*. ||l||

Thm* ||nil||

gt Def i > j == j < i

Thm* i,j:. i > j Prop

About:
!abstractionless_thanallintmemberproprecursive_def_notice
list_indnatural_numberadduniverselistnilset