Skip to main content
SpringerLink
Log in

Generalized Program Schemas

  • Conference paper
Automata, Languages and Programming (ICALP 1974)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14))

Included in the following conference series:

Abstract

The aim of this study is three-fold: (1) to study the class of computable functionals on uninterpreted domains, and the machines (or program schemes) on which such functionals can be computed, (2) to unify the notion of the interpretation for a program schema with the notion of the data structures which the schema uses, and (3) to unify a large number of the classes of program schemas considered by earlier researchers so as to clarify the various notions associated with computations on uninterpreted domains and to examine various conjectures regarding the power of “all” schemas.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brown, S., D. Cries and T. Szymanski, Program schemes with pushdown stores, SIAM J. Comput., 1, 3, (Sept. 1972), 242–268.

    MathSciNet  MATH  Google Scholar 

  2. Chandra, A. K., On the properties and applications of program schemes, Ph.D. Thesis, Computer Science, Report CS-336, AIM-188, Stanford University (March 1973).

    Google Scholar 

  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.

    Book  Google Scholar 

  4. Constable, R. L. and D. Gries, On classes of program schemata, SIAM J. Comput. 1, 1 (March 1972), 66–118.

    MathSciNet  MATH  Google Scholar 

  5. Garland, S. J. and D. C. Luckham, Program schemes, recursion schemes, and formal languages, J. Comput. Syst. Sci., 7 (1973), 119–160.

    Article  MathSciNet  MATH  Google Scholar 

  6. Ianov, I., The logical schemes of algorithms, Problems in Cybernetics, 1, Pergamon Press, New York (1960), 82–140.

    Google Scholar 

  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.

    Article  MathSciNet  MATH  Google Scholar 

  8. Manna, Z., Properties of programs and first-order predicate calculus, J. ACM, 16, 2 (April 1969), 244–255.

    Article  MATH  Google Scholar 

  9. McCarthy, J., Towards a mathematical science of computation, Proc. ICIP (1962), 21–34.

    Google Scholar 

  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. 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. Plaisted, D., Flowchart schemata with counters, Fourth Annual ACM Symposium on Theory of Computing, Denver, Colorado (May 1972), 44–51.

    Book  Google Scholar 

  13. Rogers, H., Theo of Recursive Functions and Effective Computability, McGraw-Hill (1967).

    Google Scholar 

  14. Rutledge, J. D., On Ianov’s program schemata, J. ACM, 11, 1 (January 1964), 1–9.

    Article  MathSciNet  MATH  Google Scholar 

  15. Shoenfield, J. R., Mathematical Logic, Addison-Wesley (1967).

    Google Scholar 

  16. Strong, H. R., High level languages of maximum power, Proc. IEEE Conference on Switching and Automata Theory (1971), 1–4.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sciences Department, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 10598, USA

    Ashok K. Chandra

Authors
  1. Ashok K. Chandra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes, 66 Saarbrücken/BRD, Deutschland

    Jacques Loeckx

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chandra, A.K. (1974). Generalized Program Schemas. In: Loeckx, J. (eds) Automata, Languages and Programming. ICALP 1974. Lecture Notes in Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21545-6_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21545-6_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06841-9

  • Online ISBN: 978-3-662-21545-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation