Abstract
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calculus. The combination of these two latter formalisms has been already handled either by enriching first-order rewriting with higher-order capabilities, like in the Combinatory Reduction Systems (CRS), or by adding to λ-calculus algebraic features.
In a previous work, the authors showed how the semantics of CRS can be expressed in terms of the ρ-calculus. The converse issue is adressed here: rewriting calculus derivations are simulated by Combinatory Reduction Systems derivations. As a consequence of this result, important properties, like standardisation, are deduced for the rewriting calculus.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Barthe, G., et al.: Pure Patterns Type Systems. In: Principles of Programming Languages - POPL’03, pp. 250–261. ACM Press, New York (2003)
Bertolissi, C.: Developments in the rewriting calculus. Research Report INRIA & LORIA (2006), http://hal.inria.fr/inria-00121212
Bertolissi, C., Cirstea, H., Kirchner, C.: Expressing combinatory reduction systems derivations in the rewriting calculus. Higher-Order and Symbolic Computation 19(4), 345–376 (2006)
Brauner, P.: Un calcul des séquents extensible. Master thesis, LORIA (2006)
Cirstea, H.: Calcul de réécriture : fondements et applications. Thèse de Doctorat d’Université, Université Henri Poincaré - Nancy I (2000)
Cirstea, H., Faure, G., Kirchner, C.: A rho-calculus of explicit constraint application. In: Proc. of WRLA’2004. ENTCS, vol. 117 (2004)
Cirstea, H., Kirchner, C.: The rewriting calculus as a semantics of ELAN. In: Hsiang, J., Ohori, A. (eds.) ASIAN 1998. LNCS, vol. 1538, pp. 8–10. Springer, Heidelberg (1998)
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)
Cirstea, H., Kirchner, C., Liquori, L.: Matching Power. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 77–92. Springer, Heidelberg (2001)
Cirstea, H., et al.: Rewrite strategies in the rewriting calculus. In: Gramlich, B., Lucas, S. (eds.) Proceedings of WRS’03. ENTCS (June 2003)
Faure, G.: Matching Modulo Superdevelopments Application to Second-Order Matching. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 60–74. Springer, Heidelberg (2006)
Houtmann, C.: Cohérence de la déduction surnaturelle. Master thesis, LORIA (2006)
Huet, G.: Résolution d’équations dans les langages d’ordre 1,2, ...,ω. Thèse de Doctorat d’Etat, Université de Paris 7 (France) (1976)
Jay, B., Kesner, D.: Pure pattern calculus. In: Sestoft, P. (ed.) ESOP 2006 and ETAPS 2006. LNCS, vol. 3924, pp. 100–114. Springer, Heidelberg (2006)
Klop, J.W.: Combinatory Reduction Systems. PhD thesis, CWI (1980)
Klop, J.W., van Oostrom, V., van Raamsdonk, F.: Combinatory Reduction Systems: Introduction and Survey. Theoretical Computer Science 121, 279–308 (1993)
Liquori, L., Serpette, B.: iRho: an Imperative Rewriting Calculus. In: Proc. of PPDP’04, pp. 167–178. ACM Press, New York (2004)
Melliès, P.-A.: Description Abstraite des Systèmes de Réécriture. PhD thesis, Université Paris 7 (1996)
van Oostrom, V.: Lambda calculus with patterns. Technical report, Vrije Universiteit, Amsterdam (Nov. 1990)
van Oostrom, V.: Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam (1994)
van Oostrom, V., van Raamsdonk, F.: Comparing combinatory reduction systems and higher-order rewrite systems. In: Heering, J., et al. (eds.) HOA 1993. LNCS, vol. 816, pp. 276–304. Springer, Heidelberg (1994)
Wack, B.: Typage et déduction dans le calcul de réécriture. Thèse de doctorat, Université Henri Poincaré - Nancy I (Oct. 2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Bertolissi, C., Kirchner, C. (2007). The Rewriting Calculus as a Combinatory Reduction System. In: Seidl, H. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2007. Lecture Notes in Computer Science, vol 4423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71389-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-71389-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71388-3
Online ISBN: 978-3-540-71389-0
eBook Packages: Computer ScienceComputer Science (R0)