Skip to main content
SpringerLink
Log in

Recursive converters on a memory

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. A. V. Anisimov, “Syntactic properties of recursive program schemes,” Kibernetika, No. 3 (1977).

  2. E. Ashcroft, Z. Manna, and A. Pnuelli, “Solvable properties of one-argument functional schemes,” Languages and Automata [Russian translation], Mir, Moscow (1975).

    Google Scholar 

  3. D. W. Barron, Recursive Techniques in Programming, American Elsevier (1968).

  4. S. Garland and D. Lackham, “Standard schemes, recursive schemes, and formal languages,” Cybernetic Collection. New Series [Russian translation], No. 13, Mir, Moscow (1976).

    Google Scholar 

  5. V. M. Glushkov, “Theory of automata and questions of the design of digital machine structures,” Kibernetika, No. 1 (1965).

  6. V. M. Glushkov, “On the question of minimizing microprograms and algorithm schemes,” Kibernetika, No. 5 (1966).

  7. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Theory of structures of data and synchronized parallel calculations,” Kibernetika, No. 6 (1976).

  8. V. M. Glushkov and A. A. Letichevskii, “Theory of discrete converters,” in: Selected Questions of Algebra and Logic [in Russian], Novosibirsk (1973).

  9. A. P. Ershov, “Operator algorithms,” in: Problems of Cybernetics [in Russian], No. 3, Fizmatgiz, Moscow (1969).

    Google Scholar 

  10. A. A. Letichevskii, “Functional equivalence of discrete converters. II,” Kibernetika, No. 2 (1970).

  11. A. A. Letichevskii, “On the acceleration of iteration of monotonic operators,” Kibernetika, No. 4 (1976).

  12. A. A. Lyapunov, “On the algebraic treatment of programming,” in: Problems of Cybernetics [in Russian], No. 8, Fizmatgiz, Moscow (1962).

    Google Scholar 

  13. M. Paterson and K. Hewitt, “Comparative schematology,” in: Cybernetic Collection. New Series [Russian translation], No. 13, Mir, Moscow (1976).

    Google Scholar 

  14. Yu. I. Yanov, “On logical algorithm schemes,” in: Problems of Cybernetics [in Russian], No. 1, Fizmatgiz, Moscow (1958).

    Google Scholar 

  15. T. Agerwala, “A survey of techniques to reduce (minimize the control part) ROM of a microprogrammed digital computer,” Johns Hopkins Comput. Res. Reports, No. 30 (1973).

  16. J. W. De Bakker and D. Scott, A Theory of Programs (unpublished paper) (August, 1969).

  17. M. Bird, “The equivalence problem for deterministic two-tape automata,” J. Comput. Syst. Sci.,7, No. 2 (1973).

  18. R. L. Constable and D. Gries, “On classes of program schemata,” SIAM J. Comput.,1, No. 1 (1972).

  19. B. J. Cornelius and G. H. Kirby, “A programming technique for recursive procedures,” BIT, Nord. Tidsskr. Inf. Behandling,16 (1976).

  20. E. P. Friedman, “Equivalence problems in monadic recursion schemes,” Proceedings of the Fourteenth Annual Symposium on Switching and Automata Theory, Iowa City, Iowa (1973), pp. 26–33.

  21. V. M. Glushkov, M. B. Ignat'ev, V. A. Myasnikov, and V. A. Torgashev, “Recursive machines and computing technology,” Proc. IFIP (1974).

  22. S. A. fnGreibach, “Theory of program structures: schemes, sematics, verification,” in: Lecture Notes in Computer Sciences, Vol. 36, Springer Verlag, Berlin-Heidelberg-New York.

  23. Z. Manna, S. Ness, and J. Vuillemin, “Inductive methods for proving properties of programs,” Commun. ACM,16, 491–502 (1973).

    Google Scholar 

  24. J. McCarthy, P. W. Abrahams, D. J. Edwards, T. P. Hart, and M. I. Levin, LISP 1.5 Programmers Manual, MIT Press, Cambridge, Mass. (1962).

    Google Scholar 

  25. J. McCarthy, “Recursive functions of symbolic expressions and their computation by machine. I,” Commun. ACM,3 (1960).

  26. J. McCarthy, “Towards a mathematical science of computation,” Proc. IFIP Congr. (1962), pp. 21–28.

  27. V. A. Nepomniashy, “On divergence problems for program schemes,” in: Lecture Notes in Computer Sciences, Vol. 45, Springer-Verlag, Berlin-Heidelberg-New York (1977).

    Google Scholar 

  28. M. S.Paterson, “Equivalence problems in a model of computation,” Doctoral Thesis. Artificial Intelligence Tech. Memo.No. 1, MIT, Cambridge, Mass. (1970).

    Google Scholar 

  29. B. K. Rosen. “Tree-manipulating systems and Church-Rosser theorems,” J. ACM,20 (1973).

  30. B. K. Rosen, “Program equivalence and context-free grammars,” J. Comput. Syst. Sci.,11, (1975).

  31. H. R. Strong, “Translating recursion equations into flow charts,” J. Comput. Syst. Sci., No. 5, (1951).

  32. H. R. Strong, “High level languages of maximum power,” Proceedings of the IEEE Conference on Switching and Automata Theory (1971), pp. 1–4.

  33. N. Wirth, “The programming language PASCAL,” Acta Inf.,1 (1971).

  34. N. Wirth and C. A. R. Hoare, “A contribution to the development of ALGOL,” Commun. ACM,9, No. 6 (1966).

Download references

Authors
  1. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 16–26, November–December, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, A.V. Recursive converters on a memory. Cybern Syst Anal 14, 823–834 (1978). https://doi.org/10.1007/BF01070274

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01070274

Keywords

Search

Navigation