L:Top List, n:{0...||L||}. (firstn(n;L) @ nth_tl(n;L)) ~ L
0
as else nth_tl(n-1;tl(as)) fi (recursive)
is mentioned by
| Thm* L:Top List, n:{0...||L||}. (firstn(n;L) @ nth_tl(n;L)) ~ L | [append_firstn_lastn_sq] |
In prior sections: list 1 mb list 1
Try larger context:
Graphs