{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:29:37Z","timestamp":1761596977543,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T00:00:00Z","timestamp":1152489600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,10]]},"DOI":"10.1145\/1140335.1140351","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"121-132","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Computing constructor forms with non terminating rewrite programs"],"prefix":"10.1145","author":[{"given":"Isabelle","family":"Gnaedig","sequence":"first","affiliation":[{"name":"LORIA-INRIA"}]},{"given":"H\u00e9l\u00e8ne","family":"Kirchner","sequence":"additional","affiliation":[{"name":"LORIA-CNRS"}]}],"member":"320","published-online":{"date-parts":[[2006,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Pont-\u00e0-Mousson (France)","author":"Borovansk\u00fd P.","year":"1998","unstructured":"P. Borovansk\u00fd , C. Kirchner , H. Kirchner , P.-E. Moreau , and C. Ringeissen . An Overview of ELAN. In C. Kirchner and H. Kirchner, editors , Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Pont-\u00e0-Mousson (France) , Sept. 1998 . Elsevier Science Publishers B. V. (North-Holland). P. Borovansk\u00fd, C. Kirchner, H. Kirchner, P.-E. Moreau, and C. Ringeissen. An Overview of ELAN. In C. Kirchner and H. Kirchner, editors, Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Pont-\u00e0-Mousson (France), Sept. 1998. Elsevier Science Publishers B. V. (North-Holland)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00005-9"},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/978-3-662-21551-7_25","volume-title":"Proceedings 5th Conference on Rewriting Techniques and Applications, Montreal (Canada)","author":"Caron A.-C.","year":"1993","unstructured":"A.-C. Caron , J.-L. Coquide , and M. Dauchet . Encompassment properties and automata with constraints . In C. Kirchner, editor, Proceedings 5th Conference on Rewriting Techniques and Applications, Montreal (Canada) , volume 690 of Lecture Notes in Computer Science , pages 328 -- 342 . Springer-Verlag , 1993 . A.-C. Caron, J.-L. Coquide, and M. Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, Proceedings 5th Conference on Rewriting Techniques and Applications, Montreal (Canada), volume 690 of Lecture Notes in Computer Science, pages 328--342. Springer-Verlag, 1993."},{"key":"e_1_3_2_1_5_1","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proceedings of the 1st International Workshop on Rewriting Logic and its Applications","author":"Clavel M.","year":"1996","unstructured":"M. Clavel , S. Eker , P. Lincoln , and J. Meseguer . Principles of Maude . In J. Meseguer, editor, Proceedings of the 1st International Workshop on Rewriting Logic and its Applications , volume 5 of Electronic Notes in Theoretical Computer Science , Asilomar, Pacific Grove, CA, USA , September 1996 . North Holland . M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In J. Meseguer, editor, Proceedings of the 1st International Workshop on Rewriting Logic and its Applications, volume 5 of Electronic Notes in Theoretical Computer Science, Asilomar, Pacific Grove, CA, USA, September 1996. North Holland."},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/3-540-16780-3_85","volume-title":"Proceedings 8th International Conference on Automated Deduction","author":"Comon H.","year":"1986","unstructured":"H. Comon . Sufficient completeness, term rewriting system and anti-unification . In J. Siekmann, editor, Proceedings 8th International Conference on Automated Deduction , Oxford (UK), volume 230 of Lecture Notes in Computer Science , pages 128 -- 140 . Springer-Verlag , 1986 . H. Comon. Sufficient completeness, term rewriting system and anti-unification. In J. Siekmann, editor, Proceedings 8th International Conference on Automated Deduction, Oxford (UK), volume 230 of Lecture Notes in Computer Science, pages 128--140. Springer-Verlag, 1986."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044450813-3\/50016-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/788019.788843"},{"key":"e_1_3_2_1_9_1","volume-title":"CiME version 2","author":"Contejean E.","year":"2000","unstructured":"E. Contejean , C. March\u00e9 , B. Monate , and X. Urbain . CiME version 2 , 2000 . http:\/\/cime.lri.fr\/. E. Contejean, C. March\u00e9, B. Monate, and X. Urbain. CiME version 2, 2000. http:\/\/cime.lri.fr\/."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90026-3"},{"key":"e_1_3_2_1_11_1","first-page":"244","volume-title":"Rewrite Systems","author":"Dershowitz N.","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud . Handbook of Theoretical Computer Science , volume B, chapter 6 : Rewrite Systems , pages 244 -- 320 . Elsevier Science Publishers B. V. (North-Holland) , 1990 . Also as: Research report 478, LRI. N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244--320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00359-0"},{"key":"e_1_3_2_1_13_1","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Selected papers of the 4th International Workshop on Strategies in Automated Deduction","author":"Fissore O.","year":"2001","unstructured":"O. Fissore , I. Gnaedig , and H. Kirchner . Termination of rewriting with local strategies . In M. P. Bonacina and B. Gramlich, editors, Selected papers of the 4th International Workshop on Strategies in Automated Deduction , volume 58 of Electronic Notes in Theoretical Computer Science . Elsevier Science Publishers B. V. (North-Holland) , 2001 . O. Fissore, I. Gnaedig, and H. Kirchner. Termination of rewriting with local strategies. In M. P. Bonacina and B. Gramlich, editors, Selected papers of the 4th International Workshop on Strategies in Automated Deduction, volume 58 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers B. V. (North-Holland), 2001."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 4th International Workshop on Rewriting Logic and Its Applications","volume":"71","author":"Fissore O.","year":"2002","unstructured":"O. Fissore , I. Gnaedig , and H. Kirchner . Outermost ground termination . In Proceedings of the 4th International Workshop on Rewriting Logic and Its Applications , volume 71 of Electronic Notes in Theoretical Computer Science, Pisa, Italy , September 2002 . Elsevier Science Publishers B. V. (North-Holland). O. Fissore, I. Gnaedig, and H. Kirchner. Outermost ground termination. In Proceedings of the 4th International Workshop on Rewriting Logic and Its Applications, volume 71 of Electronic Notes in Theoretical Computer Science, Pisa, Italy, September 2002. Elsevier Science Publishers B. V. (North-Holland)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31862-0_26"},{"key":"e_1_3_2_1_16_1","volume-title":"Nancy (France)","author":"Fissore O.","year":"2004","unstructured":"O. Fissore , I. Gnaedig , and H. Kirchner . Proving weak termination also provides the right way to terminate - Extended version. Technical report, LORIA , Nancy (France) , March 2004 . Available at http:\/\/www.loria.fr\/~gnaedig\/PAPERS\/REPORTS\/wt-extended- 2004.ps. O. Fissore, I. Gnaedig, and H. Kirchner. Proving weak termination also provides the right way to terminate - Extended version. Technical report, LORIA, Nancy (France), March 2004. Available at http:\/\/www.loria.fr\/~gnaedig\/PAPERS\/REPORTS\/wt-extended-2004.ps."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/523981.852154"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39813-4_11"},{"key":"e_1_3_2_1_19_1","volume-title":"Nancy (France), 2006","author":"Gnaedig I.","year":"2006","unstructured":"I. Gnaedig and H. Kirchner . Computing Constructor Forms with Non Terminating Rewrite Programs - Extended version. Technical report, LORIA , Nancy (France), 2006 . Available at http:\/\/www.loria.fr\/~gnaedig\/PAPERS\/REPORTS\/comp-extended- 2006 .pdf. I. Gnaedig and H. Kirchner. Computing Constructor Forms with Non Terminating Rewrite Programs - Extended version. Technical report, LORIA, Nancy (France), 2006. Available at http:\/\/www.loria.fr\/~gnaedig\/PAPERS\/REPORTS\/comp-extended-2006.pdf."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90006-X"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90062-X"},{"key":"e_1_3_2_1_23_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/3-540-16780-3_83","volume-title":"Proceedings 8th International Conference on Automated Deduction","author":"Kapur D.","year":"1986","unstructured":"D. Kapur , P. Narendran , and H. Zhang . Proof by induction using test sets . In Proceedings 8th International Conference on Automated Deduction , Oxford (UK), volume 230 of Lecture Notes in Computer Science , pages 99 -- 117 . Springer-Verlag , 1986 . D. Kapur, P. Narendran, and H. Zhang. Proof by induction using test sets. In Proceedings 8th International Conference on Automated Deduction, Oxford (UK), volume 230 of Lecture Notes in Computer Science, pages 99--117. Springer-Verlag, 1986."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00292110"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/151257.151260"},{"key":"e_1_3_2_1_26_1","series-title":"Lecture Notes in Computer Science","first-page":"348","volume-title":"Proceedings EUROCAL Conference, Linz (Austria)","author":"Kounalis E.","year":"1985","unstructured":"E. Kounalis . Completeness in data type specifications . In B. Buchberger, editor, Proceedings EUROCAL Conference, Linz (Austria) , volume 204 of Lecture Notes in Computer Science , pages 348 -- 362 . Springer-Verlag , 1985 . E. Kounalis. Completeness in data type specifications. In B. Buchberger, editor, Proceedings EUROCAL Conference, Linz (Austria), volume 204 of Lecture Notes in Computer Science, pages 348--362. Springer-Verlag, 1985."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90279-O"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90033-E"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"P.-E.\n      Moreau C.\n      Ringeissen and \n      M.\n      Vittek\n  . \n  A Pattern Matching Compiler for Multiple Target Languages\n  . In G. Hedin editor 12th Conference on Compiler Construction Warsaw (Poland) volume \n  2622\n   of \n  LNCS pages \n  61\n  --\n  76\n  . \n  Springer-Verlag May \n  2003\n  .   P.-E. Moreau C. Ringeissen and M. Vittek. A Pattern Matching Compiler for Multiple Target Languages. In G. Hedin editor 12th Conference on Compiler Construction Warsaw (Poland) volume 2622 of LNCS pages 61--76. Springer-Verlag May 2003.","DOI":"10.1007\/3-540-36579-6_5"},{"key":"e_1_3_2_1_30_1","volume-title":"6th GI Conference","volume":"145","author":"Nipkow T.","year":"1983","unstructured":"T. Nipkow and G. Weikum . A decidability result about sufficient completeness of axiomatically specified abstract data types . In 6th GI Conference , volume 145 of Lecture Notes in Computer Science, pages 257--268. Springer-Verlag , 1983 . T. Nipkow and G. Weikum. A decidability result about sufficient completeness of axiomatically specified abstract data types. In 6th GI Conference, volume 145 of Lecture Notes in Computer Science, pages 257--268. Springer-Verlag, 1983."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80005-X"}],"event":{"name":"PPDP06: Principles and Practice of Declarative Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Venice Italy","acronym":"PPDP06"},"container-title":["Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140335.1140351","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1140335.1140351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:24Z","timestamp":1750259184000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140335.1140351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,10]]},"references-count":29,"alternative-id":["10.1145\/1140335.1140351","10.1145\/1140335"],"URL":"https:\/\/doi.org\/10.1145\/1140335.1140351","relation":{},"subject":[],"published":{"date-parts":[[2006,7,10]]},"assertion":[{"value":"2006-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}