A heap-based implementation of the programming language Pascal
- 1 February 1979
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 9 (2) , 101-119
- https://doi.org/10.1002/spe.4380090205
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On code generation in a PASCAL compilerSoftware: Practice and Experience, 1977
- How to call procedures, or second thoughts on Ackermann's functionSoftware: Practice and Experience, 1977
- Worst case fragmentation of first fit and best fit storage allocation strategiesThe Computer Journal, 1977
- Ackermann's function: A study in the efficiency of calling proceduresBIT Numerical Mathematics, 1976
- A simple variant of the boundary-tag algorithm for the allocation of coroutine environmentsInformation Processing Letters, 1976
- On the external storage fragmentation produced by first-fit and best-fit allocation strategiesCommunications of the ACM, 1975
- Depth of recursion and the ackermann functionBIT Numerical Mathematics, 1975
- The design of a pascal compilerSoftware: Practice and Experience, 1971
- The Ackermann function. a theoretical, computational, and formula manipulative studyBIT Numerical Mathematics, 1971