{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:47Z","timestamp":1725455927368},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013824","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"128-142","source":"Crossref","is-referenced-by-count":2,"title":["Term rewriting with sharing and memo\u00efzation"],"prefix":"10.1007","author":[{"given":"Berthold","family":"Hoffmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"12","key":"10_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of Rewriting. Journal of Symbolic Computation, 3(1,2):69\u2013115, Corrigendum: 4(3), 409\u2013410, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science (Vol. B), chapter 6, pages 243\u2013320. North Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and S. Kaplan. Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, ... In Proc. 16th Symposium on Principles of Programming Languages, pages 250\u2013259. ACM Press, 1989.","DOI":"10.1145\/75277.75299"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"H. Ehrig. Introduction to the Algebraic Theory of Graph Grammars. In 1st Workshop on Graph Grammars and their Application to Computer Science and Biology, pages 1-69. Springer, LNCS 73, 1979.","DOI":"10.1007\/BFb0025714"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"A. Habel, H.-J. Kreowski, and D. Plump. Jungle Evaluation. In Fifth Workshop on Specification of Abstract Data Types, pages 92\u2013112. Springer, LNCS 332, 1988. (See also in Fundamenta Informaticae 15(1), 31\u201360, 1991).","DOI":"10.1007\/3-540-50325-0_5"},{"key":"10_CR6","unstructured":"B. Hoffmann. Jungle Evaluation with Memo\u00efzation. Technical Report 2-92, Fachbereich Mathematik \/ Informatik, Universit\u00e4t Bremen, 1992. to appear."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"B. Hoffmann and D. Plump. Jungle Evaluation for Efficient Term Rewriting. In Algebraic and Logic Programming, pages 191\u2013203. Springer, LNCS 343, 1988. Also in: Akademie-Verlag Berlin. Long version in technical report 4\/88, Fachbereich 3 \u2014 Informatik, Universit\u00e4t Bremen.","DOI":"10.1007\/3-540-50667-5_71"},{"issue":"5","key":"10_CR8","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1051\/ita\/1991250504451","volume":"25","author":"B. Hoffmann","year":"1991","unstructured":"B. Hoffmann and D. Plump. Implementing Term Rewriting by Jungle Evaluation. RAIRO Theoretical Informatics and Applications, 25(5):445\u2013472, 1991.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"R.J.M. Hughes. Lazy Memo Functions. In Jouannaud, editor, Conf. on Fund. Lang, and Comp. Arch., pages 129\u2013146. IFIP, Springer, LNCS 201, September 1985.","DOI":"10.1007\/3-540-15975-4_34"},{"key":"10_CR10","unstructured":"S. Kahrs. Unlimp: Uniqueness as a Leitmotiv for Implementation. In Proc. PLILP'92 (4th Workshop on Programming Language Implementation and Logic Programming). To appear in LNCS, 1992."},{"key":"10_CR11","volume-title":"Technical Report CS-R9041","author":"J.R. Kennaway","year":"1990","unstructured":"J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Transfinite Reductions in Orthogonal Term Rewriting Systems. Technical Report CS-R9041, Centrum for Wiskunde en Informatica, Amsterdam, 1990. Extended abstract in: Rewriting Techniques and Applications 1991 (RTA'91), R.V. Book, ed., LNCS 488, Springer, 1\u201312."},{"key":"10_CR12","volume-title":"Technical Report CS-R9073","author":"J.W. Klop","year":"1990","unstructured":"J.W. Klop. Term Rewriting Systems. Technical Report CS-R9073, Centre for Mathematics and Computer Science, Amsterdam, 1990. to appear in: S. Abramsky, D. Gabbay, and T. Maibaum (eds.): Handbook on Logics in Computer Science, Oxford University Press."},{"key":"10_CR13","unstructured":"J.W. Klop. Term Rewriting Systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook on Logics in Computer Science, volume II, page ??? Oxford University Press, 1991. Early version available as CWI Report CS-R9073, 132 pages, Amsterdam, 1990."},{"key":"10_CR14","volume-title":"PhD thesis","author":"H.-J. Kreowski","year":"1977","unstructured":"H.-J. Kreowski. Manipulation von Graphmanipulationen. PhD thesis, TU Berlin, 1977."},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(85)90063-8","volume":"20","author":"D.A. Plaisted","year":"1985","unstructured":"D.A. Plaisted. The Undecidability of self-embedding for term rewriting systems. Information Processing Letters, 20:61\u201364, 1985.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:33:28Z","timestamp":1586579608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0013824","relation":{},"subject":[]}}