Skip to main content

A Theoretical Foundation of Program Synthesis by Equivalent Transformation

  • Conference paper
  • First Online:

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

Abstract

Equivalent transformation (ET) is useful for synthesis and transformation of programs. However, it is not so clear what semantics should be preserved in synthesis and transformation of programs in logic and functional programming, which come from the disagreement of computation models (inference or evaluation) and equivalent transformation. To overcome the difficulty, we adopt a new computation model, called equivalent transformation model, where equivalent transformation is used not only for program synthesis, but also for computation. We develop a simple and general foundation for computation and program synthesis, and prove the correctness of ET-based program synthesis.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akama, K., Shigeta, Y., and Miyamoto, E., A Framework ofProblem Solving by Equivalent Transformation of Logic Program, J. Japan Soc. Artif. Intell., Vol.12, No.2, pp.90–99 (1997).

    Google Scholar 

  2. Akama, K., Nantajeewarawat, E., and Koike, H., A Class of Rewriting Rules and Reverse Transformation for Rule-Based Equivalent Transformation, Proc. 2nd International Workshop on Rule-Based Programming, Firenze, Italy, 2001.

    Google Scholar 

  3. Nantajeewarawat, E., Akama, K., and Koike, H., Expanding Transformation as a Basis for Correctness of Rewriting Rules, Tech. Report, Hokkaido University, 2001.

    Google Scholar 

  4. Futamura, Y., Partial Evaluation ofComputation Process-an Approach to a Compiler-Compiler. Systems. Computers. Controls. Vol.25. pp.45–50 (1971).

    Google Scholar 

  5. Lloyd, J. W., Foundations ofLogic Programming, Second edition, Springer-Verlag, 1987.

    Google Scholar 

  6. Pettorossi, A. and Proietti, M., Transformation of Logic Programs: Foundations and Techniques, The Journal of Logic Programming, Vol.19/20, pp.261–320, (1994).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akama, K., Koike, H., Mabuchi, H. (2001). A Theoretical Foundation of Program Synthesis by Equivalent Transformation. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2001. Lecture Notes in Computer Science, vol 2244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45575-2_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45575-2_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45575-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics