{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T19:50:10Z","timestamp":1790884210991,"version":"4.1.0"},"reference-count":17,"publisher":"EDP Sciences","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1991]]},"DOI":"10.1051\/ita\/1991250504451","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:06:27Z","timestamp":1486047987000},"page":"445-472","source":"Crossref","is-referenced-by-count":37,"title":["Implementing term rewriting by jungle evaluation"],"prefix":"10.1051","volume":"25","author":[{"given":"Berthold","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"[BvEG*87] BARENDREGT H. P., VAN EEKELEN M. C. J. D., GLAUERT J. R. W., KENNAWAY J. R., PLASMEIJER M. J. and SLEEP M. R., Term Graph Rewriting, Proc, PARLE, Lecture Notes in Comp. Sci., 1987, 259, pp. 141-158.","DOI":"10.1007\/3-540-17945-3_8"},{"key":"R2","unstructured":"[DJ90] DERSHOWITZ N. and JOUANNAUD J.-P., Rewrite Systems, Handbook of Theoretical Computer Science, Vol. B, chapter 15, North Holland, 1990.11271910900.68283"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"[DM79] DERSHOWITZ N. and MANNA Z., Proving Termination with Multiset Orderings, Comm. ACM, 1979, 22, (8), pp. 465-476.5400430431.68016","DOI":"10.1145\/359138.359142"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"[Ehr79] EHRIG H., Introduction to the Algebraic Theory of Graph Grammars, Proc. 1st Graph Grammar Workshop, Lecture Notes in Comp. Sci., 1979, 73, pp. 1-69.5650340407.68072","DOI":"10.1007\/BFb0025714"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"[Ehr83] EHRIG H., Aspects of Concurrency in Graph Grammars, Proc. 2nd Graph Grammar Workshop, Lecture Notes in Comp. Sci., 1983, 153, pp. 58-81.0522.68070","DOI":"10.1007\/BFb0000099"},{"key":"R6","unstructured":"[ER76] EHRIG H. and ROSEN B. K., Commutativity of Independent Transformations on Complex Objects, Research Report RC 6251, IBM T. J. Watson Research Center, Yorktown Heights, 1976.0355.68053"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"[HKP88] HABEL A., KREOWSKI H.-J. and PLUMP D., Jungle Evaluation, Proc. Fifth Workshop on Specification of Abstract Data Types. Lecture Notes in Comput. Sci., 1988, 332, pp. 92-112. Revised version to appear in Fundamentae Informaticae.0661.68016","DOI":"10.1007\/3-540-50325-0_5"},{"key":"R8","unstructured":"[Hof83] HOFFMANN B., Compiler Generation: From Language Descriptions to Abstract Compilers, Dissertation, TU Berlin, 1983."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"[HP88] HOFFMANN B. and PLUMP D., Jungle Evaluation for Efficient Term Rewriting, Proc. Algebraic and Logic Programming, Lecture Notes in Comput. Sci., 1988, 343, pp. 191-203.9877120708.68029","DOI":"10.1007\/3-540-50667-5_71"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"[Klo90] KLOP J. W., Term Rewriting Systems: from Church-Rosser to Knuth-Bendix and Beyond, Proc. ICALP'90, Lecture Notes in Comput. Sci., 1990, 443, pp. 350-369.10768300765.68008","DOI":"10.1007\/BFb0032044"},{"key":"R11","unstructured":"[KW87] KREOWSKI H.-J. and WILHARM A., Is Parallelism Already Concurrency? 0643.68024"},{"key":"R12","unstructured":"- Part 2: Non-sequential Processes in Graph Grammars, Proc. 3rd Graph Grammar Workshop, Lecture Notes in Comput. Sci., 1987, 291, pp. 361-377.0643.68024"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"[Pad82] PADAWITZ P., Graph Grammars and Operational Semantics, Theoret. Comput. Sci., 1982, 19, pp. 117-141.6665370486.68090","DOI":"10.1016\/0304-3975(82)90056-1"},{"key":"R14","unstructured":"[Plu86] PLUMP D., Im Dschungel: Ein neuer Graph-Grammatik-Ansatz zur effizienten Auswertung rekursiv definierter Funktionen, Diplomarbeit, Fachbereich Mathematik\/Informatik, Universit\u00e4t Bremen, 1986."},{"key":"R15","unstructured":"[Plu91] PLUMP D., Graph-Reducible Term Rewriting Systems, Proc. 4th Graph Grammar Workshop, Lecture Notes in Comput. Sci., 1991 (to appear).0787.68058"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"[Rao84] RAOULT J. C., On Graph Rewritings, Theoret. Comput. Sci., 32, 1984, pp. 1-24.7611580551.68065","DOI":"10.1016\/0304-3975(84)90021-5"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"[Sta80] STAPLES J., Computations on Graph-like Expressions, Theoret.Comput.Sci., 1980, 10, pp. 171-185.0423.68007","DOI":"10.1016\/0304-3975(80)90013-4"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1991250504451\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:58:42Z","timestamp":1568786322000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1991250504451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"references-count":17,"journal-issue":{"issue":"5"},"alternative-id":["ita1991250504451"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1991250504451","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}