} == {k:
| i 
k < j }
m,n:. {m..n} 
Type
== {i:| 0i } TypeB == 
B<Ai,j:. (ij) Prop
0 ; a.as' ||as'||+1 (recursive)A:Type, l:A List. ||l|| 
0 nil else upto(n-1) @ [(n-1)] fi (recursive)n:. upto(n) n List| Some definitions of interest. | |
| int_seg | } == {k:| i k < j } |
| m,n:. {m..n} Type | |
| nat | == {i:| 0i } |
| Type | |
| le | B == B<A |
| i,j:. (ij) Prop | |
| length | 0 ; a.as' ||as'||+1 (recursive) |
| A:Type, l:A List. ||l|| | |
| | |
| upto | 0 nil else upto(n-1) @ [(n-1)] fi (recursive) |
| n:. upto(n) n List |
About:
 |  |  |  |
 |  |  |  |  |  |  |
 |  |  |  |  |  |