Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The theory of strictness analysis for higher order functions
on Programs as data objects
Projections for strictness analysis
Proc. of a conference on Functional programming languages and computer architecture
Computing in Horn clause theories
Computing in Horn clause theories
Small domains spell fast strictness analysis
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
Compile-time garbage collection by sharing analysis
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Sufficient-completeness, ground-reducibility and their complexity
Acta Informatica
The reachability and joinability problems for right-ground term-rewriting systems
Journal of Information Processing
Lazy functional languages: abstract interpretation and compilation
Lazy functional languages: abstract interpretation and compilation
Handbook of theoretical computer science (vol. B)
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Tutorial on specialisation of logic programs
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Handbook of logic in computer science (vol. 2)
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
Specialization of lazy functional logic programs
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Term rewriting and all that
Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint systems for useless variable elimination
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specialization of inductively sequential functional logic programs
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Type-based useless variable elimination
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Sequentiality, monadic second-order logic and tree automata
Information and Computation
On interreduction of semi-complete term rewriting systems
Theoretical Computer Science
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
Static and Dynamic Slicing of Constraint Logic Programs
Automated Software Engineering
Algorithms and reductions for rewriting problems. II
Information Processing Letters
Strictness Analysis in Logical Form
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Removing Redundant Arguments of Functions
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Partial Deduction and Driving are Equivalent
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Completeness in Data Type Specifications
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Redundant Argument Filtering of Logic Programs
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
WSA '93 Proceedings of the Third International Workshop on Static Analysis
A Backward Slicing Algorithm for Prolog
SAS '96 Proceedings of the Third International Symposium on Static Analysis
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
The Theory and Practice of Transforming Call-by-need into Call-by-value
Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Program Specialization via Program Slicing
Selected Papers from the Internaltional Seminar on Partial Evaluation
A Comparative Revisitation of Some Program Transformation Techniques
Selected Papers from the Internaltional Seminar on Partial Evaluation
Meaningless Terms in Rewriting
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Decidable Call by Need Computations in term Rewriting (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Eliminating dead code on recursive data
Science of Computer Programming - Special issue on static analysis (SAS'99)
An upper bound on the derivational complexity of Knuth--Bendix orderings
Information and Computation - Special issue: ICC '99
A sufficient completeness reasoning tool for partial specifications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
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.