Implementing the ALGOL 68 heap
From MaRDI portal
Publication:5666139
DOI10.1007/BF01935562zbMath0252.68003MaRDI QIDQ5666139
Publication date: 1970
Published in: BIT (Search for Journal in Brave)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Report on the algorithmic language ALGOL 68
- A method for overlapping and erasure of lists
- A contribution to the development of ALGOL
- An efficient machine-independent procedure for garbage collection in various list structures
- Storage organization in programming systems
- Recovery of reentrant list structures in SLIP
- A note on storage fragmentation and program segmentation
- Implementing a stack
- Symmetric list processor
This page was built for publication: Implementing the ALGOL 68 heap