M.Alpuente, S.Escobar, S.Lucas  @ NUS Home/Search
Context
Related
| dsic.upv.es/users/...echreport2004A.pdf Cached: PS.gz PS PDF Image Update Help From: dsic.upv.es/users/elp/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 a method for the analysis and elimination of redundant... (Update)
Similar documents (at the sentence level):
20.1%: Removing Redundant Arguments of Functions - Alpuente, Escobar, Lucas (2002) (Correct)
16.8%: Strategies and Analysis Techniques for Functional Program.. - Roman (2003) (Correct)
Active bibliography (related documents): More All
0.8: Program Specialization Based on Dynamic Slicing - Ochoa, Silva, Vidal (2004) (Correct)
0.7: Forward Slicing by Partial Evaluation - Vidal (Correct)
0.5: Strategies and Analysis Techniques in Functional Program.. - Escobar (Correct)
Similar documents based on text: More All
0.6: On-demand Evaluation by Program Transformation - Alpuente, al. (2003) (Correct)
0.6: On-Demand Strategy Annotations Revisited - Alpuente, al. (2003) (Correct)
0.5: Termination of Programs With Strategy Annotations - Lucas (2003) (Correct)
BibTeX entry: (Update)
@misc{ alpuente-removing,
author = "M.Alpuente and S.Escobar and S.Lucas",
title = "Removing Redundant Arguments Automatically",
url = "citeseer.comp.nus.edu.sg/686559.html" }
Citations (may not include all citations):474 Term Rewriting Systems - Klop - 1992
374 Automata on infinite objects (context) - Thomas - 1990
353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
259 A Survey of Program Slicing Techniques - Tip - 1995
241 Decidability of second-order theories and automata on infini.. (context) - Rabin - 1969
138 Functional Programming and Parallel Graph Rewriting (context) - Plasmeijer, Eekelen - 1993
129 Transformation of Logic Programs: Foundations and Techniques (context) - Pettorossi, Proietti - 1994
94 Projections for Strictness Analysis - Wadler, Hughes - 1987
89 Curry: An Integrated Functional Logic Language (context) - Hanus, Antoy et al. - 2003
82 Partial Dead Code Elimination - Knoop, uthing et al. - 1994
61 The theory and practice of transforming callbyneed into call.. (context) - Mycroft - 1980
54 Rules and Strategies for Transforming Functional and Logic P.. - Pettorossi, Proietti - 1996
53 Compile-time garbage collection by sharing analysis (context) - Jones, etayer - 1989
48 Backwards Analysis of Functional Programs (context) - Hughes - 1988
47 Program Specialization via Program Slicing - Reps, Turnidge - 1996
41 Strictness Analysis in Logical Form - Jensen - 1991
39 Partial Evaluation of Functional Logic Programs - Alpuente, Falaschi et al. - 1998
38 Escape Analysis on Lists - Park, Goldberg - 1992
36 Lazy Functional Languages: Abstract Interpretation and Compi.. (context) - Burn - 1991
31 Specialization of Lazy Functional Logic Programs - Alpuente, Falaschi et al. - 1997
31 Generalized finite automata with an application to a decisio.. (context) - Thatcher, Wright - 1968
28 Narrowing-driven Partial Evaluation of Functional Logic Prog.. - Alpuente, Falaschi et al. - 1996
28 The Theory of Strictness Analysis for Higher Order Functions (context) - Burn, Hankin et al. - 1986
28 Information and Computation (context) - Comon - 2000
27 Computing in Horn Clause Theories (context) - Padawitz - 1988
26 the Power of Homeomorphic Embedding for Online Termination (context) - Leuschel - 1998
25 Computations in Orthogonal Term Rewriting Systems (context) - Huet, evy - 1992
24 Constraint systems for useless variable elimination - Wand, Siveroni - 1999
23 Redundant Argument Filtering of Logic Programs - Leuschel, Srensen - 1996
23 Meaningless terms in rewriting - Kennaway, van Oostrom et al. - 1996
20 The Portland Aachen Kiel Curry System User Manual (context) - Hanus, Antoy et al. - 2003
20 A Backward Slicing Algorithm for Prolog - Schoenig, Ducasse - 1996
19 Context-sensitive rewriting strategies - Lucas - 2002
19 Decidability of the Confluence of Finite Ground Term Rewrite.. (context) - Dauchet, Heuillard et al. - 1987
17 Decidable Call by Need Computations in Term Rewriting - Durand, Middeldorp - 1997
16 Reductions on tree replacement systems (context) - Gallier, Book - 1985
16 Partial Deduction of the Ground Representation and Its Appli.. - Leuschel, Martens - 1995
16 Specialization of Inductively Sequential Functional Logic Pr.. - Alpuente, Hanus et al. - 1999
16 A collection of examples for termination of term rewriting u.. - Arts, Giesl - 2001
15 Type-based useless variable elimination - Kobayashi - 2000
13 Small domains spell fast strictness analysis (context) - Sekar, Pawagi et al. - 1990
12 Eliminating dead code on recursive data - Liu, Stoller - 2002
12 Principles Techniques and Tools (context) - Aho, Sethi et al. - 1986
11 Term Rewriting Systems (context) - Ed - 2003
10 Partiality in logic and computation (context) - Kuper - 1994
9 Decidability of the Confluence of Ground Term Rewriting Syst.. (context) - Dauchet, Heuillard et al. - 1990
8 Completeness in data type specifications (context) - Kounalis - 1985
8 The reachability and joinability problems for right-ground t.. (context) - Oyamaguchi - 1990
6 Decidable approximations to term rewriting systems (context) - Jacquemard - 1996
6 Partial Deduction and Driving are Equivalent - uck, Srensen - 1994
4 Static and Dynamic Slicing of Constraint Logic Programs (context) - Szilagyi, Gyimothy et al. - 2002
4 cientcompleteness and related properties of term rewriting s.. (context) - Kapur, Narendran et al. - 1987
3 Deriving Analysers by Folding/Unfolding of Natural Semantics.. - Gouranton - 1998
3 Redundancy of Arguments Reduced to Induction - Alpuente, Echahed et al. - 2002
2 On interreduction of semi-complete term rewriting systems - Gramlich - 2001
1 and Cousot (context) - Cousot - 1994
1 and Lucas (context) - Alpuente, Escobar - 2002
1 and Giannini (context) - Berardi, Coppo et al. - 2000
1 The reachability problems for quasi-ground for term rewritin.. (context) - Oyamaguchi - 1986
1 Optimising compilation - Mycroft, Norman - 1992
1 and Proietti (context) - Pettorossi - 1996
Documents on the same site (http://www.dsic.upv.es/users/elp/papers.html): More
SYNTH User's Manual - Alpuente, Ferri, Vidal, Moreno, al. (1999) (Correct)
Reconfigurable Nets, a Class of High Level Petri Nets.. - Badouel, Oliver (1998) (Correct)
UPV-Curry User's Manual - Escobar, Alpuente, Lucas (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.