Ackermann’s Function: A Study in the Efficiency of Calling Procedures (1976)
by
B. A. Wichmann
| Venue: | BIT |
| Citations: | 6 - 2 self |
BibTeX
@ARTICLE{Wichmann76ackermann’sfunction:,
author = {B. A. Wichmann},
title = {Ackermann’s Function: A Study in the Efficiency of Calling Procedures},
journal = {BIT},
year = {1976},
volume = {16},
pages = {103--110}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A six line recursive procedure is used to assess the efficiency of the procedure calling mechanism in ALGOL-like languages. The results from some 40 systems varying from ALGOL 68 and PL/I to System Implementation Languages for minicomputers are presented and compared. A hundred to one variation in performance occurs with this test, the major reasons for which are given.
Citations
| 21 | Thunks—a way of compiling procedure statements with some comments on procedure declarations - Ingerman - 1961 |
| 7 | 1973], Algol 60 Compilation and Assessment - Wichmann |
| 1 | The Ackermann function. A theoretical, computational and formula manipulative study - Sundblad - 1971 |
