×

Transformations of structures: An algebraic approach. (English) Zbl 0491.68035


MSC:

68Q65 Abstract data types; algebraic specification
68Q60 Specification and verification (program logics, model checking, etc.)
68Q45 Formal languages and automata
68Q70 Algebraic theory of languages and automata
18B20 Categories of machines, automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] M. A. Arbib and E. G. Manes,Arrows, Structures, and Functors, Academic Press, New York, 1975. · Zbl 0374.18001
[2] G. Berry and J.-J. Levy, Minimal and optimal computations of recursive programs,J. ACM 26 (1979), 148–175. · Zbl 0388.68012 · doi:10.1145/322108.322122
[3] G. Birkhoff and J. D. Lipson, Heterogeneous algebras,J. Combinatorial Theory, 8 (1970), pp. 115–133. · Zbl 0211.02003 · doi:10.1016/S0021-9800(70)80014-X
[4] V. Claus, H. Ehrig, and G. Rozenberg (Editors),Graph Grammars and their Application to Computer Science and Biology, Lecture Notes in Computer Sci., 73 (1979). · Zbl 0398.00019
[5] E. F. Codd,A relational model of data for large shared data banks, Comm. ACM, 13 (1970), pp. 377–387. · Zbl 0207.18003 · doi:10.1145/362384.362685
[6] J. A. Darringer and W. H. Joyner,A new look at logic synthesis, IBM Research Report RC 8268, Yorktown Heights NY, May 1980.
[7] H. Ehrig and H.-J. Kreowski, Contributions to the algebraic theory of graph grammars,Math. Nachr., to appear. · Zbl 0388.68061
[8] H. Ehrig and H.-J. Kreowski, Applications of graph grammar theory to consistency, synchronization, and scheduling in data base systems,Information Sciences, to appear. · Zbl 0456.68096
[9] H. Ehrig, H.-J. Kreowski, A. Maggiolo-Schettini, B. K. Rosen, and J. Winkowski, Deriving structures from structures,Lecture Notes in Computer Science, 64 (1978), pp. 177–190. · Zbl 0379.68055
[10] H. Ehrig, M. Pfender, and H. J. Schneider, Graph grammars: an algebraic approach,Proc. 14th Ann. IEEE Symp. on Switching and Automata Theory, Iowa City, October 1973, pp. 167–180.
[11] H. Ehrig and B. K. Rosen,Commutativity of independent transformations on complex objects, IBM Research Report RC 6251, Yorktown Heights NY, October 1976. · Zbl 0357.02034
[12] H. Ehrig and B. K. Rosen, The mathematics of record handling,SIAM J. Computing, 9 (1980), 441–469. · Zbl 0455.68021 · doi:10.1137/0209034
[13] H. Ehrig and B. K. Rosen,Commutativity, parallelism, and concurrency for transformations of structures, Bericht 79–21, Fachbereich Informatik, Tech. U. Berlin, October 1979. · Zbl 0418.68062
[14] H. Ehrig and K. W. Tischer, Graph grammars and applications to specialization and evolution in biology,J. Computer and System Sci., 11 (1975), pp. 212–236. · Zbl 0326.68055 · doi:10.1016/S0022-0000(75)80069-9
[15] S. Eilenberg and J. Wright, Automata in general algebras,Information and Control, 11 (1967), 452–470. · Zbl 0175.27902 · doi:10.1016/S0019-9958(67)90670-5
[16] R. Farrow, K. Kennedy, and L. Zucconi, Graph grammars and global program data flow analysis,Proc. 17th Ann. IEEE Symp. on Foundations of Computer Sci., Houston, October 1976, pp. 42–56.
[17] H. Herrlich and G. Strecker,Category Theory, Allyn and Bacon, Rockleigh, New Jersey, 1973. · Zbl 0265.18001
[18] H.-J. Kreowski,Ein Pumpinglemma für Kanten-Kontextfreie Graph-Sprachen, Bericht 77–15, Fachbereich Informatik, Tech. U. Berlin, September 1977. (See also [4].) · Zbl 0354.68101
[19] M. J. O’Donnell, Computing in systems described by equations,Lecture Notes in Computer Science, 58 (1977). · Zbl 0421.68038
[20] G. Pacini, C. Montangero, and F. Turini, Graph representation and computation rule for typeless recursive languages,Lecture Notes in Computer Science, 14 (1974), pp. 157–169. · Zbl 0297.68072
[21] Padawitz, P.,Graph grammars and operational semantics, Bericht 78–33, Fachbereich Informatik, Tech. U. Berlin, October 1978. (See also [4].)
[22] V. Rajlich, Dynamics of discrete systems J. Computer and System Sci., 11 (1975), pp. 186–202. · Zbl 0324.68043 · doi:10.1016/S0022-0000(75)80067-5
[23] B. K. Rosen, Deriving graphs from graphs by applying a production,Acta Informatica, 4 (1975), pp. 337–357. · Zbl 0306.68050 · doi:10.1007/BF00289616
[24] H. J. Schneider and H. Ehrig, Grammars on partial graphs,Acta Informatica, 6 (1976), pp. 297–316. · Zbl 0329.68061 · doi:10.1007/BF00288659
[25] J. Staples, A class of replacement systems with simple optimality theory,Bull. Austral. Math. Soc., 17 (1977), p. 335–350. · Zbl 0383.68062 · doi:10.1017/S0004972700010625
[26] J. Staples, Computation on graph-like expressions,Theoretical Computer Sci., 10 (1980), 171–185. · Zbl 0423.68007 · doi:10.1016/0304-3975(80)90013-4
[27] J. Staples, Optimal evaluations of graph-like expressions,Theoretical Computer Sci., 10 (1980), 297–316. · Zbl 0426.68006 · doi:10.1016/0304-3975(80)90051-1
[28] J. Staples, Speeding up subtree replacement systems,Theoretical Computer Sci., 11 (1980), 39–47. · Zbl 0438.68032 · doi:10.1016/0304-3975(80)90033-X
[29] S. A. Vere, Relational production systems,Artificial Intelligence, 8 (1977), pp. 47–68. · Zbl 0347.68050 · doi:10.1016/0004-3702(77)90004-2
[30] J. Vuillemin, Correct and optimal implementations of recursion in a simple programming language,J. Computer and System Sci., 9 (1974), pp. 332–354. · doi:10.1016/S0022-0000(74)80048-6
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.