Type Systems for Useless-Variable Elimination

Authors:
Adam Fischbach;John Hannan
Affiliations:
-;-
Venue:
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Year:
2001

Citing 6
Cited 2

Control-flow analysis of higher-order languages of taming lambda

Control-flow analysis of higher-order languages of taming lambda
Higher-order unCurrying

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order arity raising

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
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
Automatic useless-code elimination for HOT functional programs

Journal of Functional Programming

Type-based useless variable elimination

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Type-Based Useless-Code Elimination for Functional Programs

SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a type-based specification for useless-variable elimination for a higher-order, call-by-value functional language. Utilizing a weak form of dependent types, we introduce a mechanism for eliminating at runtime useless code that is not detectable statically. We prove the specifications sound and safe with respect to an operational semantics, ensuring that eliminated expressions contributed no observable behavior to the original program. We define an algorithm that implements useless-variable elimination without dependent types, and we prove this algorithm correct with respect to the specification.