Time required for garbage collection in retention block-structured languages
- 1 December 1978
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 7 (4) , 361-404
- https://doi.org/10.1007/bf00991820
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Time required for reference count management in retention block-structured languages. Part 1International Journal of Parallel Programming, 1978
- Two parallel EULER run time modelsACM SIGPLAN Notices, 1973
- Lambda calculus schemataACM SIGPLAN Notices, 1972
- EDITOR’S INTRODUCTIONPublished by Walter de Gruyter GmbH ,1971
- The contour model of block structured processesACM SIGPLAN Notices, 1971
- Data structure models for programming languagesACM SIGPLAN Notices, 1971
- The importance of implementation models in ALGOL 68ACM SIGPLAN Notices, 1970
- GEDANKEN—a simple typeless language based on the principle of completeness and the reference conceptCommunications of the ACM, 1970
- Report on the Algorithmic Language ALGOL 68Numerische Mathematik, 1969
- An efficient machine-independent procedure for garbage collection in various list structuresCommunications of the ACM, 1967