On the equivalence of types

Types over a discrete valued field $(K,v)$ are computational objects that parameterize certain families of monic irreducible polynomials in $K_v[x]$, where $K_v$ is the completion of $K$ at $v$. Two types are considered to be equivalent if they encode the same family of prime polynomials. In this paper, we characterize the equivalence of types in terms of certain data supported by them.