Skip to Main content Skip to Navigation
Conference papers

Efficient Deconstruction with Typed Pointer Reversal (abstract)

Abstract : The resource-management model of C++ and Rust relies on compiler-generated destructors called predictably and reliably. In current implementations, the generated destructor consumes stack space proportionally to the depth of the structure it destructs. We describe a way to derive destructors for algebraic data types that consume a constant amount of stack and heap. We discuss applicability to C++ and Rust, and also some implication for anyone wishing to extend an ML-style language with first-class resources.
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Guillaume Munch-Maccagnoni Connect in order to contact the contributor
Submitted on : Tuesday, July 9, 2019 - 7:38:41 PM
Last modification on : Friday, August 5, 2022 - 2:54:51 PM


Files produced by the author(s)


  • HAL Id : hal-02177326, version 2


Guillaume Munch-Maccagnoni, Rémi Douence. Efficient Deconstruction with Typed Pointer Reversal (abstract). ML 2019 - Workshop, KC Sivaramakrishnan, Aug 2019, Berlin, Germany. pp.1-8. ⟨hal-02177326v2⟩



Record views


Files downloads