Who Owns the Contents of a Doubly-Linked List?
Despite their popularity, systems enforcing full ownership guarantees such as Rust leave many users frustrated with the inability to represent notionally self-referential data structures-e.g., doublylinked lists-using first-class references. This frustration has motivated a number of proposals to relax on full ownership to support idioms common in languages with pervasive reference semantics. In this paper, we take a look at the way value-oriented languages address this issue and study representations of arbitrary graph-like data structures without references. 2012 ACM Subject Classification Software and its engineering → Object oriented languages; Software and its engineering → Imperative languages; Software and its engineering → Data types and structures; Software and its engineering → Runtime environments
Cite this item
Racordon, D. (2025). Who Owns the Contents of a Doubly-Linked List? In J. Edwards, R. Perera, & T. Petricek (Editors), Proceedings of the 9th International Conference on the Art, Science, and Engineering of Programming (Programming 2025) (No. 25). 4th Workshop on Value Independence in Modern Programming Languages (VIMPL 2025), Czechia, June 2, 2025. https://infoscience.epfl.ch/handle/20.500.14299/262900
Click Copy to copy the citation, or select the text manually.
OASIcs.Programming.2025.25.pdf
Main Document
Accepted version
openaccess
CC BY
861 KB
Adobe PDF
43bbfe78de378d3141a69fb9f45e8048