The Higher-Order Psi-calculus framework (HO Psi) by Parrow et al. is a generalisation of many first- and higher-order extensions of the pi-calculus. In this paper we present a generic type system for HO Psi-calculi. It satisfies a subject reduction property and can be instantiated to yield both existing and new type systems for calculi, that can be expressed as HO Psi-calculi. In this paper, we consider the type system for termination in HO pi by Demangeon et al. Moreover, we derive a new type system for the rho-calculus of Meredith and Radestock and present a type system for non-interference for mobile code. (c) 2024 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).