Advertisement

Generalized program schemas

  • Ashok K. Chandra
Friday Afternoon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Brown, S., D. Gries and T. Szymanski, Program schemes with pushdown stores, SIAM J. Comput., 1, 3, (Sept. 1972), 242–268.CrossRefGoogle Scholar
  2. [2]
    Chandra, A. K., On the properties and applications of program schemas, Ph.D. Thesis, Computer Science, Report CS-336, AIM-188, Stanford University (March 1973).Google Scholar
  3. [3]
    Chandra, A. K. and Z. Manna, Program schemas with equality, Fourth Annual ACM Symposium on Theory of Computing, Denver, Colorado (May 1972), 52–64.Google Scholar
  4. [4]
    Constable, R. L. and D. Gries, On classes of program schemata, SIAM J. Comput. 1, 1 (March 1972), 66–118.CrossRefGoogle Scholar
  5. [5]
    Garland, S. J. and D. C. Luckham, Program schemes, recursion schemes, and formal languages, J. Comput. Syst. Sci., 7 (1973), 119–160.Google Scholar
  6. [6]
    Ianov, I., The logical schemes of algorithms, Problems in Cybernetics, 1, Pergamon Press, New York (1960), 82–140.Google Scholar
  7. [7]
    Luckham, D. C., D. M. R. Park and M. S. Paterson, On formalized computer programs, J. Compt. Syst. Sci. 4, 3 (June 1970), 220–249.Google Scholar
  8. [8]
    Manna, Z., Properties of programs and first-order predicate calculus, J. ACM, 16, 2 (April 1969), 244–255.CrossRefGoogle Scholar
  9. [9]
    McCarthy, J., Towards a mathematical science of computation, Proc. ICIP (1962), 21–34.Google Scholar
  10. [10]
    Paterson, M. S., Equivalence problems in a model of computation, Ph.D. Thesis, University of Cambridge, England (August 1967). Also Artificial Intelligence Memo, No. 1, MIT (1970).Google Scholar
  11. [11]
    Paterson, M. S. and C. E. Hewitt, Comparative schematology, Project MAC Conference on concurrent systems and parallel computation, ACM, New York (June 1970), 119–127.Google Scholar
  12. [12]
    Plaisted, D., Flowchart schemata with counters, Fourth Annual ACM Symposium on Theory of Computing, Denver, Colorado (May 1972), 44–51.Google Scholar
  13. [13]
    Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).Google Scholar
  14. [14]
    Rutledge, J. D., On Ianov's program schemata, J. ACM, 11, 1 (January 1964), 1–9.CrossRefGoogle Scholar
  15. [15]
    Shoenfield, J. R., Mathematical Logic, Addison-Wesley (1967).Google Scholar
  16. [16]
    Strong, H. R., High level languages of maximum power, Proc. IEEE Conference on Switching and Automata Theory (1971), 1–4.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Ashok K. Chandra
    • 1
  1. 1.Computer Sciences DepartmentIBM Thomas J. Watson Research CenterYorktown Heights

Personalised recommendations