Garbage Collection for Reversible Functional Languages
From MaRDI portal
Recommendations
- Compile-Time Garbage Collection for Higher-Order Functional Languages
- Concurrent garbage collection for concurrent rewriting
- Towards a reversible functional language
- A fully concurrent garbage collector for functional programs on multicore processors
- Adjunction for Garbage Collection with Application to Graph Rewriting
- scientific article; zbMATH DE number 177786
- Program logic and equivalence in the presence of garbage collection.
- Term graph rewriting and garbage collection using opfibrations
Cites work
Cited in
(8)- Data structures and dynamic memory management in reversible languages
- Reversible object-oriented programming with region-based memory management (work in progress report)
- Towards a reversible functional language
- A fully concurrent garbage collector for functional programs on multicore processors
- RSSA: A Reversible SSA Form
- A Resource-Aware Semantics and Abstract Machine for a Functional Language with Explicit Deallocation
- Automatic Space Bound Analysis for Functional Programs with Garbage Collection
- CRIL: a concurrent reversible intermediate language
This page was built for publication: Garbage Collection for Reversible Functional Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822492)