Efficient Deconstruction with Typed Pointer Reversal (abstract) - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Efficient Deconstruction with Typed Pointer Reversal (abstract)

(1, 2) , (1, 3)
1
2
3

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.
Fichier principal
Vignette du fichier
efficient-drops-mlworkshop.pdf (229.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02177326 , version 1 (08-07-2019)
hal-02177326 , version 2 (09-07-2019)

Identifiers

  • HAL Id : hal-02177326 , version 2

Cite

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⟩
1736 View
822 Download

Share

Gmail Facebook Twitter LinkedIn More