A programming system with automatic program synthesis

  • E. H. Tyugu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 47)


Practical methods for linear, branching and recursive program synthesis are used for synthesizing parts of programs in a programming system. The methods are based on procedural representation of relations in problem descriptions.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (1).
    Manna Z., Waldinger H.J., Towards automatic program synthesis, Comm. ACM, vol.14, No.3, 1971.Google Scholar
  2. (2).
    Kahro M., Mannisalu M., Saan Z., Tyugu E., A programming system-PRIZ, Programming, vol.2, No.1, 1976.Google Scholar
  3. (3).
    Tyugu E.H., Solving problems on calculating models, J.Computational Mathematics and Mathematical Physics, No.5, 1970.Google Scholar
  4. (4).
    Männisalu M.A., Tyugu E.H., A problem description language UTCPIST, Control systems and computers, No.1, 1974.Google Scholar
  5. (5).
    Grigorenko V.P., Männisalu M.A., Rebane L.A., Application program package in mathematical statistics, Tallinn, 1975.Google Scholar
  6. (6).
    Tyugu E.H., Program package and source language for cutting conditions problems, Computer Languages for Numerical Control, North-Holland Publishing Company, Amsterdam, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • E. H. Tyugu
    • 1
  1. 1.Technological Research InstituteTallinn

Personalised recommendations