Article

Rewriting term-graphs with priority

Authors:

Ricardo Caferra,

Rachid Echahed,

Nicolas PeltierAuthors Info & Claims

PPDP '06: Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming

Pages 109 - 120

https://doi.org/10.1145/1140335.1140350

Published: 10 July 2006 Publication History

Abstract

We define a new class of rewrite systems operating over term-graphs. Our aim is twofold. First we propose to extend classical first-order rewrite rules in order to process easily data-structures with pointers (e.g., circular lists, doubly linked lists etc). For that, our rules provide specific features such as pointer (edges) redirections, relabeling of existing nodes etc. Unfortunately, such features are very often source of non confluence. Our second aim is then to ensure confluence of the considered rewrite systems in the new class. We introduce the notion of term-graphs with priority and show that orthogonal rewrite systems are confluent in our setting

References

[1]

H. Aït-Kaci and A. Podelski. Towards a Meaning of LIFE. J. Log. Program., 16(3):195--234, 1993.]]

[2]

S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In Proc. 21st ACM. Symp. on Principles of Programming Languages, pages 268--279, 1994.]]

Digital Library

[3]

Z. M. Ariola and S. Blom. Cyclic λ calculi. In TACS, pages 77--106, 1997.]]

Digital Library

[4]

Z. M. Ariola and S. Blom. Skew and mega-skew confluence and abstract böhm semantics. In Processes, Terms and Cycles, pages 368--403, 2005.]]

Digital Library

[5]

Z. M. Ariola, J. W. Klop, and D. Plump. Bisimilarity in term graph rewriting. Inf. Comput., 156(1-2):2--24, 2000.]]

Digital Library

[6]

R. Banach. Term Graph Rewriting and Garbage Collection Using Ppfibrations. Theor. Comput. Sci., 131(1):29--94, 1994.]]

Digital Library

[7]

H. Barendregt, M. van Eekelen, J. Glauert, R. Kenneway, M. J. Plasmeijer, and M. Sleep. Term Graph Rewriting. In PARLE'87, pages 141--158. Springer, LNCS 259, 1987.]]

Digital Library

[8]

C. Bertolissi. The graph rewriting calculus: Confluence and expressiveness. In 9th Italian Conference on Theoretical Computer Science, LNCS 3701, pages 113--127, 2005.]]

Digital Library

[9]

C. Bertolissi, P. Baldan, H. Cirstea, and C. Kirchner. A rewriting calculus for cyclic higher-order term graphs. Electr. Notes Theor. Comput. Sci., 127(5):21--41, 2005.]]

Digital Library

[10]

H. Cirstea, C. Kirchner, L. Liquori, and B. Wack. Rewrite strategies in the rewriting calculus. Electr. Notes Theor. Comput. Sci., 86(4), 2003.]]

[11]

A. Corradini. Term Rewriting in CTΕ. In Proc. of the 4th International Joint Conference CAAP-FASE (TAPSOFT'93), pages 468--484. LNCS 668, 1993.]]

Digital Library

[12]

A. Corradini and F. Gadducci. Rewriting on cyclic structures: Equivalence between the operational and the categorical description. ITA, 33(4/5):467--493, 1999.]]

[13]

N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (B), pages 243--320. 1990.]]

Digital Library

[14]

D. J. Dougherty, P. Lescanne, L. Liquori, and F. Lang. Addressed term rewriting systems: Syntax, semantics, and pragmatics: Extended abstract. Electr. Notes Theor. Comput. Sci., 127(5):57--82, 2005.]]

Digital Library

[15]

R. Echahed and J.-C. Janodet. Admissible graph rewriting and narrowing. In Proceedings of 15th International Conference and Symposium on Logic Programming, pages 325--340, Manchester, 1998. MIT Press.]]

Digital Library

[16]

R. Echahed and J. C. Janodet. Parallel admissible graph rewriting. In Recent Developments in Algebraic Development Techniques, pages 121--135. LNCS 1589, 1999.]]

Digital Library

[17]

M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583--628, 1994.]]

[18]

J. R. Kennaway, J. K. Klop, M. R. Sleep, and F. J. De Vries. On the Adequacy of Graph Rewriting for Simulating Term Rewriting. ACM Transactions on Programming Languages and Systems, 16(3):493--523, 1994.]]

Digital Library

[19]

J. R. Kennaway, J. K. Klop, M. R. Sleep, and F. J. De Vries. Transfinite Reduction in Orthogonal Term Rewriting Systems. Information and Computation, 119(1):18--38, 1995.]]

