} == {k:
| i 
k < j }
m,n:. {m..n} 
Type
== {i:| 0i } TypeA:Type, l:A List, n:. 0n 
n < ||l|| l[n] A
j
[i / upto(i+1;j)] else nil fi (recursive)i,j:. upto(i;j) {i..j} List| Some definitions of interest. | |
| int_seg | Def {i..j} == {k:| i k < j } |
| Thm* m,n:. {m..n} Type | |
| nat | Def == {i:| 0i } |
| Thm* Type | |
| select | Def l[i] == hd(nth_tl(i;l)) |
| Thm* A:Type, l:A List, n:. 0n n < ||l|| l[n] A | |
| upto | Def upto(i;j) == if i < j [i / upto(i+1;j)] else nil fi (recursive) |
| Thm* i,j:. upto(i;j) {i..j} List |
About:
 |  |  |  |  |  |  |  |
 |  |  |  |  |  |
 |