{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T05:59:42Z","timestamp":1787723982867,"version":"build-2784847793"},"reference-count":74,"publisher":"Cambridge University Press (CUP)","issue":"1-2","license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2007,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The application of automatic transformation processes during the formal development and optimization of programs can introduce encumbrances in the generated code that programmers usually (or presumably) do not write. An example is the introduction of redundant arguments in the functions defined in the program. Redundancy of a parameter means that replacing it by any expression does not change the result. In this work, we provide methods for the analysis and elimination of redundant arguments in term rewriting systems as a model for the programs that can be written in more sophisticated languages. On the basis of the uselessness of redundant arguments, we also propose an erasure procedure which may avoid wasteful computations while still preserving the semantics (under ascertained conditions). A prototype implementation of these methods has been undertaken, which demonstrates the practicality of our approach.<\/jats:p>","DOI":"10.1017\/s1471068406002869","type":"journal-article","created":{"date-parts":[[2007,2,9]],"date-time":"2007-02-09T12:38:10Z","timestamp":1171024690000},"page":"3-35","source":"Crossref","is-referenced-by-count":2,"title":["Removing redundant arguments automatically"],"prefix":"10.1017","volume":"7","author":[{"given":"M.","family":"ALPUENTE","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"ESCOBAR","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"LUCAS","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2007,1,1]]},"reference":[{"key":"S1471068406002869_N10C35","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"},{"key":"S1471068406002869_N10BE9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18317-5_21"},{"key":"S1471068406002869_N10BCA","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00395-2"},{"key":"S1471068406002869_N10BAD","first-page":"121","article-title":"A Survey of Program Slicing Techniques","volume":"3","author":"Tip","year":"1995","journal-title":"Journal of Programming Languages"},{"key":"S1471068406002869_N10B61","doi-asserted-by":"publisher","DOI":"10.1007\/BF01691346"},{"key":"S1471068406002869_N10B21","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013280119003"},{"key":"S1471068406002869_N1025C","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752"},{"key":"S1471068406002869_N10AF5","first-page":"169","volume-title":"16th Annual ACM Symposium on Principles of Programming Languages, POPL'89","author":"Sekar","year":"1990"},{"key":"S1471068406002869_N10877","first-page":"83","volume-title":"Proceedings of the 6th International Workshop on Logic Program Synthesis and Transformation (LOPSTR'96)","author":"Leuschel","year":"1996"},{"key":"S1471068406002869_N10496","first-page":"165","volume-title":"Proc. of PLILP'94. Lecture Notes in Computer Science","author":"Gl\u00fcck","year":"1994"},{"key":"S1471068406002869_N10B84","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"Thomas","year":"1990"},{"key":"S1471068406002869_N10687","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Proc. of 7th International Conference on Rewriting Techniques and Applications, RTA'96","author":"Jacquemard","year":"1996"},{"key":"S1471068406002869_N109C3","first-page":"116","article-title":"Escape Analysis on Lists","volume":"27","author":"Park","year":"1992","journal-title":"Proceedings of the International Conference on Programming Language Design and Implementation (PLDI'92)"},{"key":"S1471068406002869_N10331","volume-title":"Proc. of 6th International Workshop on Termination, WST'03","author":"Contejean","year":"2003"},{"key":"S1471068406002869_N106D9","first-page":"54","volume-title":"Proc of International Conference on Functional Programming Languages and Computer Architecture","author":"Jones","year":"1989"},{"key":"S1471068406002869_N105B7","first-page":"1","article-title":"An Evaluation Semantics for Narrowing-Based Functional Logic Languages","volume":"2001","author":"Hanus","year":"2001","journal-title":"Journal of Functional and Logic Programming"},{"key":"S1471068406002869_N10611","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00008-7"},{"key":"S1471068406002869_N101AF","first-page":"151","volume-title":"Proc. of the ACM SIGPLAN Conf. on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'97","author":"Alpuente","year":"1997"},{"key":"S1471068406002869_N104BC","volume-title":"International Joint Conference on Automated Deduction, IJCAR'04","author":"Godoy","year":"2004"},{"key":"S1471068406002869_N10ACF","first-page":"317","volume-title":"Proc. of the 3rd International Static Analysis Symposium, SAS'96","author":"Schoenig","year":"1996"},{"key":"S1471068406002869_N10C0F","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292567"},{"key":"S1471068406002869_N108A6","unstructured":"Liu Y. A. and Stoller S. D. 2002. Eliminating dead code on recursive data. Science of Computer Programming."},{"key":"S1471068406002869_N10630","first-page":"395","volume-title":"Computational logic: Essays in honour of J. Alan Robinson","author":"Huet","year":"1991"},{"key":"S1471068406002869_N10314","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2838"},{"key":"S1471068406002869_N102E8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16446-4_3"},{"key":"S1471068406002869_N10A0F","first-page":"355","volume-title":"Proc. of the 1996 Dagstuhl Seminar on Partial Evaluation","author":"Pettorossi","year":"1996"},{"key":"S1471068406002869_N1098C","first-page":"347","article-title":"The reachability and joinability problems for right-ground term rewriting systems","volume":"13","author":"Oyamaguchi","year":"1990","journal-title":"Journal of Information Processing"},{"key":"S1471068406002869_N10B4D","volume-title":"Term Rewriting Systems","year":"2003"},{"key":"S1471068406002869_N10757","first-page":"254","volume-title":"Proceedings of the ALP'96","author":"Kennaway","year":"1996"},{"key":"S1471068406002869_N1083A","first-page":"230","volume-title":"Proc. of the 5th International Static Analysis Symposium, SAS'98","author":"Leuschel","year":"1998"},{"key":"S1471068406002869_N1094B","volume-title":"XIX Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM'92","author":"Mycroft","year":"1992"},{"key":"S1471068406002869_N105DE","volume-title":"Proc. of 16h International Conference on Rewriting Techniques and Applications, RTA'05","author":"Hendrix","year":"2005"},{"key":"S1471068406002869_N10A35","doi-asserted-by":"publisher","DOI":"10.1145\/234528.234529"},{"key":"S1471068406002869_N1036B","doi-asserted-by":"publisher","DOI":"10.1109\/ICCL.1994.288389"},{"key":"S1471068406002869_N10248","unstructured":"Arts T. and Giesl J. 2001. A collection of examples for termination of term rewriting using dependency pairs. Tech. Rep. AIB-2001-09, RWTH Aachen, Germany."},{"key":"S1471068406002869_N106B0","doi-asserted-by":"publisher","DOI":"10.1007\/3540543961_17"},{"key":"S1471068406002869_N102A8","first-page":"178","volume-title":"Proc. of Third Int'l Workshop on Static Analysis, WSA'93","author":"Bert","year":"1993"},{"key":"S1471068406002869_N10728","doi-asserted-by":"publisher","DOI":"10.1007\/BF01893885"},{"key":"S1471068406002869_N103E7","first-page":"4","volume-title":"Proc. of CADE'97","author":"Durand","year":"1997"},{"key":"S1471068406002869_N100F8","unstructured":"Aho A. , Sethi R. and Ullman J. 1986. Compilers, Principles Techniques and Tools. Addison-Wesley, Reading, MA."},{"key":"S1471068406002869_N10116","first-page":"100","volume-title":"Proc. of the 11th Int'l Workshop on Functional and (Constraint) Logic Programming WFLP'02","author":"Alpuente","year":"2002"},{"key":"S1471068406002869_N10155","first-page":"117","volume-title":"9th International Conference on Algebraic Methodology And Software Technology, AMAST 2002","author":"Alpuente","year":"2002"},{"key":"S1471068406002869_N10191","unstructured":"Alpuente M. , Escobar S. and Lucas S. 2006. Removing Redundant Arguments Automatically. CoRR cs.PL\/0601039. Available at http:\/\/arxiv.org\/abs\/cs.PL\/0601039."},{"key":"S1471068406002869_N10436","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90089-1"},{"key":"S1471068406002869_N101E1","doi-asserted-by":"publisher","DOI":"10.1145\/291891.291896"},{"key":"S1471068406002869_N1020D","first-page":"273","volume-title":"Proc. of the ACM SIGPLAN Conf. on Functional Programming, ICFP'99","author":"Alpuente","year":"1999"},{"key":"S1471068406002869_N10A92","first-page":"409","volume-title":"Partial Evaluation, Int'l Seminar, Dagstuhl Castle, Germany","author":"Reps","year":"1996"},{"key":"S1471068406002869_N10276","first-page":"172","volume-title":"Proceedings of SAIG 2000","author":"Berardi","year":"2000"},{"key":"S1471068406002869_N10863","unstructured":"Leuschel M. and Martens B. 1995. Partial Deduction of the Ground Representation and Its Application to Integrity Checking. Tech. Rep. CW 210DSIC-II\/8\/02, K.U. Leuven."},{"key":"S1471068406002869_N102D4","volume-title":"Lazy Functional Languages: Abstract Interpretation and Compilation","author":"Burn","year":"1991"},{"key":"S1471068406002869_N10391","unstructured":"Dauchet M. , Heuillard T. , Lescanne P. and Tison S. 1987. Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems. Proc. of Second IEEE Symp. on Logic In Computer Science, 353\u2013359."},{"key":"S1471068406002869_N10A75","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Transactions of the American Mathematical Society"},{"key":"S1471068406002869_N103B5","first-page":"187","volume-title":"Information and Computation. 88","author":"Dauchet","year":"1990"},{"key":"S1471068406002869_N10416","first-page":"88","volume-title":"Proc. of Partial Evaluation and Seman-tics-Based Program Manipulation, Copenhagen, Denmark, June 1993","author":"Gallagher","year":"1993"},{"key":"S1471068406002869_N1045C","volume-title":"Proc. of 15h International Conference on Rewriting Techniques and Applications, RTA'04","author":"Giesl","year":"2004"},{"key":"S1471068406002869_N104EC","first-page":"115","volume-title":"Proc. of the 5th International Static Analysis Symposium, SAS'98","author":"Gouranton","year":"1998"},{"key":"S1471068406002869_N1050C","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00030-X"},{"key":"S1471068406002869_N107E3","first-page":"84","volume-title":"Proceedings of PEPM-00","author":"Kobayashi","year":"2000"},{"key":"S1471068406002869_N1052C","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90034-5"},{"key":"S1471068406002869_N10549","unstructured":"Hanus M. , Antoy S. , Engelke M. , H\u00f6ppner K. , Koj J. , Niederau P. , Sadre R. and Steiner F. 2003a. PAKCS 1.5.0: The Portland Aachen Kiel Curry System User Manual. Tech. rep., University of Kiel, Germany."},{"key":"S1471068406002869_N10656","first-page":"187","volume-title":"IFIP Workshop on Partial Evaluation and Mixed Computation (Amsterdam)","author":"Hughes","year":"1988"},{"key":"S1471068406002869_N106FF","doi-asserted-by":"publisher","DOI":"10.1007\/BF00292110"},{"key":"S1471068406002869_N10780","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"Klop","year":"1992"},{"key":"S1471068406002869_N107B7","first-page":"147","article-title":"Partial Dead Code Elimination","volume":"29","author":"Knoop","year":"1994","journal-title":"Proceedings of the International Conference on Programming Language Design and Implementation (PLDI'94)"},{"key":"S1471068406002869_N10803","first-page":"348","volume-title":"Proc. of European Conference on Computer Algebra, EUROCAL'85","author":"Kounalis","year":"1985"},{"key":"S1471068406002869_N1082C","unstructured":"Kuper J. 1994. Partiality in logic and computation. aspects of undefinedness. Ph.D. thesis, Universiteit Twente."},{"key":"S1471068406002869_N108BE","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45127-7_17"},{"key":"S1471068406002869_N10581","unstructured":"Hanus M. , Antoy S. , Kuchen H. , L\u00f3pez-Fraguas F. , Lux W. , Moreno Navarro J. , and Steiner F. 2003b. Curry: An Integrated Functional Logic Language (version 0.8). Available at http:\/\/www.informatik.uni-kiel.de\/curry."},{"key":"S1471068406002869_N108E7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25979-4_20"},{"key":"S1471068406002869_N10922","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09981-6_19"},{"key":"S1471068406002869_N1096C","first-page":"232","article-title":"The reachability problems for quasi-ground for term rewriting systems","volume":"9","author":"Oyamaguchi","year":"1986","journal-title":"Journal of Information Processing"},{"key":"S1471068406002869_N109AC","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-73824-1"},{"key":"S1471068406002869_N109E9","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90028-0"},{"key":"S1471068406002869_N10A5B","volume-title":"Functional Programming and Parallel Graph Rewriting","author":"Plasmeijer","year":"1993"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068406002869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T02:07:32Z","timestamp":1587348452000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068406002869\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":74,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["S1471068406002869"],"URL":"https:\/\/doi.org\/10.1017\/s1471068406002869","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1]]}}}