Abstract
Strongly sequential constructor systems admit a very efficient algorithm to compute normal forms. The class of forward-branching systems contains the class of strongly sequential constructor systems, and admits a similar reduction algorithm, but less efficient on the entire class of forward-branching systems. In this article, we present a new transformation which transforms any forward-branching system into a strongly sequential constructor one. We prove the correctness and completeness of the transformation algorithm, then that the new system is equivalent to the input system, with respect to the behavior and the semantics. As a programming language, it permits us to have a less restrictive syntax without compromise of semantics and efficiency.
Chapter PDF
References
Irène Durand. Bounded, strongly sequential and forward-branching term rewriting systems. Journal of Symbolic Computation, 18(4):319–352, October 1994.
Irène Durand and Bruno Salinier. Constructor equivalent term rewriting systems. Inform. Processing Letters, 47:131–137, 1993.
Irène Durand and Bruno Salinier. Constructor equivalent term rewriting systems are strongly sequential: a direct proof. Inform. Processing Letters, 52:137–145, 1994.
Gérard Huet and Jean-Jacques Lévy. Computations in orthogonal term rewriting systems. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, chapter 11–12, pages 397–443. MIT Press, 1991.
Jan Willem Klop and Aart Middeldorp. Sequentially in orthogonal term rewriting systems. Journal of Symbolic Computation, 12:161–195, 1991.
Bruno Salinier. Simulation de systèmes de réécriture de termes par des systèmes constructeurs. Thèse de doctorat, Université Bordeaux I, 351 cours de la Libération, 33405 Talence, France, December 1995.
Robert I. Strandh. Classes of equational programs that compile into efficient machine code. In RTA 89, Rewriting Techniques and Applications, volume 355 of LNCS, pages 449–461. Springer-Verlag, 1989.
Satish Thatte. On the correspondence between two classes of reduction systems. Inform. Processing Letters, 20:83–85, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salinier, B., Strandh, R. (1997). Simulating forward-branching systems with constructor systems. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030593
Download citation
DOI: https://doi.org/10.1007/BFb0030593
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive