Time required for garbage collection in retention block-structured languages

DOI10.1007/BF00991820zbMath0403.68008OpenAlexW2012317538MaRDI QIDQ4188703

No author found.

Publication date: 1978

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00991820

zbMATH Keywords

Block-Structured LanguagesGarbage CollectionRetention

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (3)

Time required for reference count management in retention block-structured languages. Part 1 ⋮ On the efficient implementation of retention block-structured languages ⋮ Programmed deallocation without dangling reference

Uses Software

• ALGOL 60
• Unnamed Item

Cites Work

• Report on the algorithmic language ALGOL 68
• Time required for reference count management in retention block-structured languages. Part 1
• An efficient machine-independent procedure for garbage collection in various list structures
• GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
• Unnamed Item
• Unnamed Item

This page was built for publication: Time required for garbage collection in retention block-structured languages