Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Simple program schemes and formal languages

  • Chapter
  • First Online:
Simple Program Schemes and Formal Languages

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, "Indexed grammars — an extension of context-free grammars", Journal of the Association for Computing Machinery 15(1968), pp. 647–671.

    Google Scholar 

  2. E. Ashcroft and Z. Manna, "The translation of "go to" programs to "while" programs", Proc. IFIP Congress 71.

    Google Scholar 

  3. E. Ashcroft, Z. Manna and A. Pnueli, "Decidable properties of monadic functional schemas", Journal of the Association for Computing Machinery 20 (1973), pp. 489–499.

    Google Scholar 

  4. J.W. de Bakker, "Semantics of programming languages", Advances in Information Systems Science, Vol.2, Plenum Press, 1969, pp. 173–227.

    Google Scholar 

  5. J.W. de Bakker, "Recursive procedures", Mathematical Centre Tracts 24, Mathematisch Centrum, Amsterdam, 1971.

    Google Scholar 

  6. J.W. de Bakker and L.G.L. Th. Meertens, "On the completeness of the inductive assertion method", Report IW 12/73 (prepublication), Mathematisch Centrum, Amsterdam, 1973.

    Google Scholar 

  7. J.W. de Bakker and W.P. de Roever, "A calculus for recursive program schemes", Automata, Languages and Programming (M. Nivat ed.), North Holland Publ. Co. and American Elsevier Publ. Co., 1973, pp. 167–196.

    Google Scholar 

  8. J.W. de Bakker and D. Scott, "A theory of programs", Unpublished notes, Vienna, 1969.

    Google Scholar 

  9. G. Birkhoff, "Lattice theory", AMS Colloquium Publications Vol. XXV, AMS, 1967, Third Edition.

    Google Scholar 

  10. A. Blikle, "Nets; complete lattices with a composition", Bulletin de l'Academie Polonaise des Sciences, Série des sciences math., astr. et phys. 19 (1971), pp. 1123–1127.

    Google Scholar 

  11. A. Blikle, "Equations in nets — computer oriented lattices", CCPAS Reports 99, Warsaw, 1973.

    Google Scholar 

  12. C. Böhm and G. Jacopini, "Flow diagrams, Turing machines and languages with only two formation rules", Communications of the Association for Computing Machinery 9 (1966), pp. 366–371.

    Google Scholar 

  13. R.V. Book, "Topics in formal language theory", Currents in the Theory of Computing (A.V.Aho ed.), Prentice-Hall, 1973, pp. 1–34.

    Google Scholar 

  14. S. Brown, D. Gries and T. Szymanski, "Program schemes with pushdown stores", SIAM Journal on Computing 1 (1972), pp. 242–268.

    Google Scholar 

  15. J. Bruno and K. Steiglitz, "The expression of algorithms by charts", Journal of the Association for Computing Machinery 19 (1972), pp. 517–525.

    Google Scholar 

  16. R.M. Burstall and P.J. Landin, "Programs and their proofs: an algebraic approach", Machine Intelligence 4 (B. Meltzer and D. Michie eds.), Edinburgh at the University Press, 1969, pp. 17–43.

    Google Scholar 

  17. R.M. Burstall and J.W. Thatcher, "The algebraic theory of recursive program schemes", Proc. of the First International Symposium on Category Theory applied to Computation and Control, University of Mass., 1974, pp. 154–160.

    Google Scholar 

  18. A.K. Chandra, "On the properties and applications of program schemas", Ph.D. Thesis, Report CS-336, AIM-188, Stanford University, 1973.

    Google Scholar 

  19. A.K. Chandra, "Degrees of translatability and canonical forms in program schemas: Part I", Sixth Annual ACM Symposium on Theory of Computing, 1974, pp. 1–12.

    Google Scholar 

  20. A.K. Chandra and Z. Manna, "Program schemas with equality", Fourth Annual ACM Symposium on Theory of Computing, 1972, pp. 52–64.

    Google Scholar 

  21. A.K. Chandra and Z. Manna, "On the power of programming features", Report CS-333, AIM-185, Stanford University, 1973.

    Google Scholar 

  22. J.C. Cherniavsky and R.L. Constable, "Representing program schemes in logic", IEEE 13th Annual Symposium on Switching and Automata Theory, 1972, pp. 27–39.

    Google Scholar 

  23. R.L. Constable and D. Gries, "On classes of program schemata", SIAM Journal on Computing 1 (1972), pp. 66–118.

    Google Scholar 

  24. D.C. Cooper, "Böhm and Jacopini's reduction of flow charts", Communications of the Association for Computing Machinery 10 (1967), pp. 463, 473.

    Google Scholar 

  25. D.C. Cooper, "Program schemes, programs and logic", Symposium on Semantics of Algorithmic Languages (E. Engeler ed.), Lecture Notes in Mathematics 188, Springer-Verlag, 1971, pp. 62–70.

    Google Scholar 

  26. A. Dubinsky, "The functions computed by a monadic program schema with one location", Automata, Languages and Programming (M. Nivat ed.), North-Holland Publishing Co. and American Elsevier Publishing Co., 1973, pp. 521–535.

    Google Scholar 

  27. C.C. Elgot, "The common algebraic structure of exit-automata and machines", Computing 6 (1970), pp. 349–370.

    Google Scholar 

  28. C.C. Elgot, "Algebraic theories and program schemes", Symposium on Semantics of Algorithmic Languages (E. Engeler ed.), Lecture Notes in Mathematics 188, Springer-Verlag, 1971, pp. 71–88.

    Google Scholar 

  29. C.C. Elgot, "Remarks on one-argument program schemes", Formal Semantics of Programming Languages (R. Rustin ed.), Prentice-Hall, 1972, pp. 59–64.

    Google Scholar 

  30. E. Engeler, "Algorithmic properties of structures", Mathematical Systems Theory 1 (1967), pp. 183–195.

    Google Scholar 

  31. J. Engelfriet, "Generalisierte Ianovschemata", Mitteilungen der Gesellschaft für Mathematik und Datenverarbeitung Nr. 17, 1971, Bonn, pp. 15–18.

    Google Scholar 

  32. J. Engelfriet, "Ianov schemes and formal languages", Seminar on Some syntactical and semantical problems in theoretical computer science, Abstract No. 2, Utrecht, 1971.

    Google Scholar 

  33. J. Engelfriet, "Program schemes and formal languages", Séminaires IRIA, Théorie des algorithmes, des langages et de la programmation, Rocquencourt, 1972, pp. 25–31.

    Google Scholar 

  34. J. Engelfriet, "A note on infinite trees", Information Processing Letters 1 (1972), pp. 229–232.

    Google Scholar 

  35. J. Engelfriet, "Programmschemata mit Hilfsvariablen", Mathematisches Forschungsinstitut Oberwolfach, Tagungsbericht 43, 1972, pp. 7–8.

    Google Scholar 

  36. J. Engelfriet, "Translation of simple program schemes", Automata, Languages and Programming (M. Nivat ed.), North-Holland Publishing Co. and American Elsevier Publishing Co., 1973, pp. 215–223.

    Google Scholar 

  37. A.P. Ershov, "Theory of program schemata", Proc. IFIP Congress 71.

    Google Scholar 

  38. M.J. Fischer, "Grammars with macro-like productions", IEEE 9th Annual Symposium on Switching and Automata Theory, 1968, pp. 131–142.

    Google Scholar 

  39. R.W. Floyd, "Nondeterministic algorithms", Journal of the Association for Computing Machinery 14 (1967), pp. 636–644.

    Google Scholar 

  40. S.J. Garland and D.C. Luckham, "Program schemes, recursion schemes and formal languages", Journal of Computer and System Sciences 7 (1973), pp. 119–160.

    Google Scholar 

  41. M.M. Geller and M.A. Harrison, "Characterizations of LR(0) languages", IEEE 14th Annual Symposium on Switching and Automata Theory, 1973.

    Google Scholar 

  42. S. Ginsburg, "The Mathematical Theory of Context-free Languages", McGraw-Hill Book Company, 1966.

    Google Scholar 

  43. S. Ginsburg and S. Greibach, "Deterministic context free languages", Information and Control 9 (1966), pp. 620–648.

    Google Scholar 

  44. S. Ginsburg, S. Greibach and J.E. Hopcroft, "Studies in abstract families of languages", Memoirs of the American Mathematical Society, Number 87, AMS, 1969.

    Google Scholar 

  45. J.A. Goguen, Jr., "On homomorphisms, simulations, correctness and subroutines for programs and program schemes", IEEE 13th Annual Symposium on Switching and Automata Theory, 1972, pp. 52–60.

    Google Scholar 

  46. J.A. Goguen Jr., "Axioms, extensions and applications for fuzzy sets: languages and the representation of concepts", IBM Research Report RC 4547, 1973.

    Google Scholar 

  47. J. Gruska, "A characterization of context-free languages", Journal of Computer and System Sciences 5 (1971), pp. 353–364.

    Google Scholar 

  48. M.A. Harrison and I.M. Havel, "Strict deterministic grammars", Journal of Computer and System Sciences 7 (1973), pp. 237–277.

    Google Scholar 

  49. H. Hermes, "Enumerability, decidability and computability; an introduction to the theory of recursive functions", Springer-Verlag, 1965.

    Google Scholar 

  50. J.E. Hopcroft and J.D. Ullman, "Formal languages and their Relation to Automata", Addison-Wesley Publishing Co., 1969.

    Google Scholar 

  51. Iu. I. Ianov, "On the logical schemes of algorithms", Problems of Cybernetics 1 (1960), pp. 82–140.

    Google Scholar 

  52. K. Indermark, "On Ianov schemes with one memory location", GI 1. Fachtagung über Automatentheorie und Formale Sprachen, Lecture Notes in Computer Science 2, Springer-Verlag, 1973, pp. 284–293.

    Google Scholar 

  53. S. Igarashi, "On the logical schemes of algorithms", Information Processing in Japan 3 (1963), pp. 12–18.

    Google Scholar 

  54. T. Ito, "Some formal properties of a class of non-deterministic program schemata", IEEE 9th Annual Symposium on Switching and Automata Theory, 1968, pp. 85–98.

    Google Scholar 

  55. L.A. Kaluzhnin, "Algorithmization of mathematical problems", Problems of Cybernetics 2 (1961), pp. 371–391.

    Google Scholar 

  56. D.M. Kaplan, "Regular expressions and the equivalence of programs", Journal of Computer and System Sciences 3 (1969), pp. 361–386.

    Google Scholar 

  57. R.M. Karp, "A note on the application of graph theory to digital computer programming", Information and Control 3 (1960), pp. 179–190.

    Google Scholar 

  58. D. Kfoury, "Comparing algebraic structures up to algorithmic equivalence", Automata, Languages and Programming (M. Nivat ed.), North-Holland Publishing Co. and American Elsevier Publishing Co., 1973, pp. 253–263.

    Google Scholar 

  59. D.E. Knuth and R.W. Floyd, "Notes on avoiding "go to" statements", Information Processing Letters 1 (1971), pp. 23–31.

    Google Scholar 

  60. A.J. Korenjak and J.E. Hopcroft, "Simple deterministic languages", IEEE 7th Annual Symposium on Switching and Automata Theory, 1966, pp. 36–46.

    Google Scholar 

  61. H. Langmaack, "On procedures as open subroutines", Report A 73/04, Universität des Saarlandes, Saarbrücken, 1973.

    Google Scholar 

  62. D.C. Luckham, D.M.R. Park and M.S. Paterson, "On formalised computer programs", Journal of Computer and System Sciences 4 (1970), pp. 220–249.

    Google Scholar 

  63. Z Manna, "Properties of programs and the first-order predicate calculus", Journal of the Association for Computing Machinery 16 (1969), pp. 244–255.

    Google Scholar 

  64. Z. Manna, "Program Schemas", Currents in the Theory of Computing (A.V. Aho ed.), Prentice-Hall, 1973, pp. 90–142.

    Google Scholar 

  65. A. Mazurkiewicz, "Iteratively computable relations", Bulletin de l'Academie Polonaise des Sciences, Série des sciences math., astr. et phys. 20 (1972), pp. 793–798.

    Google Scholar 

  66. A. Mazurkiewicz, "Recursive algorithms and formal languages", Bulletin de l'Academie Polonaise des Sciences, Série des sciences math., astr. et phys. 20 (1972), pp. 799–803.

    Google Scholar 

  67. J. McCarthy, "Towards a mathematical science of computation", Proc. IFIP Congress 1962, pp. 21–28.

    Google Scholar 

  68. J. McCarthy, "A basis for a mathematical theory of computation", Computer Programming and Formal Systems (P. Braffort and D. Hirschberg eds.), North-Holland Publishing Co., 1963, pp. 33–70.

    Google Scholar 

  69. J. Mezei and J.B. Wright, "Algebraic automata and context-free sets", Information and Control 11 (1967), pp. 3–29.

    Google Scholar 

  70. R. Milner, "Equivalences on program schemes", Journal of Computer and System Sciences 4 (1970), pp. 205–219.

    Google Scholar 

  71. J.H. Morris Jr., "Another recursion induction principle", Communications of the Association for Computing Machinery 14 (1971), pp. 351–354.

    Google Scholar 

  72. M. Nivat, "Langages algébriques sur le magma libre et sémantique des schémas de programme", Automata, Languages and Programming (M. Nivat ed.), North-Holland Publishing Co. and American Elsevier Publishing Co., 1973, pp. 293–307.

    Google Scholar 

  73. M.S. Paterson, "Equivalence problems in a model of computation", Ph.D. Thesis, University of Cambridge, 1967.

    Google Scholar 

  74. M.S. Paterson, "Decision problems in computational models", Proc. of an ACM Conference on Proving Assertions about Programs, SIGACT News 14, 1972, pp. 74–82.

    Google Scholar 

  75. M.S. Paterson and C.E. Hewitt, "Comparitive schematology", Record of the Project MAC Conference on Concurrent Systems and Parallel Computation, 1970, pp. 119–127.

    Google Scholar 

  76. H. Rogers, Jr., "Theory of recursive functions and effective computability", McGraw-Hill Book Company, 1967.

    Google Scholar 

  77. B.K. Rosen, "Program equivalence and context-free grammars", IEEE 13th Annual Symposium on Switching and Automate Theory, 1972, pp. 7–18.

    Google Scholar 

  78. W.C. Rounds, "Tree-oriented proofs of some theorems on context-free and indexed languages", Second Annual ACM Symposium on Theory of Computing, 1970, pp. 109–116.

    Google Scholar 

  79. J.D. Rutledge, "On Ianov's program schemata", Journal of the Association for Computing Machinery 11 (1964), pp. 1–9.

    Google Scholar 

  80. A. Salomaa, "Formal Languages", Academic Press, 1973.

    Google Scholar 

  81. D. Scott, "An outline of a mathematical theory of computation", Proc. of the Fourth Annual Princeton Conference on Information Sciences and Systems, 1970, pp. 169–176.

    Google Scholar 

  82. D. Scott, "The lattice of flow diagrams", Symposium on Semantics of Algorithmic Languages (E. Engeler ed.), Lecture Notes in Mathematics 188, Springer-Verlag, 1971, pp. 311–366.

    Google Scholar 

  83. R.E. Stearns, "A regularity test for pushdown machines", Information and Control 11 (1967), pp. 323–340.

    Google Scholar 

  84. H.R. Strong Jr., "High level languages of maximum power", IEEE 12th Annual Symposium on Switching and Automata Theory, 1971, pp. 1–4.

    Google Scholar 

  85. H.R. Strong Jr., "Translating recursion equations into flow charts", Journal of Computer and System Sciences 5 (1971), pp. 254–285.

    Google Scholar 

  86. H.P. Zeiger, "Formal models for some features of programming languages", First Annual ACM Symposium on Theory of Computing, 1969, pp. 211–215.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Technical University Twente, Enschede, Nederland

    Jost Engelfriet

Authors
  1. Jost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jost Engelfriet

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Engelfriet, J. (1974). Simple program schemes and formal languages. In: Engelfriet, J. (eds) Simple Program Schemes and Formal Languages. Lecture Notes in Computer Science, vol 20. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06953-4_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-06953-4_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37197-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation