Structural lists (Language Platform PRD §28.2 Collections, LP-802).
This is the small structural sequence: cheap to build, cheap to walk, and
shared rather than copied — appending to a list keeps the original intact
because the tail is shared, which is the sharing property §28.4 requires.
Iteration is deterministic by construction: a list has one order, the one
it was built in.
Asymptotic contract (§28.4 requires it to be explicit):
stdListCons O(1)
stdListHead O(1)
stdListLength O(n)
stdListAppend O(n) in the left list, sharing the right one
stdListReverse O(n)
stdListMap O(n)
stdListFold O(n)
stdListIndex O(i)
22family StdList : Type 0
23parameter erased stdListElement : Type 0
24constructor StdListEmpty
25constructor StdListCons
26field unrestricted stdListHeadValue : stdListElement
27recursive unrestricted stdListTailValueThe compiler supplied declaration spans and resolved links from this source snapshot. This page does not assert that this file belongs to a checked closure.