{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:13:10Z","timestamp":1743001990088,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642284113"},{"type":"electronic","value":"9783642284120"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28412-0_4","type":"book-chapter","created":{"date-parts":[[2012,2,18]],"date-time":"2012-02-18T09:14:28Z","timestamp":1329556468000},"page":"27-41","source":"Crossref","is-referenced-by-count":0,"title":["Sharing in the Graph Rewriting Calculus"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clara","family":"Bertolissi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3-4","key":"4_CR1","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"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1997.2651","volume":"139","author":"Z.M. Ariola","year":"1997","unstructured":"Ariola, Z.M., Klop, J.W.: Lambda calculus with explicit recursion. Information and Computation\u00a0139(2), 154\u2013233 (1997)","journal-title":"Information and Computation"},{"key":"4_CR3","doi-asserted-by":"publisher","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, New York (1998)"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1017\/S0960129507006093","volume":"17","author":"P. Baldan","year":"2007","unstructured":"Baldan, P., Bertolissi, C., Cirstea, H., Kirchner, C.: A rewriting calculus for cyclic higher-order term graphs. Mathematical Structures in Computer Science\u00a017(3), 363\u2013406 (2007)","journal-title":"Mathematical Structures in Computer Science"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Baldan, P., Bertolissi, C., Cirstea, H., Kirchner, C.: Towards a sharing strategy for the graph rewriting calculus. In: Proceedings of WRS 2007. Electr. Notes Theor. Comput. Sci., vol.\u00a0204, pp. 111\u2013127. Elsevier (2008)","DOI":"10.1016\/j.entcs.2008.03.057"},{"key":"4_CR6","series-title":"Studies in Logic and the Foundation of Mathematics","volume-title":"The Lambda-Calculus, its syntax and semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda-Calculus, its syntax and semantics, 2nd edn. Studies in Logic and the Foundation of Mathematics. North Holland, Amsterdam (1984)","edition":"2"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.C.J.D., Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., Sleep, M.R.: 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":"4_CR8","doi-asserted-by":"crossref","unstructured":"Bertolissi, C.: The graph rewriting calculus: properties and expressive capabilities. Th\u00e8se de Doctorat d\u2019Universit\u00e9, INPL, Nancy, France (2005)","DOI":"10.1007\/11560586_10"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-71389-0_7","volume-title":"Foundations of Software Science and Computational Structures","author":"C. Bertolissi","year":"2007","unstructured":"Bertolissi, C., Kirchner, C.: The Rewriting Calculus as a Combinatory Reduction System. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 78\u201392. Springer, Heidelberg (2007)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Borovansky, P., Kirchner, C., Kirchner, H., Moreau, P.E., Ringeissen, C.: An overview of ELAN. In: Kirchner, C., Kirchner, H. (eds.) Proc. of the WRLA 1998. Electr. Notes Theor. Comput. Sci., vol.\u00a015, pp. 55\u201370 (1998)","DOI":"10.1016\/S1571-0661(05)82552-6"},{"issue":"3","key":"4_CR11","first-page":"427","volume":"9","author":"H. Cirstea","year":"2001","unstructured":"Cirstea, H., Kirchner, C.: The rewriting calculus \u2014 Part\u00a0I and II. Logic Journal of the Interest Group in Pure and Applied Logics\u00a09(3), 427\u2013498 (2001)","journal-title":"Logic Journal of the Interest Group in Pure and Applied Logics"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-56610-4_83","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"A. Corradini","year":"1993","unstructured":"Corradini, A.: Term rewriting in CT \u03a3. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 468\u2013484. Springer, Heidelberg (1993)"},{"key":"4_CR13","unstructured":"Corradini, A., Drewes, F.: (Cyclic) term graph rewriting is adequate for rational parallel term rewriting. Tech. Rep. TR-97-14, Dipartimento di Informatica, Pisa (1997)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1051\/ita:1999128","volume":"33","author":"A. Corradini","year":"1999","unstructured":"Corradini, A., Gadducci, F.: Rewriting on cyclic structures: Equivalence of operational and categorical descriptions. Theoretical Informatics and Applications\u00a033, 467\u2013493 (1999)","journal-title":"Theoretical Informatics and Applications"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1145\/177492.177577","volume":"16","author":"J.R. Kennaway","year":"1994","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: On the adequacy of graph rewriting for simulating term rewriting. ACM Transactions on Programming Languages and Systems\u00a016(3), 493\u2013523 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR16","unstructured":"Kirchner, C., Qian, Z., Singh, P.K., Stuber, J.: Xemantics: a rewriting calculus-based semantics of XSLT. Tech. Rep. A01-R-386, Loria Inria (2002)"},{"issue":"1-3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2008.01.019","volume":"398","author":"J.W. Klop","year":"2008","unstructured":"Klop, J.W., van Oostrom, V., de Vrijer, R.: Lambda calculus with patterns. Theor. Comput. Sci.\u00a0398(1-3), 16\u201331 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Lamping, J.: An algorithm for optimal lambda calculus reduction. In: Proc. of POPL 1990, pp. 16\u201330. ACM (1990)","DOI":"10.1145\/96709.96711"},{"key":"4_CR19","unstructured":"Peyton-Jones, S.: The implementation of functional programming languages. Prentice Hall, Inc. (1987)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Plump, D.: Term graph rewriting. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a02, pp. 3\u201361 (1999)","DOI":"10.1142\/9789812815149_0001"},{"volume-title":"Term graph rewriting: theory and practice","year":"1993","key":"4_CR21","unstructured":"Sleep, M.R., Plasmeijer, M.J., van Eekelen, M.C.J.D. (eds.): Term graph rewriting: theory and practice. Wiley, London (1993)"},{"key":"4_CR22","unstructured":"Van Eekelen, M., Plasmeijer, R.: Functional Programming and Parallel Graph Rewriting. Addison-Wesley (1993)"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28412-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T17:29:38Z","timestamp":1593710978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28412-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642284113","9783642284120"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28412-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}