Voir la notice de l'article provenant de la source Theory and Applications of Categories website
We introduce MD-sketches, which are a particular kind of Finite Sum sketches. Two interesting results about MD-sketches are proved. First, we show that, given two MD-sketches, it is algorithmically decidable whether their model categories are equivalent. Next we show that data-specifications, as used in database-design and software engineering, can be translated to MD-sketches. As a corollary, we obtain that equivalence of data-specifications is decidable.
@article{TAC_1995_1_a7, author = {F. Piessens and E. Steegmans}, title = {Categorical {Data-Specifications}}, journal = {Theory and applications of categories}, pages = {156--173}, publisher = {mathdoc}, volume = {1}, year = {1995}, language = {en}, url = {http://geodesic.mathdoc.fr/item/TAC_1995_1_a7/} }
F. Piessens; E. Steegmans. Categorical Data-Specifications. Theory and applications of categories, Tome 1 (1995), pp. 156-173. http://geodesic.mathdoc.fr/item/TAC_1995_1_a7/