{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:49:14Z","timestamp":1742917754717,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662464"},{"type":"electronic","value":"9783540484837"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48483-3_9","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:13:32Z","timestamp":1269897212000},"page":"122-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Admissible Graph Rewriting"],"prefix":"10.1007","author":[{"given":"Rachid","family":"Echahed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Christophe","family":"Janodet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"9_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BFb0013825","volume-title":"Proc. of ALP\u201992","author":"S. Antoy","year":"1992","unstructured":"S. Antoy. Definitional trees. In Proc. of ALP\u201992, pages 143\u2013157. LNCS 632, 1992."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"S. Antoy, R. Echahed, and M. Hanus. Parallel evaluation strategies for functional logic languages. In Proc. of ICLP\u201997, pages 138\u2013152, Portland, 1997. MIT Press.","DOI":"10.7551\/mitpress\/4299.003.0016"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Z.M. Ariola and J.W. Klop. Equational term graph rewriting. Fundamenta Informaticae, 26(3\u20134), 1996.","DOI":"10.3233\/FI-1996-263401"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Z.M. Ariola, J.W. Klop, and D. Plump. Confluent rewriting of bisimilar term graphs. Electronic Notes in Theoretical Computer Science, 7, 1997.","DOI":"10.1016\/S1571-0661(05)80463-3"},{"key":"9_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume-title":"PARLE\u201987","author":"H. Barendregt","year":"1987","unstructured":"H. Barendregt, M. van Eekelen, J. Glauert, R. Kenneway, M. J. Plasmeijer, and M. Sleep. Term graph rewriting. In PARLE\u201987, pages 141\u2013158. LNCS 259, 1987."},{"key":"9_CR6","unstructured":"R. Echahed and J. C. Janodet. On constructor-based graph rewriting systems. Technical report, IMAG, 1997. Available via URL: ftp:\/\/ftp.imag.fr\/pub\/LEIBNIZ\/ATINF\/c-graph-rewriting.ps.gz."},{"key":"9_CR7","unstructured":"R. Echahed and J. C. Janodet. On weakly orthogonal constructorbased graph rewriting. Technical report, 1998. Available via URL: ftp:\/\/ftp.imag.fr\/pub\/LEIBNIZ\/ATINF\/wa-c-graph-rewriting.ps.gz."},{"key":"9_CR8","unstructured":"R. Echahed and J.C. Janodet. Admissible graph rewriting and narrowing. In Proc. of JICSLP\u201998, pages 325\u2013340. MIT Press, June 1998."},{"key":"9_CR9","first-page":"182","volume":"59","author":"H. Ehrig","year":"1996","unstructured":"H. Ehrig and G. Taentzer. Computing by graph transformation: A survey and annotated bibliography. Bulletin of the EATCS, 59:182\u2013226, June 1996.","journal-title":"Bulletin of the EATCS"},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1145\/177492.177577","volume":"16","author":"J. R. Kennaway","year":"1994","unstructured":"J. R. Kennaway, J. K. Klop, M. R. Sleep, and F. J. De Vries. On the adequacy of graph rewriting for simulating term rewriting. ACM Transactions on Programming Languages and Systems, 16(3):493\u2013523, 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/inco.1995.1075","volume":"119","author":"J. R. Kennaway","year":"1995","unstructured":"J. R. Kennaway, J. K. Klop, M. R. Sleep, and F. J. De Vries. Transnite reduction in orthogonal term rewriting systems. Information and Computation, 119(1):18\u201338, 1995.","journal-title":"Information and Computation"},{"key":"9_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08531-9","volume-title":"Computing in Systems Described by Equations","author":"M. J. O\u2019Donnell","year":"1977","unstructured":"M. J. O\u2019Donnell. Computing in Systems Described by Equations. LNCS 58, 1977."},{"key":"9_CR13","unstructured":"R. Plasmeijer and M. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, 1993."},{"key":"9_CR14","unstructured":"D. Plump. Term graph rewriting. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2. World Scientic, to appear."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Grzegorz Rozenberg. Handbook of Graph Grammars and Computing by Graph Transformations, volume 1. World Scientic, 1997.","DOI":"10.1142\/3303"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/inco.1993.1026","volume":"104","author":"R. C. Sekar","year":"1993","unstructured":"R. C. Sekar and I. V. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. Information and Computation, 104(1):78\u2013109, May 1993.","journal-title":"Information and Computation"},{"volume-title":"Term Graph Rewriting. Theory and Practice","year":"1993","key":"9_CR17","unstructured":"M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, editors. Term Graph Rewriting. Theory and Practice. J. Wiley & Sons, Chichester, UK, 1993."}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48483-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T11:23:19Z","timestamp":1711365799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48483-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662464","9783540484837"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48483-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}