{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:49:11Z","timestamp":1649040551321},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0304-3975(97)00082-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"3-39","source":"Crossref","is-referenced-by-count":15,"title":["Interaction nets and term-rewriting systems"],"prefix":"10.1016","volume":"190","author":[{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"first","affiliation":[]},{"given":"Ian","family":"Mackie","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00082-0_BIB1","series-title":"Proc. HOA'93, 1st Internat. Workshop on Higher Order Algebra","first-page":"20","article-title":"Strong normalization of typeable rewrite systems","volume":"vol. 816","author":"van Bakel","year":"1994"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB2","article-title":"The algebraic theory of interaction nets","author":"Banach","year":"1995"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB3","series-title":"Proc. PARLE, Parallel Architectures and Languages","first-page":"141","article-title":"Term graph rewriting","volume":"259-II","author":"Barendregt","year":"1987"},{"issue":"1","key":"10.1016\/S0304-3975(97)00082-0_BIB4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(97)00082-0_BIB5","series-title":"Proc. of Conditional and Typed Term Rewriting Systems","article-title":"Hierarchical termination","author":"Dershowitz","year":"1995"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB6","article-title":"Rewrite systems","volume":"vol. B","author":"Dershowitz","year":"1989"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB7","series-title":"Type assignment and termination of interaction nets","author":"Fern\u00e1ndez","year":"1996"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB8","series-title":"Recent Trends in Data Type Specification, Proc. 10th Workshop on Specification of Abstract Data Types (ADT'94)","first-page":"255","article-title":"Modular termination of term rewriting systems revisited","volume":"vol. 906","author":"Fern\u00e1ndez","year":"1995"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB9","series-title":"Proc. PLILP'96, Programming Languages: Implementations, Logics, and Programs","first-page":"319","article-title":"rom term rewriting to generalised interaction nets","volume":"vol. 1140","author":"Fern\u00e1ndez","year":"1996"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB10","series-title":"Trees in Algebra and Programming \u2014 CAAP'96","first-page":"149","article-title":"Interaction nets and term rewriting systems (extended abstract)","volume":"vol. 1059","author":"Fern\u00e1ndez","year":"1996"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB11","series-title":"Theory and Formal Methods of Computing 94: Proc. 2nd Imperial College Workshop, Imperial College Press","first-page":"63","article-title":"Combinators for interaction nets","author":"Gay","year":"1995"},{"issue":"1","key":"10.1016\/S0304-3975(97)00082-0_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear Logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00082-0_BIB13","series-title":"Logic Colloquium 88, North-Holland","article-title":"Geometry of interaction 1: interpretation of system F","author":"Girard","year":"1989"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB14","series-title":"Proc. ACM Symp. Principles of Programming Languages","first-page":"15","article-title":"The geometry of optimal lambda reduction","author":"Gonthier","year":"1992"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB15","series-title":"Proof and Computation","first-page":"173","article-title":"Rewrite proofs and computations","volume":"vol. 139","author":"Jouannaud","year":"1995"},{"issue":"3","key":"10.1016\/S0304-3975(97)00082-0_BIB16","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1145\/177492.177577","article-title":"On the adequacy of graph rewriting for simulating term rewriting","volume":"16","author":"Kennaway","year":"1994","journal-title":"ACM TOPLAS"},{"issue":"1","key":"10.1016\/S0304-3975(97)00082-0_BIB17","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1006\/inco.1995.1075","article-title":"Transfinite reductions in orthogonal term rewriting systems","volume":"119","author":"Kennaway","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00082-0_BIB18","article-title":"Combinatory Reduction Systems","volume":"vol. 127","author":"Klop","year":"1980"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB19","article-title":"Term rewriting systems","volume":"vol. 2","author":"Klop","year":"1992"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB20","series-title":"Proc. FST & TCS'93","article-title":"Completeness of hierarchical combinations of term rewriting systems","volume":"vol. 761","author":"Krishna Rao","year":"1993"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB21","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0304-3975(94)00248-3","article-title":"Modularity in non-copying term rewriting","volume":"152","author":"Kurihara","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00082-0_BIB22","series-title":"Proc. 17th ACM Symp. on Principles of Programming Languages","first-page":"95","article-title":"Interaction nets","author":"Lafont","year":"1990"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB23","series-title":"Advances in Linear Logic","first-page":"225","article-title":"From proof-nets to interaction nets","volume":"vol. 222","author":"Lafont","year":"1995"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB24","article-title":"Optimality and concurrency in interaction systems","author":"Laneve","year":"1993"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB25","article-title":"The geometry of implementation","author":"Mackie","year":"1994"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB26","series-title":"Proceedings 22nd ACM Symp. on Principles of Programming Languages","first-page":"198","article-title":"The geometry of interaction machine","author":"Mackie","year":"1995"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB27","article-title":"Completeness of combinations of constructor systems","volume":"vol. 488","author":"Middeldorp","year":"1991"},{"key":"10.1016\/S0304-3975(97)00082-0_BIB28","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(87)90039-1","article-title":"On termination of the direct sum of term rewriting systems","volume":"26","author":"Rusinowitch","year":"1987","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0304-3975(97)00082-0_BIB29","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","article-title":"Counterexamples to termination for the direct sum of term rewriting systems","volume":"25","author":"Toyama","year":"1987","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0304-3975(97)00082-0_BIB30","series-title":"Proc. 3rd Rewriting Techniques and Applications","article-title":"Termination for the direct sum of left-linear term rewriting systems","volume":"vol. 355","author":"Toyama","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000820?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000820?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T01:27:04Z","timestamp":1556242024000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0304397597000820"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00082-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}