Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. 1.
    Bekić, H., Definable Operations in General Algebras, and the Theory of Automata and flowcharts. Notes, IBM Lab. Vienna (1969).Google Scholar
  2. 2.
    Engelfriet, J., Simple Program Schemes and Formal Languages. Springer Lecture Notes in Computer Science 20 (1974).Google Scholar
  3. 3.
    Goguen, J.A., Thatcher, J.W., Initial Algebra Semantics. IEEE Conf. Rec. SWAT 15 (1974), 63–77.Google Scholar
  4. 4.
    Indermark, K., On a class of Schematic Languages. Proc. International Seminar on Languages and Programming Theory, Madrid (1975), to appear.Google Scholar
  5. 5.
    Indermark, K., Control Structures and Monadic Languages. Proc. 2. GI-Fachtagung über Automatentheorie und Formale Sprachen (1975), Springer Lecture Notes in Computer Science, to appear.Google Scholar
  6. 6.
    Kosaraju, S.R., Analysis of Structured Programs. Journal of Computer and System Sciences 9 (1974), 232–255.Google Scholar
  7. 7.
    Milner, R., Models of LCF. Stanford Memo AIM-186 (1973).Google Scholar
  8. 8.
    Wand, M., A Concrete Approach to Abstract Recursive Definitions. Proc. Symp. Automata, Languages, and Programming (ed.:M. Nivat) Amsterdam (1973), 331–341.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Klaus Indermark
    • 1
  1. 1.Institut für InformatikUniversität BonnW-Germany

Personalised recommendations