{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:45Z","timestamp":1725516225643},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70590-1_5","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"63-78","source":"Crossref","is-referenced-by-count":0,"title":["A Needed Rewriting Strategy for Data-Structures with Pointers"],"prefix":"10.1007","author":[{"given":"Rachid","family":"Echahed","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Peltier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0013825","volume-title":"Algebraic and Logic Programming; Third International Conference; Proceedings","author":"S. Antoy","year":"1992","unstructured":"Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) Algebraic and Logic Programming; Third International Conference; Proceedings, Berlin, Germany, pp. 143\u2013157. Springer, Berlin, Germany (1992)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0013825","volume-title":"Algebraic and Logic Programming","author":"S. Antoy","year":"1992","unstructured":"Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol.\u00a0632, pp. 143\u2013157. Springer, Heidelberg (1992)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/1140335.1140350","volume-title":"Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming","author":"R. Caferra","year":"2006","unstructured":"Caferra, R., Echahed, R., Peltier, N.: Rewriting term-graphs with priority. In: Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pp. 109\u2013120. ACM Press, New York (2006)"},{"key":"5_CR4","first-page":"325","volume-title":"Proceedings of 15th International Conference and Symposium on Logic Programming","author":"R. Echahed","year":"1998","unstructured":"Echahed, R., Janodet, J.-C.: Admissible graph rewriting and narrowing. In: Proceedings of 15th International Conference and Symposium on Logic Programming, Manchester, pp. 325\u2013340. MIT Press, Cambridge (1998)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-48483-3_9","volume-title":"Recent Trends in Algebraic Development Techniques","author":"R. Echahed","year":"1999","unstructured":"Echahed, R., Janodet, J.C.: Parallel admissible graph rewriting. In: Fiadeiro, J.L. (ed.) WADT 1998. LNCS, vol.\u00a01589, pp. 122\u2013138. Springer, Heidelberg (1999)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/11841883_8","volume-title":"Graph Transformations","author":"R. Echahed","year":"2006","unstructured":"Echahed, R., Peltier, N.: Narrowing data-structures with pointers. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 92\u2013106. Springer, Heidelberg (2006)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-73449-9_12","volume-title":"Term Rewriting and Applications","author":"R. Echahed","year":"2007","unstructured":"Echahed, R., Peltier, N.: Non Strict Confluent Rewrite Systems for Data-Structures with Pointers. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 137\u2013152. Springer, Heidelberg (2007)"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(98)00016-7","volume":"67","author":"M. Hanus","year":"1998","unstructured":"Hanus, M., Lucas, S., Middeldorp, A.: Strongly sequential and inductively sequential term rewriting systems. Information Processing Letters\u00a067(1), 1\u20138 (1998)","journal-title":"Information Processing Letters"},{"key":"5_CR9","first-page":"395","volume-title":"Computational Logic: Essays in Honor of Alan Robinson","author":"G. Huet","year":"1991","unstructured":"Huet, G., Levy, J.-J.: Computations in orthogonal rewriting systems. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic: Essays in Honor of Alan Robinson, pp. 395\u2013443. MIT Press, Cambridge (1991)"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0747-7171(08)80124-1","volume":"12","author":"J.W. Klop","year":"1991","unstructured":"Klop, J.W., Middeldorp, A.: Sequentiality in orthogonal term rewriting systems. J. Symb. Comput.\u00a012(2), 161\u2013195 (1991)","journal-title":"J. Symb. Comput."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/363534.363554","volume":"10","author":"H. Schorr","year":"1967","unstructured":"Schorr, H., Waite, W.M.: An Efficient Machine Independent Procedure for Garbage Collection in Various List Structures. Communication of the ACM\u00a010, 501\u2013506 (1967)","journal-title":"Communication of the ACM"},{"key":"5_CR12","volume-title":"Haskell: The Craft of Functional Programming","author":"S. Thompson","year":"1999","unstructured":"Thompson, S.: Haskell: The Craft of Functional Programming, 2nd edn. Addison-Wesley, Reading (1999)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:17:45Z","timestamp":1558264665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705888","9783540705901"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}