i:
(k-1). f(i)<f(i+1)k:, f:(k
). increasing(f;k) 
Prop
} == {k:| i 
k < j }m,n:. {m..n} Type == {i:| 0i } TypeA:Type, l:A List, n:. 0n 
n<||l|| l[n] A
0
nil else upto(n-1) @ [(n-1)] fi (recursive)n:. upto(n) n List| Some definitions of interest. | |
| increasing | i:(k-1). f(i)<f(i+1) |
| k:, f:(k). increasing(f;k) Prop | |
| int_seg | } == {k:| i k < j } |
| m,n:. {m..n} Type | |
| nat | == {i:| 0i } |
| Type | |
| select | |
| A:Type, l:A List, n:. 0n n<||l|| l[n] A | |
| upto | 0 nil else upto(n-1) @ [(n-1)] fi (recursive) |
| n:. upto(n) n List |
About:
 |  |  |  |  |  |  |
 |  |  |  |  |  |
 |  |  |  |  |  |