Let R be a complete discrete valuation ring, S = R[[u]] and d a positive integer. The aim of this paper is to explain how to compute efficiently usual operations such as sum and intersection of sub-S-modules of S. As S is not principal, it is not possible to have a uniform bound on the number of generators of the modules resulting from these operations. We explain how to mitigate this problem, ...