Digital Library

[20]

R. Plasmeijer and M. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, 1993.]]

Digital Library

[21]

D. Plump. Term graph rewriting. In H. Ehrig, G. Engels, H. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2. World Scientific, 1998.]]

Digital Library

[22]

D. Plump. Confluence of graph transformation revisited. In Processes, Terms and Cycles, pages 280--308, 2005.]]

Digital Library

[23]

H. Schorr and W. M. Waite. An Efficient Machine Independent Procedure for Garbage Collection in Various List Structures. Communication of the ACM, 10:501--506, August 1967.]]

Digital Library

[24]

E. Visser. A survey of strategies in rule-based program transformation systems. J. Symb. Comput., 40(1):831--873, 2005.]]

Digital Library

Cited By

Echahed RPeltier N(2008)A Needed Rewriting Strategy for Data-Structures with PointersProceedings of the 19th international conference on Rewriting Techniques and Applications10.1007/978-3-540-70590-1_5(63-78)Online publication date: 15-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-70590-1_5
Echahed RPeltier N(2007)Non strict confluent rewrite systems for data-structures with pointersProceedings of the 18th international conference on Term rewriting and applications10.5555/1779782.1779794(137-152)Online publication date: 26-Jun-2007
https://dl.acm.org/doi/10.5555/1779782.1779794
De Koninck LSchrijvers TDemoen BLeuschel MPodelski A(2007)User-definable rule priorities for CHRProceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming10.1145/1273920.1273924(25-36)Online publication date: 14-Jul-2007
https://dl.acm.org/doi/10.1145/1273920.1273924
Show More Cited By

Index Terms

Rewriting term-graphs with priority
1. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms
      1. Rewrite systems
    2. Grammars and context-free languages

Recommendations

Confluent term rewriting systems
RTA'05: Proceedings of the 16th international conference on Term Rewriting and Applications

The confluence property is one of the most important properties of term rewriting systems, and various sufficient criteria for proving this property have been widely investigated. A necessary and sufficient criterion for confluence of terminating term ...
Conditions for confluence of innermost terminating term rewriting systems

This paper presents a counterexample for the open conjecture whether innermost joinability of all critical pairs ensures confluence of innermost terminating term rewriting systems. We then show that innermost joinability of all normalized instances of ...
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

Yi and Sakai [Y. Wang and M. Sakai. Decidability of termination for semi-constructor trss, left-linear shallow trss and related systems. In the 17th International Conference on Rewriting Techniques and Applications, volume 4098 of Lecture Notes in ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PPDP '06: Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming

July 2006

280 pages

ISBN:1595933883

DOI:10.1145/1140335

General Chair:
Annalisa Bossi
Università Ca' Foscari di Venezia, Italy
,
Program Chair:
Michael Maher
National ICT Australia & University of New South Wales, Australia

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 July 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PPDP06

Sponsor:

PPDP06: Principles and Practice of Declarative Programming

July 10 - 12, 2006

Venice, Italy

Acceptance Rates

Overall Acceptance Rate 230 of 486 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
144
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Echahed RPeltier N(2008)A Needed Rewriting Strategy for Data-Structures with PointersProceedings of the 19th international conference on Rewriting Techniques and Applications10.1007/978-3-540-70590-1_5(63-78)Online publication date: 15-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-70590-1_5
Echahed RPeltier N(2007)Non strict confluent rewrite systems for data-structures with pointersProceedings of the 18th international conference on Term rewriting and applications10.5555/1779782.1779794(137-152)Online publication date: 26-Jun-2007
https://dl.acm.org/doi/10.5555/1779782.1779794
De Koninck LSchrijvers TDemoen BLeuschel MPodelski A(2007)User-definable rule priorities for CHRProceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming10.1145/1273920.1273924(25-36)Online publication date: 14-Jul-2007
https://dl.acm.org/doi/10.1145/1273920.1273924
Echahed RPeltier N(2007)Non Strict Confluent Rewrite Systems for Data-Structures with PointersTerm Rewriting and Applications10.1007/978-3-540-73449-9_12(137-152)Online publication date: 2007
https://doi.org/10.1007/978-3-540-73449-9_12
Echahed RPeltier N(2006)Narrowing data-structures with pointersProceedings of the Third international conference on Graph Transformations10.1007/11841883_8(92-106)Online publication date: 17-Sep-2006
https://dl.acm.org/doi/10.1007/11841883_8

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten