Type-based useless-variable elimination

Higher-Order and Symbolic Computation

Volumn 14, Issue 2-3, 2001, Pages 221-260

  Kobayashi, Naoki ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Control flow analysis; Type inference; Type based analysis; Useless variable elimination

Indexed keywords

ALGORITHMS; AUTOMATIC PROGRAMMING; CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE SELECTION AND EVALUATION; DATA FLOW ANALYSIS; DIGITAL ARITHMETIC; OPTIMIZATION; PROGRAM COMPILERS; PROGRAM DIAGNOSTICS; SEMANTICS;

AUTOMATIC CODE GENERATION; CONTROL FLOW ANALYSIS; POLYMORPHIC LANGUAGE; TYPE BASED ANALYSIS; TYPE INFERENCE; USELESS VARIABLE ELIMINATION;

PROGRAM DEBUGGING;

EID: 0035465994     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012944815270     Document Type: Article

References (30)

1. Pruning simply typed lambda-terms
2. Refinement types for program analysis
3. Non-standard type inference for functional programs
4. Lambda-dropping: Transforming recursive equations into programs with block location structure
5. Type systems and algorithms for useless-variable elimination
6. Collecting more garbage
7. Control-flow analysis and type systems
8. Linear-time subtransitive control flow analysis
9. On the cubic bottleneck in subtyping and flow analysis
10. Type inference with polymorphic recursion
11. Formal description for collecting reachable garbage via dynamic type inference
12. Unification and ML type reconstruction
13. Semi-unification
14. Proofs about a folklore let-polymorphic type inference algorithm
15. Redundant argument filtering of logic programs
16. Types for 0, 1 or many uses
17. Equality-based flow analysis versus recursive types
18. A type system equivalent to flow analysis
19. From polyvariant flow information to intersection and union types
20. Linear unification
21. Program specialization via program slicing
22. Types, abstraction and parametric polymorphism
23. Control-flow analysis of higher-order languages
24. Polymorphic type, region and effect inference
25. Efficiency of a good but not linear set union algorithm
26. Implementation of the call-by-value lambda-calculus using a stack of regions
27. Constraint systems for useless variable elimination
28. Polymorphic splitting: An effective polyvariant flow analysis