{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T15:15:00Z","timestamp":1773501300573,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540568681","type":"print"},{"value":"9783662215517","type":"electronic"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/978-3-662-21551-7_36","type":"book-chapter","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T09:30:08Z","timestamp":1658223008000},"page":"451-456","source":"Crossref","is-referenced-by-count":16,"title":["Agg \u2014 An implementation of algebraic graph rewriting"],"prefix":"10.1007","author":[{"given":"Michael","family":"L\u00f6we","sequence":"first","affiliation":[]},{"given":"Martin","family":"Beyer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"M. Beyer, AGG, An Algebraic Graph Grammar System, User Manual, Technical University of Berlin, Department of Computer Science, 1993."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"T. Brus, M.C.J.D. van Eekelen, M. van Leer, and M.J. Plasmeijer, Clean \u2014 a language of functional graph rewriting, Proc. 3rd Int. Conf. on Functional Programming Languages and Computer Architecture (FPCA '87) Portland, Oregon, USA, Springer LNCS 274, 1987, pp. 364\u2013384.","DOI":"10.1007\/3-540-18317-5_20"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"H. Ehrig, Introduction to the algebraic theory of graph grammars, 1st Int. Workshop on Graph Grammars and their Application to Computer Science and Biology, Lecture Notes in Computer Science 73, Springer, 1979, pp. 1\u201369.","DOI":"10.1007\/BFb0025714"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.-J. Kreowski, and G. Rozenberg (eds.), 4th Int. Workshop on Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 532, Springer, 1991.","DOI":"10.1007\/BFb0017372"},{"key":"36_CR5","unstructured":"H. Ehrig and M. L\u00f6we, Computing by graph transformation \u2014 Final Report, Tech. Report 92\/08, Technical University of Berlin, Department of Computer Science, 1992."},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld (eds.), 3rd Int. Workshop on Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 291, Springer, 1987.","DOI":"10.1007\/3-540-18771-5"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"J. Engelfriet and G. Rozenberg, Graph grammars based on node rewriting: An introduction to NLC graph grammars, In Ehrig et al. [EKR91], pp. 12\u201323.","DOI":"10.1007\/BFb0017374"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"H. G\u00f6ttler, Graph grammars and diagram editing, In Ehrig et al. [ENRR87], pp. 216\u2013231.","DOI":"10.1007\/3-540-18771-5_55"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"M. Himsolt, GraphEd: An interactive tool for developing graph grammars, In Ehrig et al. [EKR91], pp. 61\u201365.","DOI":"10.1007\/BFb0017378"},{"issue":"no.1","key":"36_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.3233\/FI-1991-15104","volume":"XV","author":"A. Habel","year":"1991","unstructured":"A. Habel, H.-J. Kreowski, and D. Plump, Jungle evaluation, Fundamenta Informaticae XV (1991), no. 1, 37\u201360.","journal-title":"Fundamenta Informaticae"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(90)90036-H","volume":"72","author":"J. R. Kennaway","year":"1990","unstructured":"J.R. Kennaway, Implementing term rewrite languages in DACTL, Theoretical Computer Science 72 (1990), 37\u201358.","journal-title":"Theoretical Computer Science"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"J. Lamping, An algorithm for optimal lambda calculus reduction, Conf. Rec. of the 17th Ann. ACM Symposium on Principles of Programming Languages, ACM Press, 1991, pp. 16\u201330.","DOI":"10.1145\/96709.96711"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"M. L\u00f6we and H. Ehrig, Algebraic approach to graph transformation based on single pushout derivations, Graph-Theoretic Concepts in Computer Science, WG '90 (R.H. M\u00f6hring, ed.), Springer LNCS 484, 1990, pp. 338\u2013353.","DOI":"10.1007\/3-540-53832-1_52"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","volume":"109","author":"M. L\u00f6we","year":"1993","unstructured":"M. L\u00f6we, Algebraic approach to single-pushout graph transformation, Theoretical Computer Science 109 (1993), 181\u2013224.","journal-title":"Theoretical Computer Science"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"M. Nagl, A software development environment based on graph technology, In Ehrig et al. [ENRR87], pp. 458\u2013478.","DOI":"10.1007\/3-540-18771-5_70"},{"key":"36_CR16","unstructured":"F. Newbery Paulisch, The Design of an Extendible Graph Editor, Ph.D. thesis, University of Karlsruhe, Department of Informatics, March 1991."},{"key":"36_CR17","unstructured":"S.L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice Hall, 1987."},{"key":"36_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-14577-6","volume-title":"Operationales Spezifizieren mit programmierten Graphersetzungssystemen","author":"A. Sch\u00fcrr","year":"1991","unstructured":"A. Sch\u00fcrr, Operationales Spezifizieren mit programmierten Graphersetzungssystemen, Deutscher Universit\u00e4tsverlag GmbH, Wiesbaden, 1991."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-21551-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T09:33:05Z","timestamp":1658223185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-21551-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540568681","9783662215517"],"references-count":18,"aliases":["10.1007\/3-540-56868-9_36"],"URL":"https:\/\/doi.org\/10.1007\/978-3-662-21551-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}