{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:44Z","timestamp":1725516224634},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_3","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"32-47","source":"Crossref","is-referenced-by-count":1,"title":["Term-Graph Rewriting Via Explicit Paths"],"prefix":"10.1007","author":[{"given":"Emilie","family":"Balland","sequence":"first","affiliation":[]},{"given":"Pierre-Etienne","family":"Moreau","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0014548","volume-title":"Theoretical Aspects of Computer Software","author":"Z.M. Ariola","year":"1997","unstructured":"Ariola, Z.M., Blom, S.: Cyclic lambda calculi. In: Ito, T., Abadi, M. (eds.) TACS 1997. LNCS, vol.\u00a01281, pp. 77\u2013106. Springer, Heidelberg (1997)"},{"issue":"3\/4","key":"3_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"Z.M. Ariola","year":"1996","unstructured":"Ariola, Z.M., Klop, J.W.: Equational term graph rewriting. Fundamenta Informaticae\u00a026(3\/4), 207\u2013240 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"3_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and all That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and all That. Cambridge University Press, Cambridge (1998)"},{"key":"3_CR4","unstructured":"Balland, E., Brauner, P.: Term-graph rewriting in tom using relative positions. In: TermGraph 2007: International Workshop on Computing with Terms and Graphs (2007)"},{"key":"3_CR5","unstructured":"Balland, E., Moreau, P.-E.: Term-graph rewriting via explicit paths. Technical report (2008), http:\/\/hal.inria.fr\/inria-00173535\/fr\/"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"H.P. Barendregt","year":"1987","unstructured":"Barendregt, H.P., van Eekelen, M., Glauert, J., Kennaway, J., Plasmeijer, M., Sleep, M.: Term graph rewriting. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 141\u2013158. Springer, Heidelberg (1987)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-61756-6_99","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"Z.-E.-A. Benaissa","year":"1996","unstructured":"Benaissa, Z.-E.-A., Lescanne, P., Rose, K.H.: Modeling sharing and recursion for weak reduction strategies using explicit substitution. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol.\u00a01140, pp. 393\u2013407. Springer, Heidelberg (1996)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-60043-4_65","volume-title":"Algebraic Methodology and Software Technology","author":"A. Corradini","year":"1995","unstructured":"Corradini, A., Gadducci, F.: Cpo models for infinite term rewriting. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol.\u00a0936, pp. 368\u2013384. Springer, Heidelberg (1995)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BFb0053548","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Corradini","year":"1998","unstructured":"Corradini, A., Gadducci, F.: Rational term rewriting. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol.\u00a01378, pp. 156\u2013171. Springer, Heidelberg (1998)"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N.G. Bruijn de","year":"1972","unstructured":"de Bruijn, N.G.: Lambda calculus notation with nameless dummies. a tool for automatic formula manipulation with application to the church-rosser theorem. Indagationes Mathematicae\u00a034, 381\u2013392 (1972)","journal-title":"Indagationes Mathematicae"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1017\/S096012950600541X","volume":"16","author":"D.J. Dougherty","year":"2006","unstructured":"Dougherty, D.J., Lescanne, P., Liquori, L.: Addressed term rewriting systems: Application to a typed object calculus. Mathematical Structures in Computer Science\u00a016, 667\u2013709 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"3_CR12","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":"3_CR13","doi-asserted-by":"crossref","unstructured":"Hoffmann, B., Plump, D.: Implementing term rewriting by jungle evaluation. RAIRO: Theoretical Informatics and Applications\u00a025 (1991)","DOI":"10.1051\/ita\/1991250504451"},{"issue":"1-2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(87)90079-X","volume":"52","author":"R. Kennaway","year":"1987","unstructured":"Kennaway, R.: On graph rewritings. TCS\u00a052(1-2), 37\u201358 (1987)","journal-title":"TCS"},{"key":"3_CR15","unstructured":"Kirchner, C.: Strategic rewriting. In: International Workshop on Reduction Strategies in Rewriting and Programming - WRS. ENTCS, vol.\u00a0124 (2004)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Kirchner, C., Kirchner, H.: Rewriting, solving, proving. A preliminary version of a book (1999), www.loria.fr\/~ckirchne\/=rsp\/rsp.pdf","DOI":"10.1007\/978-3-642-59851-7_9"},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1142\/9789812815149_0001","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"D. Plump","year":"1999","unstructured":"Plump, D.: Term graph rewriting. In: Handbook of Graph Grammars and Computing by Graph Transformation, pp. 3\u201361. World Scientific Publishing, Singapore (1999)"}],"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_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:21Z","timestamp":1605762501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}