Time required for reference count management in retention block-structured languages. Part 1

DOI10.1007/BF00991939zbMATH Open0403.68006OpenAlexW1992898020MaRDI QIDQ4188701FDOQ4188701

Authors:

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/bf00991939

zbMATH Keywords

Block-Structured LanguagesDeletion StrategyLifetime Stack ModelPartial Reference Count Contour MachineRetention Strategy

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cites Work

• Revised report on the algorithmic language ALGOL 60
• Title not available (Why is that?)
• Report on the algorithmic language ALGOL 68
• Time required for garbage collection in retention block-structured languages
• GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
• Title not available (Why is that?)

Cited In (2)

• Time required for garbage collection in retention block-structured languages
• On the efficient implementation of retention block-structured languages

Uses Software

• ALGOL 68
• ALGOL 60

This page was built for publication: Time required for reference count management in retention block-structured languages. Part 1

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4188701)