Skip to main content

Sharing in the Graph Rewriting Calculus

  • Conference paper
  • 362 Accesses

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

Abstract

The graph rewriting calculus is an extension of the ρ-calculus, handling graph like structures, with explicit sharing and cycles, rather than simple terms. We study a reduction strategy for the graph rewriting calculus which is intended to maintain the sharing in the terms as long as possible. We show that the corresponding reduction relation is adequate w.r.t. the original semantics of the graph rewriting calculus, formalising the intuition that the strategy avoids useless unsharing.

Keywords

  • Normal Form
  • Reduction Strategy
  • Garbage Collection
  • Recursion Equation
  • Matching Rule

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Supported by the projects SisteR (MIUR) and AVIAMO (University of Padova).

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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. Ariola, Z.M., Klop, J.W.: Equational term graph rewriting. Fundamenta Informaticae 26(3-4), 207–240 (1996)

    MathSciNet  MATH  Google Scholar 

  2. Ariola, Z.M., Klop, J.W.: Lambda calculus with explicit recursion. Information and Computation 139(2), 154–233 (1997)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, New York (1998)

    CrossRef  MATH  Google Scholar 

  4. Baldan, P., Bertolissi, C., Cirstea, H., Kirchner, C.: A rewriting calculus for cyclic higher-order term graphs. Mathematical Structures in Computer Science 17(3), 363–406 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Baldan, P., Bertolissi, C., Cirstea, H., Kirchner, C.: Towards a sharing strategy for the graph rewriting calculus. In: Proceedings of WRS 2007. Electr. Notes Theor. Comput. Sci., vol. 204, pp. 111–127. Elsevier (2008)

    Google Scholar 

  6. Barendregt, H.: The Lambda-Calculus, its syntax and semantics, 2nd edn. Studies in Logic and the Foundation of Mathematics. North Holland, Amsterdam (1984)

    MATH  Google Scholar 

  7. Barendregt, H.P., van Eekelen, M.C.J.D., Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., Sleep, M.R.: Term Graph Rewriting. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259, pp. 141–158. Springer, Heidelberg (1987)

    CrossRef  Google Scholar 

  8. Bertolissi, C.: The graph rewriting calculus: properties and expressive capabilities. Thèse de Doctorat d’Université, INPL, Nancy, France (2005)

    Google Scholar 

  9. Bertolissi, C., Kirchner, C.: The Rewriting Calculus as a Combinatory Reduction System. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 78–92. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  10. Borovansky, P., Kirchner, C., Kirchner, H., Moreau, P.E., Ringeissen, C.: An overview of ELAN. In: Kirchner, C., Kirchner, H. (eds.) Proc. of the WRLA 1998. Electr. Notes Theor. Comput. Sci., vol. 15, pp. 55–70 (1998)

    Google Scholar 

  11. Cirstea, H., Kirchner, C.: The rewriting calculus — Part I and II. Logic Journal of the Interest Group in Pure and Applied Logics 9(3), 427–498 (2001)

    MATH  Google Scholar 

  12. Corradini, A.: Term rewriting in CT Σ. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) TAPSOFT 1993. LNCS, vol. 668, pp. 468–484. Springer, Heidelberg (1993)

    CrossRef  Google Scholar 

  13. Corradini, A., Drewes, F.: (Cyclic) term graph rewriting is adequate for rational parallel term rewriting. Tech. Rep. TR-97-14, Dipartimento di Informatica, Pisa (1997)

    Google Scholar 

  14. Corradini, A., Gadducci, F.: Rewriting on cyclic structures: Equivalence of operational and categorical descriptions. Theoretical Informatics and Applications 33, 467–493 (1999)

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: On the adequacy of graph rewriting for simulating term rewriting. ACM Transactions on Programming Languages and Systems 16(3), 493–523 (1994)

    CrossRef  Google Scholar 

  16. Kirchner, C., Qian, Z., Singh, P.K., Stuber, J.: Xemantics: a rewriting calculus-based semantics of XSLT. Tech. Rep. A01-R-386, Loria Inria (2002)

    Google Scholar 

  17. Klop, J.W., van Oostrom, V., de Vrijer, R.: Lambda calculus with patterns. Theor. Comput. Sci. 398(1-3), 16–31 (2008)

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. Lamping, J.: An algorithm for optimal lambda calculus reduction. In: Proc. of POPL 1990, pp. 16–30. ACM (1990)

    Google Scholar 

  19. Peyton-Jones, S.: The implementation of functional programming languages. Prentice Hall, Inc. (1987)

    Google Scholar 

  20. Plump, D.: Term graph rewriting. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 2, pp. 3–61 (1999)

    Google Scholar 

  21. Sleep, M.R., Plasmeijer, M.J., van Eekelen, M.C.J.D. (eds.): Term graph rewriting: theory and practice. Wiley, London (1993)

    MATH  Google Scholar 

  22. Van Eekelen, M., Plasmeijer, R.: Functional Programming and Parallel Graph Rewriting. Addison-Wesley (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Baldan, P., Bertolissi, C. (2012). Sharing in the Graph Rewriting Calculus. In: Mossakowski, T., Kreowski, HJ. (eds) Recent Trends in Algebraic Development Techniques. WADT 2010. Lecture Notes in Computer Science, vol 7137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28412-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28412-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28411-3

  • Online ISBN: 978-3-642-28412-0

  • eBook Packages: Computer ScienceComputer Science (R0)