Abstract
We propose a reduction strategy for systems of rewrite rules operating on term-graphs. These term-graphs are intended to encode pointer-based data-structures that are commonly used in programming, with cycles and sharing. We show that this reduction strategy is optimal w.r.t. a given dependency schema, which intuitively encodes the “interferences” among the nodes in the term-graphs. We provide a new way of computing such dependency schemata.
This work has been partly funded by the project ARROWS of the French Agence Nationale de la Recherche.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) Algebraic and Logic Programming; Third International Conference; Proceedings, Berlin, Germany, pp. 143–157. Springer, Berlin, Germany (1992)
Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol. 632, pp. 143–157. Springer, Heidelberg (1992)
Caferra, R., Echahed, R., Peltier, N.: Rewriting term-graphs with priority. In: Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pp. 109–120. ACM Press, New York (2006)
Echahed, R., Janodet, J.-C.: Admissible graph rewriting and narrowing. In: Proceedings of 15th International Conference and Symposium on Logic Programming, Manchester, pp. 325–340. MIT Press, Cambridge (1998)
Echahed, R., Janodet, J.C.: Parallel admissible graph rewriting. In: Fiadeiro, J.L. (ed.) WADT 1998. LNCS, vol. 1589, pp. 122–138. Springer, Heidelberg (1999)
Echahed, R., Peltier, N.: Narrowing data-structures with pointers. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 92–106. Springer, Heidelberg (2006)
Echahed, R., Peltier, N.: Non Strict Confluent Rewrite Systems for Data-Structures with Pointers. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 137–152. Springer, Heidelberg (2007)
Hanus, M., Lucas, S., Middeldorp, A.: Strongly sequential and inductively sequential term rewriting systems. Information Processing Letters 67(1), 1–8 (1998)
Huet, G., Levy, J.-J.: Computations in orthogonal rewriting systems. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic: Essays in Honor of Alan Robinson, pp. 395–443. MIT Press, Cambridge (1991)
Klop, J.W., Middeldorp, A.: Sequentiality in orthogonal term rewriting systems. J. Symb. Comput. 12(2), 161–195 (1991)
Schorr, H., Waite, W.M.: An Efficient Machine Independent Procedure for Garbage Collection in Various List Structures. Communication of the ACM 10, 501–506 (1967)
Thompson, S.: Haskell: The Craft of Functional Programming, 2nd edn. Addison-Wesley, Reading (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Echahed, R., Peltier, N. (2008). A Needed Rewriting Strategy for Data-Structures with Pointers. In: Voronkov, A. (eds) Rewriting Techniques and Applications. RTA 2008. Lecture Notes in Computer Science, vol 5117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70590-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-70590-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70588-8
Online ISBN: 978-3-540-70590-1
eBook Packages: Computer ScienceComputer Science (R0)