Selected papers that cite this one
- E. K. Blum. Towards a theory of semantics and compilers for programming languages. In Conference Record of ACM Symposium on Theory of Computing, pages 217-227, Marina del Rey, California, 5-7 May 1969.
- Robert L. Constable and Allan B. Borodin. Subrecursive programming languages, part I: Efficiency and program structure. Journal of the ACM, 19(3):526-568, July 1972.
- Kenneth W. Regan. Linear time and memory-efficient computation. SIAM Journal on Computing, 25(1):133-168, February 1996.
Selected references
- J. C. Shepherdson and H. E. Sturgis. Computability of recursive functions. Journal of the ACM, 10(2):217-255, April 1963.
- Hao Wang. A variant to Turing's theory of computing machines. Journal of the ACM, 4(1):63-92, January 1957.