Major advances concerning Colored Object Programming have been made at two levels : at the interface level, by a precise definition of colored graphs ; at the implementation level, by the specification of concrete as well as abstract mappings. Key points are the definition of local inheritance rules for regular transitions (interface part) as well as for representations and micro-methods (implementation part) ; the attachment of two micro-methods per regular transition (a pre- and a post-method) which indirectly enables the solving of the super/call-next-method modularity problem ; and the interpretation of color graphs in terms of dimensions in a N-dimensions space : this renews the concept of class inheritance through the combination and derivation constructs.