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 metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-02177326
Contributor : Guillaume Munch-Maccagnoni <>
Submitted on : Tuesday, July 9, 2019 - 7:38:41 PM
Last modification on : Thursday, September 19, 2019 - 3:53:45 PM

File

efficient-drops-mlworkshop.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02177326, version 2

Citation

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⟩

Share

Metrics

Record views

1090

Files downloads

1055