n,m:
. firstn(n;upto(m)) ~ if n
m
upto(n) else upto(m) fim:, n:(m+1). upto(m) ~ (upto(n) @ map(
x.x+n;upto(m-n)))L1,L2:Top List, n:(||L1||+1). firstn(n;L1 @ L2) ~ firstn(n;L1)n:. ||upto(n)|| ~ nL:Top List, n:
. ||L||n 
(firstn(n;L) ~ L)| Rank | Theorem | Name |
| 2 | n,m:. firstn(n;upto(m)) ~ if nm upto(n) else upto(m) fi | [firstn_upto] |
| cites the following: | ||
| 1 | m:, n:(m+1). upto(m) ~ (upto(n) @ map(x.x+n;upto(m-n))) | [upto_decomp] |
| 0 | L1,L2:Top List, n:(||L1||+1). firstn(n;L1 @ L2) ~ firstn(n;L1) | [firstn_append] |
| 1 | n:. ||upto(n)|| ~ n | [length_upto] |
| 0 | L:Top List, n:. ||L||n (firstn(n;L) ~ L) | [firstn_all] |