{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:55Z","timestamp":1761611215115,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441441"},{"type":"electronic","value":"9783540457190"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45719-4_9","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T14:55:00Z","timestamp":1191941700000},"page":"117-132","source":"Crossref","is-referenced-by-count":1,"title":["Removing Redundant Arguments of Functions*"],"prefix":"10.1007","author":[{"given":"Mar\u00eda","family":"Alpuente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santiago","family":"Escobar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"M. Alpuente, R. Echahed, S. Escobar, S. Lucas. Redundancy of Arguments Reduced to Induction. In Proc. of WFLP\u201902, ENTCS, to appear, 2002.","DOI":"10.1016\/S1571-0661(04)80783-7"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"M. Alpuente, S. Escobar, S. Lucas. Removing Redundants Arguments of Functions. Technical report DSIC-II\/8\/02, UPV, 2002.","DOI":"10.1007\/3-540-45719-4_9"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"M. Alpuente, M. Falaschi, P. Juli\u00e1n, and G. Vidal. Specialization of Lazy Functional Logic Programs. In Proc. of PEPM\u201997, ACM Sigplan Notices, volume 32(12):151\u2013162. ACM Press, New York, 1997.","DOI":"10.1145\/258994.259015"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1145\/291891.291896","volume":"20","author":"M. Alpuente","year":"1998","unstructured":"M. Alpuente, M. Falaschi, and G. Vidal. Partial Evaluation of Functional Logic Programs. ACM TOPLAS, 20(4):768\u2013844, 1998.","journal-title":"ACM TOPLAS"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"M. Alpuente, M. Hanus, S. Lucas, and G. Vidal. Specialization of Inductively Sequential Functional Logic Programs. In Proc. of ICFP\u201999, ACM Sigplan Notices, 34(9):273\u2013283, ACM Press, New York, 1999.","DOI":"10.1145\/317636.317910"},{"key":"9_CR6","unstructured":"A. V. Aho, R. Sethi, and J. D. Ullman. Compilers, Principles Techniques and Tools. Addison-Wesley, 1986."},{"key":"9_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/3-540-45350-4_13","volume-title":"Type-Based Useless-Code Elimination for Functional Programs","author":"S. Berardi","year":"2000","unstructured":"S. Berardi, M. Coppo, F. Damiani and P. Giannini. Type-Based Useless-Code Elimination for Functional Programs. In Walid Taha, editor, Proc. of SAIG 2000, LNCS 1924:172\u2013189, Springer-Verlang, 2000."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), invited paper. In Proc. of ICCL\u201994, pages 95\u2013112. IEEE Computer Society Press, Los Alamitos, California, 1994.","DOI":"10.1109\/ICCL.1994.288389"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0890-5401(90)90015-A","volume":"88","author":"M. Dauchet","year":"1990","unstructured":"M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison. Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewriting Systems. Information and Computation, 88:187\u2013201, 1990.","journal-title":"Information and Computation"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"J. Gallagher. Tutorial on Specialisation of Logic Programs. In Proc. of PEPM\u201993, pages 88\u201398. ACM, New York, 1993.","DOI":"10.1145\/154630.154640"},{"key":"9_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-58402-1_13","volume-title":"Partial deduction and driving are equivalent","author":"R. Gl\u00fcck","year":"1994","unstructured":"R. Gl\u00fcck and M. S\u00f8rensen. Partial deduction and driving are equivalent. In Proc. of PLILP\u201994, LNCS 844:165\u2013181. Springer-Verlag, Berlin, 1994."},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0304-3975(00)00030-X","volume":"258","author":"B. Gramlich","year":"2001","unstructured":"B. Gramlich. On Interreduction of Semi-Complete Term Rewriting Systems. Theoretical Computer Science, 258(1\u20132):435\u2013451, 2001.","journal-title":"Theoretical Computer Science"},{"key":"9_CR14","unstructured":"M. Hanus. Curry: An Integrated Functional Logic Language. Available at http:\/\/www.informatik.uni-kiel.de\/~curry , 2001."},{"key":"9_CR15","first-page":"395","volume-title":"Computational logic: essays in honour of J. Alan Robinson","author":"G. Huet","year":"1991","unstructured":"G. Huet and J. J. L\u00e9vy. Computations in orthogonal term rewriting systems. In J. L. Lassez and G. Plotkin, editors, Computational logic: essays in honour of J. Alan Robinson, pages 395\u2013414 and 415\u2013443. The MIT Press, Cambridge, MA, 1991."},{"key":"9_CR16","unstructured":"J. Hughes. Backwards Analysis of Functional Programs. In D. Bj\u00f8rner, A. P. Ershov, and N. D. Jones, editors, IFIP Workshop on Partial Evaluation and Mixed Computation, pages 187\u2013208, 1988."},{"key":"9_CR17","first-page":"1","volume":"3","author":"J. W. Klop","year":"1992","unstructured":"J. W. Klop. Term RewritingSys tems. In S. Abramsky, D. M. Gabbay and T. S. E. Maibaum. Handbook of Logic in Computer Science, volume 3, pages 1\u2013116. Oxford University Press, 1992.","journal-title":"Handbook of Logic in Computer Science"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00292110","volume":"24","author":"D. Kapur","year":"1987","unstructured":"D. Kapur, P. Narendran, and Z. Zhang. On sufficient-completeness and related properties of term rewriting systems. Acta Informatica 24:395\u2013416, 1987.","journal-title":"Acta Informatica"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"N. Kobayashi. Type-based useless variable elimination. In roc. of PEPM-00, pages 84\u201393, ACM Press, 2000.","DOI":"10.1145\/328691.328702"},{"key":"9_CR20","series-title":"Lect Notes Comput Sci","first-page":"348","volume-title":"Completeness in data type specifications","author":"E. Kounalis","year":"1985","unstructured":"E. Kounalis. Completeness in data type specifications. In B. F. Caviness, editor, Proc. of EUROCAL\u201985, LNCS 204:348\u2013362. Springer-Verlag, Berlin, 1985."},{"key":"9_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/3-540-61735-3_17","volume-title":"Meaningless Terms in Rewriting","author":"R. Kennaway","year":"1996","unstructured":"R. Kennaway, V. van Oostrom, F. J. de Vries. Meaningless Terms in Rewriting. In Michael Hanus and Mario Rodr\u00edguez-Artalejo, editors, Proc. of ALP\u201996, LNCS 1139:254\u2013268. Springer-Verlag, Berlin, 1996."},{"key":"9_CR22","unstructured":"J. Kuper. Partiality in Logic and Computation. Aspects of Undefinedness. PhD Thesis, Universiteit Twente, February 1994."},{"key":"9_CR23","unstructured":"M. Leuschel and B. Martens. Partial Deduction of the Ground Representation and Its Application to Integrity Checking. Tech. Rep. CW 210, K. U. Leuven, 1995."},{"key":"9_CR24","unstructured":"M. Leuschel. The ECCE partial deduction system and the DPPD library of benchmarks. Tech. Rep., Accessible via http:\/\/www.ecs.soton.ac.uk\/~mal\/ ."},{"key":"9_CR25","series-title":"Lect Notes Comput Sci","first-page":"83","volume-title":"Redundant Argument Filtering of Logic Programs","author":"M. Leuschel","year":"1996","unstructured":"M. Leuschel and M. H. S\u00f8rensen. Redundant Argument Filtering of Logic Programs. In Proc of LOPSTR\u201996, LNCS 1207:83\u2013103. Springer-Verlag, Berlin, 1996."},{"key":"9_CR26","series-title":"Lect Notes Comput Sci","first-page":"211","volume-title":"Science of Computer Programming","author":"Y. A. Liu","year":"2002","unstructured":"Y. A. Liu and S. D. Stoller. Eliminating dead code on recursive data. Science of Computer Programming, 2002. To appear. Preliminary version in Proc. of SAS\u201999, LNCS 1694:211\u2013231. Springer-Verlag, Berlin, 1999."},{"issue":"1","key":"9_CR27","first-page":"1","volume":"1998","author":"S. Lucas","year":"1998","unstructured":"S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1):1\u201361, January 1998.","journal-title":"Journal of Functional and Logic Programming"},{"key":"9_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-45127-7_17","volume-title":"Transfinite Rewriting Semantics for Term Rewriting Systems","author":"S. Lucas","year":"2001","unstructured":"S. Lucas. Transfinite Rewriting Semantics for Term Rewriting Systems Proc. of RTA\u201901, LNCS 2051:216\u2013230. Springer-Verlag, Berlin, 2001."},{"issue":"3","key":"9_CR29","first-page":"347","volume":"13","author":"M. Oyamaguchi","year":"1990","unstructured":"M. Oyamaguchi. The reachability and joinability problems for right-ground term rewriting systems. Journal of Information Processing, 13(3), pp. 347\u2013354, 1990.","journal-title":"Journal of Information Processing"},{"key":"9_CR30","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"P. Padawitz","year":"1988","unstructured":"P. Padawitz. Computing in Horn Clause Theories. EATCS Monographs on Theoretical Computer Science, vol. 16. Springer-Verlag, Berlin, 1988."},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. J. Logic Program. 19,20, 261\u2013320.","DOI":"10.1016\/0743-1066(94)90028-0"},{"key":"9_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-61580-6_18","volume-title":"A comparative revisitation of some program transformation techniques","author":"A. Pettorossi","year":"1996","unstructured":"A. Pettorossi and M. Proietti. A comparative revisitation of some program transformation techniques. In Proc. of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110: 355\u2013385. Springer-Verlag, Berlin, 1996."},{"key":"9_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/3-540-61580-6_19","volume-title":"A Theory of Logic Program Specialization and Generalization for Dealing with Input Data Properties","author":"A. Pettorossi","year":"1996","unstructured":"A. Pettorossi and M. Proietti. A Theory of Logic Program Specialization and Generalization for Dealing with Input Data Properties. In Proc. of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110: 386\u2013408. Springer-Verlag, Berlin, 1996."},{"key":"9_CR34","unstructured":"R. Plasmeijer and M. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison Wesley, 1993."},{"key":"9_CR35","series-title":"Lect Notes Comput Sci","first-page":"348","volume-title":"Strictness analysis by abstract reduction usinga tableau calculus","author":"M. Sch\u00fctz","year":"1995","unstructured":"M. Sch\u00fctz, M. Schmidt-Schauss and S. E. Panitz. Strictness analysis by abstract reduction usinga tableau calculus. In A. Mycroft, editor, Proc. of SAS\u201995, LNCS 983:348\u2013365. Springer-Verlag, 1995."},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"M. Wand and I. Siveroni. Constraint systems for useless variable elimination. In Proc. of POPL\u201999, pages 291\u2013302, ACM Press, 1999.","DOI":"10.1145\/292540.292567"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45719-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T13:58:48Z","timestamp":1737467928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45719-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441441","9783540457190"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-45719-4_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}