{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171629,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634553"},{"type":"electronic","value":"9783540695523"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0026983","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T11:12:36Z","timestamp":1132398756000},"page":"87-105","source":"Crossref","is-referenced-by-count":20,"title":["A 2-categorical presentation of term graph rewriting"],"prefix":"10.1007","author":[{"given":"A.","family":"Corradini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Gadducci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"Z.M. Ariola","year":"1996","unstructured":"Z.M. Ariola and J.W. Klop. Equational Term Graph Rewriting. Fundamenta Informaticae, 26:207\u2013240,1996.","journal-title":"Fundamenta Informaticae"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term graph reduction. In Proceedings PARLE, volume 259 of LNCS, pages 141\u2013158. Springer Verlag, 1987.","DOI":"10.1007\/3-540-17945-3_8"},{"key":"6_CR3","unstructured":"M. Barr and C. Wells. Category Theory for Computing Science. Prentice Hall, 1990."},{"key":"6_CR4","unstructured":"S. Bloom and Z. \u00c8sik. Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1991."},{"key":"6_CR5","unstructured":"G. Boudol. Computational semantics of term rewriting systems. In M. Nivat and J. Reynolds, editors, Algebraic Methods in Semantics, pages 170\u2013235. Cambridge University Press, 1985."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"L. Budach and H.-J. Hoenke. Automaten and Functoren. Akademie-Verlag, 1975.","DOI":"10.1515\/9783112717530"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"A. Corradini. Concurrent Graph and Term Graph Rewriting. In U. Montanari and V. Sassone, editors, Proceedings CONCUR'96, volume 1119 of LNCS, pages 438\u2013464. Springer Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_69"},{"key":"6_CR8","unstructured":"A. Corradini and F. Gadducci.An algebraic presentation of term graphs, via ps-monoidal categories.Submitted for publication. Available at http:\/\/www.di.unipi.it\/~gadducci\/papers\/aptg.ps, 1997."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"A. Corradini, F. Gadducci, and U. Montanari. Relating two categorical models of term rewriting. In Rewriting Tecniques and Applications, volume 914 of LNCS, pages 225\u2013240. Springer Verlag, 1995.","DOI":"10.1007\/3-540-59200-8_59"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0304-3975(93)90063-Y","volume":"109","author":"A. Corradini","year":"1993","unstructured":"A. Corradini and F. Rossi. Hyperedge Replacement Jungle Rewriting for Term Rewriting Systems and Logic Programming. Theoret. Comput. Sci., 109:7\u201348, 1993.","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR11","unstructured":"G. Gadducci. On the Algebraic Approach to Concurrent Term Rewriting. PhD thesis, University of Pisa \u2014 Department of Computer Science, 1996."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"J.A. Goguen, J.W. Tatcher, E.G. Wagner, and J.R Wright. Some Fundamentals of Order-Algebraic Semantics. In Mathematical Foundations of Computer Science, volume 45 of LNCS, pages 153\u2013168. Springer Verlag, 1976.","DOI":"10.1007\/3-540-07854-1_169"},{"key":"6_CR13","first-page":"445","volume":"25","author":"B. Hofmann","year":"1991","unstructured":"B. Hofmann and D. Plump. Implementing Term Rewriting by Jungle Evaluation. Informatique th\u00e8orique et Applications\/Theoretical Informatics and Applications, 25:445\u2013472, 1991.","journal-title":"Informatique th\u00e8orique et Applications\/Theoretical Informatics and Applications"},{"key":"6_CR14","unstructured":"G. Huet and J-J. L\u00e9vy. Computations in Orthogonal Rewriting Systems, I. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in honour of J. A. Robinson, pages 395\u2013414. MIT Press, 1991."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0168-0072(94)90020-5","volume":"69","author":"B. Jacobs","year":"1994","unstructured":"B. Jacobs. Semantics of Weakening and Contraction. Annals of Pure and Applied Logic, 69:73\u2013106, 1994.","journal-title":"Annals of Pure and Applied Logic"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"G.M. Kelly and R.H. Street. Review of the elements of 2-categories. volume 420 of Lecture Notes in Mathematics, pages 75\u2013103. Springer Verlag, 1974.","DOI":"10.1007\/BFb0063101"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1145\/177492.177577","volume":"16","author":"J.R. Kennaway","year":"1994","unstructured":"J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. On the Adequacy of Graph Rrewriting for Simulating Term Rewriting. ACM Trans. Program. Lang. Syst., 16:493\u2013523, 1994.","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"A. Kock and G.E. Reyes. Doctrines in Categorical Logic. In J. Bairwise, editor, Handbook of Mathematical Logic, pages 283\u2013313. North Holland, 1977.","DOI":"10.1016\/S0049-237X(08)71104-2"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Y. Lafont. Equational Reasoning with 2-dimensional Diagrams. In Term Rewriting, French Spring School of Theoretical Computer Science, volume 909 of LNCS, pages 170\u2013195. Springer Verlag, 1995.","DOI":"10.1007\/3-540-59340-3_13"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1017\/S0960129500000980","volume":"6","author":"C. Laneve","year":"1996","unstructured":"C. Laneve and U. Montanari. Axiomatizing permutation equivalence in the \u03bb-\u03bb-calculus. Mathematical Structures in Computer Science, 6:219\u2013249, 1996.","journal-title":"Mathematical Structures in Computer Science"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1073\/pnas.50.5.869","volume":"50","author":"F.W. Lawvere","year":"1963","unstructured":"F.W. Lawvere. Functorial Semantics of Algebraic Theories. Proc. National Academy of Science, 50:869\u2013872, 1963.","journal-title":"Proc. National Academy of Science"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"S. Mac Lane. Categories for the working mathematician. Springer Verlag, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci., 96:73\u2013155, 1992.","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR24","unstructured":"M.J. Plasmeijer and M.C.J.D. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison Wesley, 1993."},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"A.J. Power. An abstract formulation for rewrite systems. In Proceedings Category Theory in Computer Science, volume 389 of LNCS, pages 300\u2013312. Springer Verlag, 1989.","DOI":"10.1007\/BFb0018358"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"D.E. Rydehard and E.G. Stell. Foundations of equational deductions: A categorical treatment of equational proofs and unification algorithms. In Proceedings Category Theory in Computer Science, volume 283 of LNCS, pages 114\u2013139. Springer Verlag, 1987.","DOI":"10.1007\/3-540-18508-9_23"},{"volume-title":"Term Graph Rewriting: Theory and Practice","year":"1993","key":"6_CR27","unstructured":"M.R. Sleep, M.J. Plasmeijer, and M.C. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. Wiley, London, 1993."},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0304-3975(80)90013-4","volume":"10","author":"J. Staples","year":"1980","unstructured":"J. Staples. Computation of graph-like expressions. Theoret. Comput. Sci., 10:171\u2013195, 1980.","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR29","unstructured":"J.G. Stell. Categorical Aspects of Unification and Rewriting. PhD thesis, University of Manchester, 1992."},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"R. Street. Categorical structures. In M. Hazewinkel, editor, Handbook of Algebra, pages 529\u2013577. Elsevier, 1996. *** DIRECT SUPPORT *** A0008C33 00003","DOI":"10.1016\/S1570-7954(96)80019-2"}],"container-title":["Lecture Notes in Computer Science","Category Theory and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:15:29Z","timestamp":1736104529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026983"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634553","9783540695523"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0026983","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}