} == {k:
| i 
k < j }
m,n:. {m..n} 
Type
== {i:| 0i } TypeB == 
B < Ai,j:. (ij) Prop
j.if j=
i
L[j]-1 else L[j] fi) 0 ; a.as' ||as'||+1 (recursive)A:Type, l:A List. ||l|| A:Type, l:A List, n:. 0n 
n < ||l|| l[n] A| 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 | |
| le | Def AB == B < A |
| Thm* i,j:. (ij) Prop | |
| list-dec | Def L[i--] == mklist(||L||;j.if j=i L[j]-1 else L[j] fi) |
| length | Def ||as|| == Case of as; nil 0 ; a.as' ||as'||+1 (recursive) |
| Thm* A:Type, l:A List. ||l|| | |
| Thm* ||nil|| | |
| select | Def l[i] == hd(nth_tl(i;l)) |
| Thm* A:Type, l:A List, n:. 0n n < ||l|| l[n] A |
About:
 |  |  |
 |  |  |  |  |  |  |
 |  |  |  |  |  |  |
 |