n
T
T:Type. array(T) 
Type
1 else 0 fi | i < |a|)
} == {k:
| i 
k < j }m,n:. {m..n} TypeB == 
B < Ai,j:. (ij) Prop
x,n. n+f(x))n:, f:(n). sum(f(x) | x < n) | Some definitions of interest. | |
| array | Def array(T) == n:nT |
| Thm* T:Type. array(T) Type | |
| array-count | Def array-count(v.P(v);a) == sum(if P(a[i]) 1 else 0 fi | i < |a|) |
| array-length | Def |a| == 1of(a) |
| array-select | Def a[i] == 2of(a)(i) |
| int_seg | Def {i..j} == {k:| i k < j } |
| Thm* m,n:. {m..n} Type | |
| le | Def AB == B < A |
| Thm* i,j:. (ij) Prop | |
| sum | Def sum(f(x) | x < k) == primrec(k;0;x,n. n+f(x)) |
| Thm* n:, f:(n). sum(f(x) | x < n) |
About:
 |  |  |  |  |  |  |
 |  |  |  |  |  |  |  |