Modular efficient deconstruction with typed pointer reversal
Abstract
Destructors, responsible for releasing memory and other resources in languages such as C++ and Rust, can lead to stack overflows when releasing a recursive structure that is too deep. In certain cases, it is possible to generate an efficient destructor (non-allocating and tail recursive) using a typed variant of pointer reversal. We extend this technique by making it more modular, in order to handle abstract types, separate compilation, and unboxed types.
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|