Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation - CAPP Accéder directement au contenu
Communication Dans Un Congrès Electronic Communications of the EASST Année : 2011

Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation

Résumé

Rewriting systems are often defined as binary relations over a given set of objects. This simple definition is used to describe various properties of rewriting such as termination, confluence, normal forms etc. In this paper, we introduce a new notion of abstract rewriting in the framework of categories. Then, we define the functoriality property of rewriting systems. This property is sometimes called vertical composition. We show that most of graph transformation systems are functorial and provide a counter-example of graph transformation systems which is not functorial.
Fichier non déposé

Dates et versions

hal-00828532 , version 1 (31-05-2013)

Identifiants

  • HAL Id : hal-00828532 , version 1

Citer

Dominique Duval, Rachid Echahed, Frederic Prost. Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation. GT-VMT 2011 - International Workshop on Graph Transformation and Visual Modeling Techniques (satellite workshop of ETAPS 2011), Apr 2011, Saarbrücken, Germany. 17 p. ⟨hal-00828532⟩
125 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More