In Section 2.2 of Brent and Kung's "Fast Algorithms for Manipulating Formal Power Series" (PDF link via harvard.edu), this notation appears: $$L(c_0,...,c_n \bmod a_1,...,a_m, b_1,...,b_m)$$
This "mod" does not appear to sound like something like $10=2 \bmod 8$. This $L$ is the number of operations to compute $(c_i)$ from $(a_i)$, $(b_i)$.
What is the abbreviation, "mod", here? Is it "modulo"?