} == {k:
| i 
k < j }
m,n:. {m..n} 
Type
== {i:| 0i } TypeB == 
B<Ai,j:. (ij) Prop} == if n
m
nil else f(m).f{(m+1)..n} fi (recursive)T:Type, m,n:, f:({m..n}
T). f{m..n} T Listj == j<ii,j:. (ij) 
| 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 | |
| listify | } == if nm nil else f(m).f{(m+1)..n} fi (recursive) |
| T:Type, m,n:, f:({m..n}T). f{m..n} T List | |
| le_int | j == j<i |
| i,j:. (ij) |
About:
 |  |  |  |  |  |  |  |  |  |
 |  |  |  |  |  |  |  |