{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:32Z","timestamp":1725664712471},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630456"},{"type":"electronic","value":"9783540690658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63045-7_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:00:34Z","timestamp":1330297234000},"page":"283-293","source":"Crossref","is-referenced-by-count":3,"title":["Type introduction for equational rewriting"],"prefix":"10.1007","author":[{"given":"Hitoshi","family":"Ohsaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aart","family":"Middeldorp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz, Termination of Rewriting, Journal of Symbolic Computation 3 (1987) 69\u2013116.","journal-title":"Journal of Symbolic Computation"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, in: Handbook of Theoretical Computer Science, Vol. B (ed. J. van Leeuwen), North-Holland (1990) 243\u2013320","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"N. Dershowitz and Z. Manna, Proving Termination with Multiset Orderings, Communications of the ACM 22 (1979) 465\u2013476.","journal-title":"Communications of the ACM"},{"key":"29_CR4","first-page":"78","volume":"1103","author":"M.C.F. Ferreira","year":"1996","unstructured":"M.C.F. Ferreira, Dummy Elimination in Equational Rewriting, Proc. 7th RTA, New Brunswick, LNCS 1103 (1996) 78\u201392.","journal-title":"LNCS"},{"key":"29_CR5","first-page":"243","volume":"965","author":"M.C.F. Ferreira","year":"1995","unstructured":"M.C.F. Ferreira and H. Zantema, Dummy Elimination: Making Termination Easier, Proc. 10th FCT, Dresden, LNCS 965 (1995) 243\u2013252.","journal-title":"LNCS"},{"key":"29_CR6","unstructured":"A. Geser, A. Middeldorp, E. Ohlebusch, and H. Zantema, Relative Undecidability in Term Rewriting, Proc. CSL, Utrecht, LNCS (1996). To appear. Available at http:\/\/www.score.is.tsukuba.ac.jp\/\u223cami\/papers\/cs196.dvi."},{"key":"29_CR7","first-page":"175","volume":"170","author":"J.-P. Jouannaud","year":"1984","unstructured":"J.-P. Jouannaud and M. Mu\u00f1oz, Termination of a Set of Rules Modulo a Set of Equations, Proc. 7th CADE, Napa, LNCS 170 (1984) 175\u2013193.","journal-title":"LNCS"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"D. Kapur and G. Sivakumar, A Total, Ground Path Ordering for Proving Termination of AC-Rewrite Systems, Proc. 8th RTA, Sitges, LNCS (1997). To appear.","DOI":"10.1007\/3-540-62950-5_67"},{"key":"29_CR9","unstructured":"J.W. Klop, Term Rewriting Systems, in: Handbook of Logic in Computer Science, Vol. 2 (eds. S. Abramsky, D. Gabbay and T. Maibaum), Oxford University Press (1992) 1\u2013116."},{"key":"29_CR10","first-page":"115","volume":"6","author":"A. Middeldorp","year":"1995","unstructured":"A. Middeldorp and B. Gramlich, Simple Termination is Difficult, Applicable Algebra in Engineering, Communication and Computing 6 (1995) 115\u2013128.","journal-title":"Communication and Computing"},{"key":"29_CR11","first-page":"178","volume":"49","author":"E. Ohlebusch","year":"1993","unstructured":"E. Ohlebusch, A Simple Proof of Sufficient Conditions for the Termination of the Disjoint Union of Term Rewriting Systems, Bulletin of the EATCS 49 (1993) 178\u2013183.","journal-title":"Bulletin of the EATCS"},{"key":"29_CR12","unstructured":"J. van de Pol, Modularity in Many-Sorted Term Rewriting Systems, Master's thesis, report INF\/SCR-92-37, Utrecht University (1992)."},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(94)00276-2","volume":"142","author":"A. Rubio","year":"1995","unstructured":"A. Rubio and R. Nieuwenhuis, A Total AC-Compatible Ordering Based on RPO, Theoretical Computer Science 142 (1995) 209\u2013227.","journal-title":"Theoretical Computer Science"},{"key":"29_CR14","unstructured":"J. Steinbach, Termination of Rewriting: Extensions, Comparison and Automatic Generation of Simplification Orderings, Ph.D. thesis, Universit\u00e4t Kaiserslautern (1994)."},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1006\/jsco.1994.1003","volume":"17","author":"H. Zantema","year":"1994","unstructured":"H. Zantema, Termination of Term Rewriting: Interpretation and Type Elimination, Journal of Symbolic Computation 17 (1994) 23\u201350.","journal-title":"Journal of Symbolic Computation"},{"key":"29_CR16","unstructured":"H. Zantema and A. Geser, Non-Looping Rewriting, report UU-CS-1996-03, Utrecht University, Department of Computer Science (1996). Available at ftp:\/\/ftp.cs.ruu.nl\/pub\/RUU\/CS\/techreps\/CS-1996\/1996-03.ps.gz."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63045-7_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:41:18Z","timestamp":1619574078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63045-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630456","9783540690658"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-63045-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}