Abstract
In this paper, we define diagrammatic languages by metamodels represented by categorical sketches. Then, a model, corresponding to a categorical sketch, is a Set-value functor M: đâSet, where đ is the sketch graph, and which respects the constraints imposed by the categorical sketch. A view of a model M, is another model đ„ in the diagrammatic language that maps to M by a natural injective transformation. This is a theoretically satisfactory definition but does not provide us with solutions to actually find these views. In this paper, we will present a practical way to construct a satisfactory set of views for a given model. Moreover, this mechanism can be implemented generically, at the modeling language level, and then used for each model separately. The categorical mechanisms that we use to solve this problem are representable functors and the Yoneda lemma. This is also the main contribution of this paper to solving problems related to multi-view modeling.