{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:26:59Z","timestamp":1725550019127},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_10","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:08:27Z","timestamp":1129817307000},"page":"113-127","source":"Crossref","is-referenced-by-count":3,"title":["The Graph Rewriting Calculus: Confluence and Expressiveness"],"prefix":"10.1007","author":[{"given":"Clara","family":"Bertolissi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3-4","key":"10_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":"10_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":"10_CR3","volume-title":"Studies in Logic and the Foundation of Mathematics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda-Calculus, its syntax and semantics. In: Studies in Logic and the Foundation of Mathematics, 2nd edn. Elsevier, Amsterdam (1984)","edition":"2"},{"key":"10_CR4","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.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":"10_CR5","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1145\/604131.604152","volume-title":"Proc. of POPL 2003","author":"G. Barthe","year":"2003","unstructured":"Barthe, G., Cirstea, H., Kirchner, C., Liquori, L.: Pure Pattern Type Systems. In: Proc. of POPL 2003, pp. 250\u2013261. ACM Press, New York (2003)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bertolissi, C.: The graph rewriting calculus: proof of confluence and simulation of TGRs. Technical report, INRIA-LORIA (2005)","DOI":"10.1007\/11560586_10"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Bertolissi, C., Baldan, P., Cirstea, H., Kirchner, C.: A rewriting calculus for cyclic higher-order term graphs. In: Proc. of TERMGRAPH 2004. ENTCS, vol.\u00a0127(5), pp. 21\u201341 (2005)","DOI":"10.1016\/j.entcs.2005.01.034"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Cirstea, H., Faure, G., Kirchner, C.: A \u03c1-calculus of explicit constraint application. In: Proc. of WRLA 2004. ENTCS, vol.\u00a0117, pp. 51\u201367 (2004)","DOI":"10.1016\/j.entcs.2004.06.029"},{"issue":"3","key":"10_CR9","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":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-24849-1_10","volume-title":"Types for Proofs and Programs","author":"H. Cirstea","year":"2004","unstructured":"Cirstea, H., Liquori, L., Wack, B.: Rewriting calculus with fixpoints: Untyped and first-order systems. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol.\u00a03085, pp. 147\u2013171. Springer, Heidelberg (2004)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/3-540-56610-4_83","volume-title":"TAPSOFT 1993: 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.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 468\u2013484. Springer, Heidelberg (1993)"},{"issue":"1-2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination of rewriting. Journal Symbolic Computation\u00a03(1-2), 69\u2013116 (1987)","journal-title":"Journal Symbolic Computation"},{"key":"10_CR13","first-page":"83","volume-title":"Proc. of POPL 1984","author":"J.-P. Jouannaud","year":"1984","unstructured":"Jouannaud, J.-P., Kirchner, H.: Completion of a set of rules modulo a set of equations. In: Proc. of POPL 1984, pp. 83\u201392. ACM Press, New York (1984)"},{"key":"10_CR14","unstructured":"Klop, J.W.: Combinatory Reduction Systems. PhD thesis, CWI (1980)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1145\/1013963.1013983","volume-title":"Proc. of PPDP 2004","author":"L. Liquori","year":"2004","unstructured":"Liquori, L., Serpette, B.: iRho: an Imperative Rewriting Calculus. In: Proc. of PPDP 2004, pp. 167\u2013178. ACM Press, New York (2004)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0052358","volume-title":"Rewriting Techniques and Applications","author":"E. Ohlebusch","year":"1998","unstructured":"Ohlebusch, E.: Church-Rosser theorems for abstract reduction modulo an equivalence relation. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol.\u00a01379, pp. 17\u201331. Springer, Heidelberg (1998)"},{"key":"10_CR17","first-page":"233","volume":"28","author":"G. Peterson","year":"1981","unstructured":"Peterson, G., Stickel, M.E.: Complete sets of reductions for some equational theories. J.\u00a0ACM\u00a028, 233\u2013264 (1981)","journal-title":"J.\u00a0ACM"},{"volume-title":"Term graph rewriting: theory and practice","year":"1993","key":"10_CR18","unstructured":"Sleep, M.R., Plasmeijer, M.J., van Eekelen, M.C.J.D. (eds.): Term graph rewriting: theory and practice. Wiley, Chichester (1993)"},{"key":"10_CR19","volume-title":"Draft notes","author":"B. Wack","year":"2003","unstructured":"Wack, B.: Klop counter example in the \u03c1-calculus. In: Draft notes, LORIA, Nancy (2003)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:50:31Z","timestamp":1605642631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11560586_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}