Abstract
Definitional trees have been introduced by Sergio Antoy in order to design an efficient term rewrite strategy which computes needed outermost redexes. In this paper, we consider the use of definitional trees in the context of term-graph rewriting. We show that, unlike the case of term rewrite systems, the strategies induced by definitional trees do not always compute needed redexes, in presence of term-graph rewrite systems. We then define a new class called inductively sequential term-graph rewrite systems (istGRS) for which needed redexes are still provided by definitional trees. Systems in this class are not confluent in general. We give additional syntactic criteria over istGRS’s which ensure the confluence property with respect to the set of admissible term-graphs.
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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol. 632, pp. 143–157. Springer, Heidelberg (1992)
Antoy, S.: Evaluation strategies for functional logic programming. Journal of Symbolic Computation 40(1), 875–903 (2005)
Antoy, S., Braßel, B.: Computing with subspaces. In: Proc. of the 9th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP 2007), pp. 121–130. ACM Press, New York (2007)
Antoy, S., Brown, D.W., Chiang, S.-H.: Lazy context cloning for non-deterministic graph rewriting. Electr. Notes Theor. Comput. Sci. 176(1), 3–23 (2007)
Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. J. ACM 47(4), 776–822 (2000)
Barendregt, H., van Eekelen, M., Glauert, J., Kenneway, R., Plasmeijer, M.J., Sleep, M.: 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)
Bert, D., Echahed, R.: Abstraction of Conditional Term Rewriting Systems. In: Lloyd, J. (ed.) Proc. of International Logic Programming Symposiumon (ILPS), pp. 162–176. MIT Press, Cambridge (1995)
Duval, D., Echahed, R., Prost, F.: Modeling pointer redirection as cyclic term-graph rewriting. Electr. Notes Theor. Comput. Sci. 176(1), 65–84 (2007)
Echahed, R., Janodet, J.C.: Admissible graph rewriting and narrowing. In: Proc. of Joint International Conference and Symposium on Logic Programming (JICSLP 1998), 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–137. 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)
Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformations, Applications, Languages and Tools, vol. 2. World Scientific, Singapore (1999)
Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformations, Concurrency, Parallelism and Distribution, vol. 3. World Scientific, Singapore (1999)
Hanus, M.: Call pattern analysis for functional logic programs. In: Proc. of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2008) (July 2008) (to appear)
Hußmann, H.: Nondeterministic algebraic specifications and nonconfluent term rewriting. J. Log. Program 12(3&4), 237–255 (1992)
Kennaway, J.R., Klop, J.K., Sleep, M.R., Vries, F.J.D.: On the adequacy of graph rewriting for simulating term rewriting. ACM Transactions on Programming Languages and Systems 16(3), 493–523 (1994); previous version: Technical Report CS-R9204, CWI, Amsterdam (1992)
López-Fraguas, F.J., Rodríguez-Hortalá, J., Sánchez-Hernández, J.: A simple rewrite notion for call-time choice semantics. In: PPDP, the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, Wroclaw, Poland, July 14-16, 2007, pp. 197–208. ACM, New York (2007)
Plump, D.: Term graph rewriting. In: Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 2, pp. 3–61. World Scientific, Singapore (1999)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformations, Foundations, vol. 1. World Scientific, Singapore (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Echahed, R. (2008). Inductively Sequential Term-Graph Rewrite Systems. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-87405-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87404-1
Online ISBN: 978-3-540-87405-8
eBook Packages: Computer ScienceComputer Science (R0)