Implementing the ALGOL 68 heap
From MaRDI portal
Cites work
- A contribution to the development of ALGOL
- A method for overlapping and erasure of lists
- A note on storage fragmentation and program segmentation
- An efficient machine-independent procedure for garbage collection in various list structures
- scientific article; zbMATH DE number 3221719 (Why is no real title available?)
- scientific article; zbMATH DE number 3292412 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3309679 (Why is no real title available?)
- scientific article; zbMATH DE number 3381857 (Why is no real title available?)
- scientific article; zbMATH DE number 3187218 (Why is no real title available?)
- Implementing a stack
- Recovery of reentrant list structures in SLIP
- Report on the algorithmic language ALGOL 68
- Storage organization in programming systems
- Symmetric list processor
This page was built for publication: Implementing the ALGOL 68 heap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5666139)