As an imperative concurrent programming language, CSP is considered weakly typed. We equip CSP with a formal second-order type system. The types of processes and prefixed processes are distinguished and they are treated as generic types that can be instantiated by the subtypes of alphabets. The bounded quantifier is introduced to represent bounded generics.