Skip to main content
SpringerLink
Log in

RAPT: A Program Transformation System Based on Term Rewriting

  • Conference paper
Term Rewriting and Applications (RTA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4098))

Included in the following conference series:

  • 365 Accesses

Abstract

Chiba et al. (2005) proposed a framework of program transformation by template based on term rewriting in which correctness of the transformation is verified automatically. This paper describes RAPT (Rewriting-based Automated Program Transformation system) which implements this framework.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  2. Bundy, A.: The automation of proof by mathematical induction. In: Handbook of Automated Reasoning, ch. 13, pp. 845–911. Elsevier and MIT Press (2001)

    Google Scholar 

  3. Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. Journal of the ACM 24(1), 44–67 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chiba, Y., Aoto, T., Toyama, Y.: Program transformation by templates based on term rewriting. In: Proceedings of the 7th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2005), pp. 59–69. ACM Press, New York (2005)

    Chapter  Google Scholar 

  5. Comon, H.: Inductionless induction. In: Handbook of Automated Reasoning, ch. 14, pp. 913–962. Elsevier and MIT Press (2001)

    Google Scholar 

  6. de Moor, O., Sittampalam, G.: Higher-order matching for program transformation. Theoretical Computer Science 269, 135–162 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hirokawa, N., Middeldorp, A.: Tsukuba termination tool. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 311–320. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Huet, G., Lang, B.: Proving and applying program transformations expressed with second order patterns. Acta Informatica 11, 31–55 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kapur, D., Narendran, P., Zhang, H.: On sufficient-completeness and related properties of term rewriting systems. Acta Informatica 24(4), 395–415 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lazrek, A., Lescanne, P., Thiel, J.J.: Tools for proving inductive equalities, relative completeness, and ω-completeness. Information and Computation 84, 47–70 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. Nipkow, T., Weikum, G.: A decidability result about sufficient-completeness of axiomatically specified abstract data types. In: Cremers, A.B., Kriegel, H.-P. (eds.) GI-TCS 1983. LNCS, vol. 145, pp. 257–268. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  12. Paige, R.: Future directions in program transformations. ACM Computing Surveys 28(4es), 170 (1996)

    Article  MathSciNet  Google Scholar 

  13. Partsch, H., Steinbrüggen, R.: Program transformation systems. ACM Computing Surveys 15(3), 199–236 (1983)

    Article  Google Scholar 

  14. Reddy, U.S.: Term rewriting induction. In: Stickel, M.E. (ed.) CADE 1990. LNCS (LNAI), vol. 449, pp. 162–177. Springer, Heidelberg (1990)

    Google Scholar 

  15. Sittampalam, G.: Higher-Order Matching for Program Transformation. PhD thesis, Magdalen College (2001)

    Google Scholar 

  16. Wadler, P.: Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science 73, 231–248 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute of Electrical Communication, Tohoku University, Japan

    Yuki Chiba & Takahito Aoto

Authors
  1. Yuki Chiba
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takahito Aoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carnegie Mellon University,  

    Frank Pfenning

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chiba, Y., Aoto, T. (2006). RAPT: A Program Transformation System Based on Term Rewriting. In: Pfenning, F. (eds) Term Rewriting and Applications. RTA 2006. Lecture Notes in Computer Science, vol 4098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11805618_20

Download citation

  • DOI: https://doi.org/10.1007/11805618_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36834-2

  • Online ISBN: 978-3-540-36835-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation