Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Extracting &ohgr;'s programs from proofs in the calculus of constructions
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extraction of redundancy-free programs from constructive natural deduction proofs
Journal of Symbolic Computation
Control-flow analysis of higher-order languages of taming lambda
Control-flow analysis of higher-order languages of taming lambda
Lazy type inference and program analysis
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Annotated type and effect systems
ACM Computing Surveys (CSUR)
Constraint systems for useless variable elimination
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type-based useless variable elimination
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Compiler Design
Principles of Program Analysis
Principles of Program Analysis
Extending Pruning Techniques to Polymorphic Second order Lambda-Calculus
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Dead Code Elimination through Dependent Types
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Type Systems for Useless-Variable Elimination
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Using Subtyping in Program Optimization
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Detecting and Removing Dead-Code using Rank 2 Intersection
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Refinement Types for Program Analysis
SAS '96 Proceedings of the Third International Symposium on Static Analysis
Minimum Information Code in a Pure Functional Language with Data Types
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
A Static Calculus of Dependencies for the -Cube
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Computational uses of the manipulation of formal proofs
Computational uses of the manipulation of formal proofs
Automatic useless-code elimination for HOT functional programs
Journal of Functional Programming
Removing Redundant Arguments of Functions
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
On the rôle of minimal typing derivations in type-driven program transformation
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
| Hi-index | 0.00 |
In this paper we present a survey of the work on type-based useless-code elimination for higher-order functional programs. After some historical remarks on the motivations and early approaches we give an informal but complete account of the techniques and results developed at the Computer Science Department of the University of Torino. In particular, we focus on the fact that, for each of the type-based techniques developed, there is an optimal program simplification.