In modeling parasitic diseases, it is natural to distinguish hosts according to the number of parasites that they carry, leading to a countably infinite type space. Proving the analogue of the deterministic equations, used in models with finitely many types as a “law of large numbers” approximation to the underlying stochastic model, has previously either been done case by case, using some special structure, or else not attempted. In this paper we prove a general theorem of this sort, and complement it with a rate of convergence in the ℓ₁-norm.