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
A demand-driven set-based analysis
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
| Hi-index | 0.00 |
We present a non-standard type assignment system and simpli fications mappings for detecting and removing useless-code in simply typed functional programs with algebraic datatypes and recursive functions. We characterize two classes of useless-code: the dead-code, that is code that is never executed under the lazy-call-by-name evaluation, and the minimum-information-code, that is code that contributes to the computation only with a minimum amount of constant information.