We present an extension of simple type theory that incorporates types for any kind of mathematical structure (of any order). We further extend this system allowing isomorphic structures to be identified within these types thanks to some syntactical restrictions; for this purpose, we formally define what it means for two structures to be isomorphic. We model both extensions in NFU set theory in order to prove their relative consistency.