{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:34:44Z","timestamp":1649118884138},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":1976,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1016\/j.entcs.2008.03.034","type":"journal-article","created":{"date-parts":[[2008,4,2]],"date-time":"2008-04-02T16:57:30Z","timestamp":1207155450000},"page":"65-77","source":"Crossref","is-referenced-by-count":1,"title":["Intensional Properties of Polygraphs"],"prefix":"10.1016","volume":"203","author":[{"given":"Guillaume","family":"Bonfante","sequence":"first","affiliation":[]},{"given":"Yves","family":"Guiraud","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.entcs.2008.03.034_bib001","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1017\/S0956796800003877","article-title":"Algorithms with polynomial interpretation termination proofs","volume":"11","author":"Bonfante","year":"2001","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/j.entcs.2008.03.034_bib002","unstructured":"Guillaume Bonfante and Yves Guiraud, Programs as polygraphs: computability and complexity, Logical Methods in Computer Science (in press), 2006"},{"issue":"1","key":"10.1016\/j.entcs.2008.03.034_bib003","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(93)90054-W","article-title":"Higher-dimensional word problems with applications to equational logic","volume":"115","author":"Burroni","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2008.03.034_bib004","first-page":"139","article-title":"Polynomial interpretations and the complexity of algorithms","volume":"607","author":"Cichon","year":"1992"},{"issue":"3","key":"10.1016\/j.entcs.2008.03.034_bib005","doi-asserted-by":"crossref","first-page":"952","DOI":"10.2307\/2275767","article-title":"Tailoring recursion for complexity","volume":"60","author":"Grdel","year":"1995","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"10.1016\/j.entcs.2008.03.034_bib006","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.jpaa.2005.10.011","article-title":"Termination orders for 3-dimensional rewriting","volume":"207","author":"Guiraud","year":"2006","journal-title":"Journal of Pure and Applied Algebra"},{"issue":"1\u20132","key":"10.1016\/j.entcs.2008.03.034_bib007","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.apal.2005.12.012","article-title":"The three dimensions of proofs","volume":"141","author":"Guiraud","year":"2006","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/j.entcs.2008.03.034_bib008","unstructured":"Yves Guiraud, Polygraphs for termination of left-linear term rewriting systems, Preprint, 2007"},{"key":"10.1016\/j.entcs.2008.03.034_bib009","series-title":"Principles of Programming Languages","first-page":"95","article-title":"Interaction nets","author":"Lafont","year":"1990"},{"issue":"2\u20133","key":"10.1016\/j.entcs.2008.03.034_bib010","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0022-4049(03)00069-0","article-title":"Towards an algebraic theory of boolean circuits","volume":"184","author":"Lafont","year":"2003","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/j.entcs.2008.03.034_bib011","unstructured":"Yves Lafont, Algebra and geometry of rewriting, To appear in Applied Categorical Structures, 2006"},{"key":"10.1016\/j.entcs.2008.03.034_bib012","unstructured":"Yves Lafont and Franois Mtayer, Polygraphic resolutions and homology of monoids, Preprint IML, 2006"},{"key":"10.1016\/j.entcs.2008.03.034_bib013","unstructured":"Dallas Lankford, On proving term rewriting systems are noetherian, Tech. report, Louisiana Tech University, 1979"},{"key":"10.1016\/j.entcs.2008.03.034_bib014","first-page":"148","article-title":"Resolutions by polygraphs","volume":"11","author":"Mtayer","year":"2003","journal-title":"Theory and Applications of Categories"},{"key":"10.1016\/j.entcs.2008.03.034_bib015","first-page":"3","article-title":"Term graph rewriting","volume":"2","author":"Plump","year":"1999"},{"key":"10.1016\/j.entcs.2008.03.034_bib016","series-title":"Theory of self-reproducing automata","author":"von Neumann","year":"1966"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066108001394?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066108001394?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T15:30:31Z","timestamp":1546183831000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066108001394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["S1571066108001394"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2008.03.034","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}