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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 25-38 |
| Number of pages | 14 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 2053 |
| DOIs | |
| State | Published - Jan 1 2001 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)