Skip to main content
Conference Proceedings

From graph transformation to Rule-Based programming with diagrams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1779 165-180
DOI: 10.1007/3-540-45104-8_12
7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Graph transformation is a well studied computational model for specification and programming. In this paper we outline a path that can be taken in order to turn graph transformation into a rule-based language for programming with diagrams. In particular, we discuss how data abstraction and functional abstraction can be achieved in the setting of graphs, by minimal extensions of the underlying graph and transformation model.

Cite

CITATION STYLE

APA

Hoffmann, B. (2000). From graph transformation to Rule-Based programming with diagrams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1779, pp. 165–180). Springer Verlag. https://doi.org/10.1007/3-540-45104-8_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free