Persistent Oberon: A Programming Language with Integrated Persistence

Bläser, Luc

doi:10.1007/978-3-540-76637-7_6

Cited by 3 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Explicitly interacting with storage mechanisms outside the control of the application might result in hard to maintain code bases, as correct handling of interfacing, typing, and concurrency have to be resolved. Persistent programming languages can offer a much higher abstraction when interacting with persistent data [Atkinson et al 1982;Bläser 2007;Hosking and Chen 1999;Morrison et al 2000]. They often rely on the concept of orthogonal persistence introduced by Atkinson et al [1983] and further described in more detail by Atkinson and Morrison [1995].…”

Section: Persistent Programmingmentioning

confidence: 99%

Persistent software transactional memory in Haskell

Krauter

Raaf

Braam

et al. 2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Emerging persistent memory in commodity hardware allows byte-granular accesses to persistent state at memory speeds. However, to prevent inconsistent state in persistent memory due to unexpected system failures, different write-semantics are required compared to volatile memory. Transaction-based library solutions for persistent memory facilitate the atomic modification of persistent data in languages where memory is explicitly managed by the programmer, such as C/C++. For languages that provide extended capabilities like automatic memory management, a more native integration into the language is needed to maintain the high level of memory abstraction. It is shown in this paper how persistent software transactional memory (PSTM) can be tightly integrated into the runtime system of Haskell to atomically manage values of persistent transactional data types. PSTM has a clear interface and semantics extending that of software transactional memory (STM). Its integration with the language’s memory management retains features like garbage collection and allocation strategies, and is fully compatible with Haskell's lazy execution model. Our PSTM implementation demonstrates competitive performance with low level libraries and trivial portability of existing STM libraries to PSTM. The implementation allows further interesting use cases, such as persistent memoization and persistent Haskell expressions.

show abstract

Section: Persistent Programmingmentioning

confidence: 99%