A count over an adaptive list, projected through view (the node behind AList.count with id and AList.isEmpty with fun c -> c = 0). Registers nothing: the count is re-read at the next read after a write; the version advances only when the projected output changed, so an update (no count change) or a count change that the projection collapses (2 -> 3 under isEmpty) costs this node and its consumers nothing.