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

DOI10.1007/BF00991939MaRDI QIDQ4188701zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3346088 (Why is no real title available?)
• scientific article; zbMATH DE number 3407132 (Why is no real title available?)
• GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
• Report on the algorithmic language ALGOL 68
• Revised report on the algorithmic language ALGOL 60
• Time required for garbage collection in retention block-structured languages

Cited in

(2)

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

Describes a project that uses

Uses Software

• ALGOL 60
• ALGOL 68

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)