{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:29:44Z","timestamp":1725467384010},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612285"},{"type":"electronic","value":"9783540683889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_76","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:17:05Z","timestamp":1153131425000},"page":"16-26","source":"Crossref","is-referenced-by-count":1,"title":["The contractum in algebraic graph rewriting"],"prefix":"10.1007","author":[{"given":"R.","family":"Banach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"2_CR1","unstructured":"Banach R. (1996); Locating the Contractum in the Double Pushout Approach, Theoretical Computer Science 156, to appear."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0304-3975(94)90090-6","volume":"131","author":"R. Banach","year":"1994","unstructured":"Banach, R. (1994); Term Graph Rewriting and Garbage Collection Using Opfibrations, Theoretical Computer Science 131, 29\u201394.","journal-title":"Theoretical Computer Science"},{"key":"2_CR3","first-page":"141","volume-title":"Lecture Notes in Computer Science 259","author":"H.P. Barendregt","year":"1987","unstructured":"Barendregt H.P., van Eekelen M.C.J.D., Glauert J.R.W., Kennaway J.R., Plasmeijer M.J., Sleep M.R. (1987); Term Graph Rewriting, in: Proc. PARLE-87, de Bakker J.W., Nijman A.J., eds., Lecture Notes in Computer Science 259 141\u2013158, Springer, Berlin."},{"key":"2_CR4","first-page":"1","volume-title":"Lecture notes in Computer Science 73","author":"H. Ehrig","year":"1979","unstructured":"Ehrig H. (1979); Introduction to the Algebraic Theory of Graph Grammars (A survey), in: Lecture notes in Computer Science 73, 1\u201369, Springer, Berlin."},{"key":"2_CR5","first-page":"3","volume-title":"Lecture Notes in Computer Science 291","author":"H. Ehrig","year":"1986","unstructured":"Ehrig H. (1986); A Tutorial Introduction to the Algebraic Approach of Graph Grammars, in: Third International Workshop on Graph Grammars, Lecture Notes in Computer Science 291, 3\u201314, Springer, Berlin."},{"key":"2_CR6","first-page":"269","volume-title":"Lecture Notes in Compter Science 532","author":"H. Ehrig","year":"1991","unstructured":"Ehrig H., Habel A., Kreowski H-J., Parisi-Presice F. (1991a); From Graph Grammars to High Level Replacement Systems, in: Fourth Int. Workshop on Graph Grammars and their Applications to Computer Science, Ehrig, Kreowski, Rozenberg (eds.), Lecture Notes in Compter Science 532, 269\u2013291, Springer, Berlin."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/S0960129500001353","volume":"1","author":"H. Ehrig","year":"1991","unstructured":"Ehrig H., Habel A., Kreowski H-J., Parisi-Presice F. (1991b); Parallelism and Concurrency in High Level Replacement Systems, Mathematical Structures in Computer Science 1, 361\u2013404.","journal-title":"Mathematical Structures in Computer Science"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/mana.19790910111","volume":"91","author":"H. Ehrig","year":"1979","unstructured":"Ehrig H., Kreowski H-J. (1979); Pushout Properties: An Analysis of Gluing Constructions for Graphs, Mathematische Nachrichten 91, 135\u2013149.","journal-title":"Mathematische Nachrichten"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science 776","first-page":"152","volume-title":"Graph Transformations in Computer Science","author":"H. Ehrig","year":"1993","unstructured":"Ehrig H., Kreowski H-J., Taentzer G. (1993); Canonical Derivations for High-Level Replacement Systems, in: Graph Transformations in Computer Science, Schneider, Ehrig (eds.), Lecture Notes in Computer Science 776, 152\u2013169, Springer, Berlin."},{"key":"2_CR10","volume-title":"Lecture Notes in Computer Science 332","author":"A. Habel","year":"1988","unstructured":"Habel A., Kreowski H., Plump D. (1988); Jungle Evaluation, in: Proc. Fifth Workshop on Specification of Abstract Data Types, Sannella D., Tarlecki A., eds., Lecture Notes in Computer Science 332, Springer, Berlin."},{"key":"2_CR11","volume-title":"Mathematical Research 49","author":"B. Hoffman","year":"1988","unstructured":"Hoffman B., Plump D. (1988); Jungle Evaluation for Efficient Term Rewriting, in: Proc. International Workshop on Algebraic and Logic Programming, Mathematical Research 49, Akademie-Verlag, Berlin."},{"key":"2_CR12","unstructured":"Plump D. (1993); Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence, in: Term Graph Rewriting: Theory and Practice, Sleep et al. (eds.), John Wiley."},{"key":"#cr-split#-2_CR13.1","unstructured":"Sleep M.R., Plasmeijer M.J., van Eekelen M.C.J.D. (eds.) (1993);"},{"key":"#cr-split#-2_CR13.2","unstructured":"Term Graph Rewriting: Theory and Practice, John Wiley."},{"key":"2_CR14","unstructured":"T.C.S. (1993); Special Issue of Selected Papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, 1991. Theoretical Computer Science, 109, Nos. 1\u20132."}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61228-9_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T06:27:10Z","timestamp":1549434430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}