Skip to main content
SpringerLink
Log in

Program transformation by solving equations

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Based on the theory of orthogonal program expansion[8–10], the paper proposes a method to transform programs by solving program equations. By the method, transformation goals are expressed in program equations, and achieved by solving these equations. Although such equations are usually too complicated to be solved directly, the orthogonal expansion of programs makes it possible to reduce such equations into systems of equations only containing simple constructors of programs. Then, the solutions of such equations can be derived by a system of solving and simplifying rules, and algebraic laws of programs. The paper discusses the methods to simplify and solve equations and gives some examples.

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

Similar content being viewed by others

References

  1. P. Pepper (ed.), Program Transformation and Programming Environments. Springer-Verlag, 1984.

  2. L. G. L. T. Meertens (ed.), Program Specification and Transformation. North-Holland, 1987.

  3. J. Backus, Can programming be liberated from the von Neumann style? A functional style and its algebra of programs.CACM,21:8 (1978), 613–641.

    MATH  MathSciNet  Google Scholar 

  4. F. Bellegarde, Convergent Term Rewriting Systems Can be Used for Program Transformation. inProgram as Data Objects, H. Ganzinger and N. D. Jones eds., Springer-Verlag, 1986.

  5. J. Darlington, The Structured Description of Algorithm Derivations, inAlgorithmic Languages, de Bakker and van Vliet eds., IFIP, North-Holland, 1981, 221–250.

    Google Scholar 

  6. D. S. Wile, Program developments: Formal explanations of implementations.CACM, 26:11(1983), 902–911.

    Google Scholar 

  7. Jin Lingzi, Research on the Metalanguage for Transformational Programming. Ph. D Thesis, Nanjing University, Oct. 1987.

  8. Zhu Hong, Some mathematical properties of the functional programming language FP.Journal of Computer Science and Technology,2:3(1987), 202–216.

    Article  MathSciNet  Google Scholar 

  9. Zhu Hong, A Theory of Program Expansion and Its Application to Programming. Ph. D Thesis, Nanjing University, 1987.

  10. Zhu Hong, A theory of program expansion,Scientia Sinica (Series A), 8(1988), 887–896.

    Google Scholar 

  11. Zhu Hong, An Orthogonal Expansion Approach to Transformation of Functional Programs. Proc. Int’l Conf. New Generation Computer System, April, 1989, Beijing.

  12. G. Huet, Deduction and Computation. inLogic of Programming and Calculi of Discrete Design, International Summer School, Marktoberdorf, Germany, 1986.

    Google Scholar 

  13. P. Wadler, Applicative Style Programming, Program Transformation, and List Operator. Proc. FPLCA’81, 25–32(1981)

  14. J. Darington and R. M. Burstall, A System Which Automatically Improves Programs.Acta Informatica,6(1976), 41–60.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Nanjing University, 210008, Nanjing

    Zhu Hong

Authors
  1. Zhu Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhu, H. Program transformation by solving equations. J. of Comput. Sci. & Technol. 6, 167–177 (1991). https://doi.org/10.1007/BF02945368

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation