{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:32Z","timestamp":1761611072148},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90090-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"29-94","source":"Crossref","is-referenced-by-count":8,"title":["Term graph rewriting and garbage collection using opfibrations"],"prefix":"10.1016","volume":"131","author":[{"given":"R.","family":"Banach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90090-6_bib1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90024-A","article-title":"Categorical models of polymorphism","volume":"99","author":"Asperti","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)90090-6_bib2","author":"Banach","year":"1992","journal-title":"Term graph rewriting and garbage collection\u00e0la Grothendieck"},{"key":"10.1016\/0304-3975(94)90090-6_bib3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0022-4049(93)90149-N","article-title":"Weak fibrations","volume":"86","author":"Banach","year":"1993","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/0304-3975(94)90090-6_bib4","series-title":"Proc. PARLE-87","first-page":"141","article-title":"Term graph rewriting","volume":"Vol. 259","author":"Barendregt","year":"1987"},{"key":"10.1016\/0304-3975(94)90090-6_bib5","series-title":"Category Theory for Computing Science","author":"Barr","year":"1990"},{"key":"10.1016\/0304-3975(94)90090-6_bib6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.2307\/2273784","article-title":"Fibered categories and the foundations of naive category theory","volume":"50","author":"B\u00e9nabou","year":"1985","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(94)90090-6_bib7","series-title":"Proc. CAAP-91","first-page":"90","article-title":"Algebraic graph rewriting using a single pushout","volume":"Vol. 493","author":"van den Broek","year":"1991"},{"key":"10.1016\/0304-3975(94)90090-6_bib8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0890-5401(89)90068-0","article-title":"Domain theoretic models of polymorphism","volume":"81","author":"Coquand","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)90090-6_bib9","first-page":"1","article-title":"Introduction to the algebraic theory of graph grammars (a survey)","volume":"Vol. 73","author":"Ehrig","year":"1979"},{"key":"10.1016\/0304-3975(94)90090-6_bib10","series-title":"Proc. 3rd Int. Workshop on Graph Grammars","first-page":"3","article-title":"Tutorial introduction to the algebraic approach of graph grammars","volume":"Vol. 291","author":"Ehrig","year":"1986"},{"key":"10.1016\/0304-3975(94)90090-6_bib11","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1142\/S0129054190000266","article-title":"Redex capturing in term graph rewriting","volume":"1","author":"Farmer","year":"1990","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90090-6_bib12","series-title":"Report SYS-C88-08","article-title":"DACTL: some introductory papers","author":"Glauert","year":"1988"},{"key":"10.1016\/0304-3975(94)90090-6_bib13","series-title":"Report SYS-C88-11","article-title":"Final specification of DACTL","author":"Glauert","year":"1988"},{"key":"10.1016\/0304-3975(94)90090-6_bib14","series-title":"Graph Grammars and Their Application to Computer Science","first-page":"378","article-title":"DACTL: an experimental graph rewriting language","volume":"Vol. 532","author":"Glauert","year":"1990"},{"key":"10.1016\/0304-3975(94)90090-6_bib15","series-title":"Proc. La Jolla Conf. on Categorical Algebra","first-page":"21","article-title":"Fibered and cofibered categories","author":"Gray","year":"1966"},{"key":"10.1016\/0304-3975(94)90090-6_bib16","article-title":"Technique de Descente et Th\u00e9orem\u00e9s d'Existence en G\u00e9ometrie Alg\u00e9brique, I. Generalites","volume":"190","author":"Grothendieck","year":"1960"},{"key":"10.1016\/0304-3975(94)90090-6_bib17","series-title":"Seminaire de G\u00e9metrie Alg\u00e9brique de l'Institut des Hautes Etudes Scientifiques Paris","first-page":"145","article-title":"Cath\u00e9gories Fibr\u00e9es et Descente","volume":"Vol. 224","author":"Grothendieck","year":"1961"},{"key":"10.1016\/0304-3975(94)90090-6_bib18","series-title":"Proc. 5th Workshop on Specification of Abstract Data Types","first-page":"92","article-title":"Jungle evaluation","volume":"Vol. 332","author":"Habel","year":"1988"},{"key":"10.1016\/0304-3975(94)90090-6_bib19","series-title":"Proc. Internat. Workshop on Algebraic and Logic Programming","article-title":"Jungle evaluation for efficient term rewriting","volume":"Vol. 49","author":"Hoffman","year":"1988"},{"key":"10.1016\/0304-3975(94)90090-6_bib20","series-title":"Categories in Computer Science and Logic","first-page":"137","article-title":"The theory of constructions: categorical semantics and Topos-theoretic models","volume":"Vol. 92","author":"Hyland","year":"1989"},{"key":"10.1016\/0304-3975(94)90090-6_bib21","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(87)90079-X","article-title":"On \u201cOn graph rewritings\u201d","volume":"52","author":"Kennaway","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90090-6_bib22","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(90)90036-H","article-title":"Implementing term rewrite languages in DACTL","volume":"72","author":"Kennaway","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90090-6_bib23","first-page":"490","article-title":"Graph rewriting in some categories of partial morphisms","volume":"Vol. 532","author":"Kennaway","year":"1991"},{"key":"10.1016\/0304-3975(94)90090-6_bib24","article-title":"Transfinite reductions in orthogonal term rewriting systems","author":"Kennaway","year":"1990","journal-title":"CWI Report CS-9041"},{"key":"10.1016\/0304-3975(94)90090-6_bib25","series-title":"Proc. Graph-Theoretic Concepts in Computer Science","first-page":"338","article-title":"Algebraic approach to graph transformation based on single pushout derivations","volume":"Vol. 484","author":"Lowe","year":"1991"},{"key":"10.1016\/0304-3975(94)90090-6_bib26","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1017\/S0960129500000074","article-title":"A category-theoretic account of program modules","volume":"1","author":"Moggi","year":"1991","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90090-6_bib27","series-title":"Proc. 3rd Internat. Workshop on Graph Grammars","first-page":"496","article-title":"Graph rewriting with unification and composition","volume":"Vol. 291","author":"Parisi-Presicce","year":"1986"},{"key":"10.1016\/0304-3975(94)90090-6_bib28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(84)90021-5","article-title":"On graph rewritings","volume":"32","author":"Raoult","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90090-6_bib29","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(80)90013-4","article-title":"Computation on graph-like expressions","volume":"10","author":"Staples","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90090-6_bib30","first-page":"287","article-title":"Optimal evaluations of graph-like expressions","volume":"10","author":"Staples","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90090-6_bib31","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(80)90033-X","article-title":"Speeding up subtree replacement systems","volume":"11","author":"Staples","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90090-6_bib32","series-title":"Ph.D. Thesis","article-title":"Semantics and pragmatics of the lambda calculus","author":"Wadsworth","year":"1971"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900906?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900906?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:19Z","timestamp":1555129699000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594900906"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90090-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}