Logic of Programs 1983: Logics of Programs pp 279-289 | Cite as

Necessary and sufficient conditions for the universality of programming formalisms

Partial report
  • A. J. Kfoury
  • P. Urzyczyn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 164)


Binary Tree Recursive Call Work Location Program Scheme Input Location 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A]
    Abramson, F., "Interpolation theorems for program schemata", Information & Control, 36, February 1978.Google Scholar
  2. [BGS]
    Brown, Gries, and Szymanski, "Program schemes with pushdown stores", SIAM on Computing, 1, 242–268, 1972.Google Scholar
  3. [CG]
    Constable, R.C. and Gries, D., "On classes of program schemata", SIAM. J. On Computing, 1, 66–118, 1972.Google Scholar
  4. [E1]
    Engeler, E., "Algorithmic properties of structures", Math. Systems Theory, 1, 183–195, 1967.Google Scholar
  5. [E2]
    Engeler, E., "Algorithmic logic" in Foundations of Computer Science, ed. J.W. de Bakker, Mathematical Centre Trace, 63, 57–85, Amsterdam 1975.Google Scholar
  6. [E3]
    Engeler, E., "Generalized Galois Theory and its application to complexity", Theoretical Computer Science, 13, 271–293, March 1981.Google Scholar
  7. [F]
    Friedman, H., "Algorithmic procedures, generalized Turing algorithms and elementary recursion theory" in Logic Colloquium '69 edited by R.O. Gaudy & C.M.E. Yates, 361–389, North-Holland, Amsterdam, 1971.Google Scholar
  8. [GL]
    Garland and Luckham, "Program schemes, recursion schemes, and formal languages", J. of Comp. & System Sciences, 7, 1973.Google Scholar
  9. [H]
    Hawrusik, F., Ph.D. Thesis, Dept. of Computer Science, Rutgers University, 1983.Google Scholar
  10. [HVY]
    Hawrusik, F., Venkataraman, K.N., and Yasuhara, A., "Classes of functions for computing on binary trees", STOC 1981.Google Scholar
  11. [K1]
    Kfoury, A.J., "Translatability of schemas over restricted interpretations", J. of Comp. & System Sciences, 8, 387–408, June 1974.Google Scholar
  12. [K2]
    Kfoury, A.J., "Definability by programs in first-order structures", to appear in Theoretical Computer Science, January 1983.Google Scholar
  13. [KMA]
    Kfoury, A.J., R.N. Moll and M.A. Arbib, A Programming Approach to Computability, Springer-Verlag, 1982.Google Scholar
  14. [LPP]
    Luckham, D., Park, D.M.R., and Paterson, M.S., "On formalized computer programs", J. of Comp. & System Sciences, 4, 220–249, 1970.Google Scholar
  15. [L]
    Lynch, N.A., "Straight-line program length as a parameter for complexity analysis", J. of Comp. & System Sciences, 21, 251–280, December 1980.Google Scholar
  16. [LB1]
    Lynch, N.A. and Blum, E.K., "A difference in expressive power between flow-charts and recursion schemes", Mathematical System Theory, 12 205–211, 1979.Google Scholar
  17. [LB2]
    Lynch, N.A. and Blum, E.K., "Relative complexity of operations on numeric and bit-string algebras", Mathematical Systems Theory, 13, 187–207, 1980.Google Scholar
  18. [LB3]
    Lynch, N.A. and Blum, E.K., "Relative complexity of algebras", Mathematical Systems Theory, 14, 193–214, 1981.Google Scholar
  19. [PH]
    Paterson, M. and Hewitt, C., "Comparative schematology", MIT AI Lab. Memo No. 201., November 1970.Google Scholar
  20. [Pi]
    Pippenger, N., "Pebbling", in Proc. of Fifth IBM Symposium on Math. Foundations of Comp. Size, IBM Japan, May 1980.Google Scholar
  21. [S]
    Shepherdson, J.C., "Computation over abstract structures: serial and parallel procedures and Friedman's effective definitional schemes" in Logic Colloqium '73 ed. by J.C. Shepherdson and J. Rose, 445–513, North-Holland, Amsterdam, 1975.Google Scholar
  22. [U]
    Urzyczyn, P., "The unwind property in certain algebras", Information & Control, 50, 91–109, 1981.Google Scholar
  23. [V]
    Venkataraman, K.N., "Decidability of the purely existential fragment of the theory of term algebras", CTA-TR-4, Dept. of Computer Science, Rutgers University, Oct. 1981.Google Scholar
  24. [W]
    Winkler, P., "Classification of algebraic structures by work space", to appear in Algebra Universialis, 1982.Google Scholar
  25. [Y]
    Yasuhara, A., "Computability on term algebras: Part I," DCS-TR-79, Dept. of Computer Science, Rutgers University, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • A. J. Kfoury
    • 1
  • P. Urzyczyn
    • 2
  1. 1.Computer Science DepartmentBoston UniversityUSA
  2. 2.Institute of MathematicsUniversity of WarsawPoland

Personalised recommendations