On the time required for reference count management in retention block-structured languages. Part 2

DOI10.1007/BF00975882zbMath0403.68007OpenAlexW4251468695MaRDI QIDQ4188702

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

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)

Related Items (1)

On the efficient implementation of retention block-structured languages

This page was built for publication: On the time required for reference count management in retention block-structured languages. Part 2