Primary Decomposition of Modules: Two Variables over a Field

In this paper I present an algorithm for computing the primary decomposition of a submodule of a free module of a polynomial ring in two variables over a field k. Based on Lazardʹs (1985) algorithm for primary decomposition of ideals in two variables over a field, this algorithm is more explicit than those known for more general cases.