{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:18Z","timestamp":1761611298244},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540506676"},{"type":"electronic","value":"9783540460633"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50667-5_71","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:30:19Z","timestamp":1330183819000},"page":"191-203","source":"Crossref","is-referenced-by-count":14,"title":["Jungle evaluation for efficient term rewriting"],"prefix":"10.1007","author":[{"given":"Berthold","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume":"259","author":"H.P. Barendregt","year":"1987","unstructured":"H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W Glauert, J.R. Kennaway, M.J. Plasmeijer, M.R. Sleep: Term Graph Rewriting. Proc. PARLE, Lecture Notes in Comp. Sci. 259, 141\u2013158 (1987)","journal-title":"Lecture Notes in Comp. Sci."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0019-9958(85)80003-6","volume":"64","author":"N. Dershowitz","year":"1985","unstructured":"N. Dershowitz: Computing with Rewrite Systems. Information and Control 64, 122\u2013157 (1985)","journal-title":"Information and Control"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0025714","volume":"73","author":"H. Ehrig","year":"1979","unstructured":"H. Ehrig: Introduction to the Algebraic Theory of Graph Grammars. Proc. 1st Graph Grammar Workshop, Lecture Notes in Comp. Sci. 73, 1\u201369 (1979)","journal-title":"Lecture Notes in Comp. Sci."},{"key":"19_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69962-7","volume-title":"Fundamentals of Algebraic Specification 1 \u2014 Equations and Initial Semantics","author":"H. Ehrig","year":"1985","unstructured":"H. Ehrig, B. Mahr: Fundamentals of Algebraic Specification 1 \u2014 Equations and Initial Semantics. Springer, Monographs in Computer Science, New York-Berlin-Heidelberg (1985)"},{"key":"19_CR5","series-title":"Research Report RC","volume-title":"Commutativity of Independent Transformations on Complex Objects","author":"H. Ehrig","year":"1976","unstructured":"H. Ehrig, B.K. Rosen: Commutativity of Independent Transformations on Complex Objects. Research Report RC 6251, IBM T.J. Watson Research Center, Yorktown Heights (1976)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J. Goguen, J.P. Jouannoud, J. Meseguer: Principles of OBJ2. Proc. 1985 Symposium on Principles of Programming Languages, 52\u201366 (1985)","DOI":"10.1145\/318593.318610"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"A. Habel, H.-J. Kreowski, D. Plump: Jungle Evaluation. To appear in Proc. Fifth Workshop on Specification of Abstract Data Types (1988)","DOI":"10.1007\/3-540-50325-0_5"},{"key":"19_CR8","unstructured":"B. Hoffmann: Compiler Generation: From Language Descriptions to Abstract Compilers. Dissertation, TU Berlin (1983)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"G. Huet, D.C. Oppen: Equations and Rewrite Rules, A Survey. In R.V. Book (ed.): Formal Language Theory: Perspectives and Open Problems. Academic Press, 349\u2013405 (1980)","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"B. Hoffmann, D. Plump: Jungle Evaluation for Efficient Term Rewriting. Technical Report, Universit\u00e4t Bremen, (1988)","DOI":"10.1007\/3-540-50667-5_71"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0004-3702(85)90074-8","volume":"25","author":"J. Hsiang","year":"1985","unstructured":"J. Hsiang: Refutational Theorem Proving using Term Rewriting Systems. Artificial Intelligence 25, 255\u2013300 (1985)","journal-title":"Artificial Intelligence"},{"key":"19_CR12","first-page":"143","volume":"32","author":"J.W. Klop","year":"1987","unstructured":"J.W. Klop: Term Rewriting Systems: A Tutorial. EATCS Bulletin 32, 143\u2013182, (1987)","journal-title":"EATCS Bulletin"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-18771-5_63","volume":"291","author":"H.-J. Kreowski","year":"1987","unstructured":"H.-J. Kreowski: Is Parallelism Already Concurrency? \u2014 Part 1: Derivations in Graph Grammars. Proc. 3rd Graph Grammar Workshop, Lecture Notes in Comp. Sci. 291, 343\u2013360 (1987)","journal-title":"Lecture Notes in Comp. Sci."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-17220-3_1","volume":"256","author":"M.J. O'Donnell","year":"1987","unstructured":"M.J. O'Donnell: Term Rewriting Implementation of Equational Logic Programming. Proc. 2nd Conference on Rewriting Techniques and Applications, Lecture Notes in Comp. Sci. 256, 1\u201312 (1987)","journal-title":"Lecture Notes in Comp. Sci."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(82)90056-1","volume":"19","author":"P. Padawitz","year":"1982","unstructured":"P. Padawitz: Graph Grammars and Operational Semantics. Theoretical Comp. Sci. 19, 117\u2013141 (1982)","journal-title":"Theoretical Comp. Sci."},{"key":"19_CR16","unstructured":"P. Padawitz: Correctness, Completeness, and Consistency of Equational Data Type Specifications. Bericht Nr. 83-15, Technische Universit\u00e4t Berlin (1983)"},{"key":"19_CR17","volume-title":"The Implementation of Function Programming Languages","author":"S.L. Peyton Jones","year":"1987","unstructured":"S.L. Peyton Jones: The Implementation of Function Programming Languages. Prentice-Hall, Englewood Cliffs (1987)"},{"key":"19_CR18","unstructured":"D. Plump: Im Dschungel: Ein neuer Graph-Grammatik-Ansatz zur effizienten Auswertung rekursiv definierter Funktionen. Diplomarbeit, Studiengang Informatik, Universit\u00e4t Bremen (1986)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0304-3975(80)90013-4","volume":"10","author":"J. Staples","year":"1980","unstructured":"J. Staples: Computation on Graph-like Expressions. Theoretical Comp. Sci. 10, 171\u2013185 (1980)","journal-title":"Theoretical Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50667-5_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T06:08:17Z","timestamp":1561356497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50667-5_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540506676","9783540460633"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-50667-5_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}