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.
- Arthur W. Burks and Hao Wang. The logic of automata -- part I. Journal of the ACM, 4(2):193-218, April 1957.
- John Cocke and Marvin Minsky. Universality of tag systems with P = 2. Journal of the ACM, 11(1):15-20, January 1964.
- M. W. Curtis. A Turing machine simulator. Journal of the ACM, 12(1):1-13, January 1965.
- Calvin C. Elgot and Abraham Robinson. Random-access stored-program machines, an approach to programming languages. Journal of the ACM, 11(4):365-399, October 1964.
- C. Y. Lee. Categorizing automata by W-machine programs. Journal of the ACM, 8(3):384-399, July 1961.
- Daniel Leivant. Functions over free algebras definable in the simply typed lambda calculus. Theoretical Computer Science, 121(1-2):309-321, 6 December 1993.
- David Pager. Further results on the problem of finding minimal length programs for decision tables. Journal of the ACM, 21(2):207-212, April 1974.
- J. C. Shepherdson and H. E. Sturgis. Computability of recursive functions. Journal of the ACM, 10(2):217-255, April 1963.