/**
 * PersistentList — an immutable singly-linked list (cons cells).
 *
 * Used as the continuation stack in Phase 2. Forking is O(1): to take
 * a multi-shot continuation, keep the reference. Calling `resume` twice
 * restarts from the same immutable stack snapshot without copying.
 *
 * Performance characteristics:
 *   cons(v, list)  O(1)
 *   head / tail    O(1)
 *   isEmpty        O(1)
 */
export type PersistentList<T> = null | PersistentListNode<T>;
export interface PersistentListNode<T> {
    readonly head: T;
    readonly tail: PersistentList<T>;
}
/** Prepend `value` to `list`. */
export declare function cons<T>(value: T, list: PersistentList<T>): PersistentListNode<T>;
/** Returns true if `list` is empty. */
export declare function isEmpty<T>(list: PersistentList<T>): list is null;
/** Convert a PersistentList to a plain JS array. O(N). */
export declare function listToArray<T>(list: PersistentList<T>): T[];
/** Build a PersistentList from a plain JS array. O(N). Head of list = first element. */
export declare function listFromArray<T>(arr: T[]): PersistentList<T>;
/** Return the first `n` elements as a new list. O(N). */
export declare function listTake<T>(list: PersistentList<T>, n: number): PersistentList<T>;
/** Skip the first `n` elements and return the rest. O(N). */
export declare function listDrop<T>(list: PersistentList<T>, n: number): PersistentList<T>;
/**
 * Prepend all elements of `arr` to `list`.
 * First element of `arr` becomes the new head. O(N).
 * Used for stack reconstruction: e.g. [...innerFrames, handler, ...outerK].
 */
export declare function listPrependAll<T>(arr: readonly T[], list: PersistentList<T>): PersistentList<T>;
/** Return the number of elements in the list. O(N). */
export declare function listSize<T>(list: PersistentList<T>): number;