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 the λ-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 the λ-calculus algebraic features. The various higher-order rewriting systems and the rewriting calculus share similar concepts and have similar applications, and thus, it is important to compare these formalisms to better understand their respective strengths and differences.
We show in this paper that we can express Combinatory Reduction Systems derivations in terms of rewriting calculus derivations. The approach we present is based on a translation of each possible CRS-reduction into a corresponding ρ-reduction. Since for this purpose we need to make precise the matching used when evaluating CRS, the second contribution of the paper is to present an original matching algorithm for CRS terms that uses a simple term translation and the classical matching of lambda terms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barbanera, F., Fernández, M., Geuvers, H.: Modularity of Strong Normalisation and Confluence in the Algebraic γ-cube. J. Funct. Program. 7(6), 613–660 (1997)
Barendregt, H.: Lambda Calculus: its Syntax and Semantics. North Holland (1984)
Barthe, G., Cirstea, H., Kirchner, C., Liquori, L.: Pure Patterns Type Systems. In: Principles of Programming Languages—POPL2003, New Orleans, USA. ACM (2003)
Blanqui, F.: Definitions by rewriting in the calculus of constructions. In: Logic in Computer Science, pp. 9–18 (2001)
Blanqui, F.: Type Theory and Rewriting. Ph.D. thesis, University Paris-Sud (2001)
Church, A.: A formulation of the simple theory of types. J. Symb. Logic 5, 56–68 (1941)
Cirstea, H., Faure, G., Kirchner, C.: A rho-calculus of explicit constraint application. In: Proceedings of WRLA’04, vol. 117 of ENTCS (2004)
Cirstea, H., Kirchner, C.: The rewriting calculus—Part I and II. Logic J. Int. Group Pure Appl. Logic 9(3), 427–498 (2001)
Cirstea, H., Kirchner, C., Liquori, L.: Matching power. In: Proceedings of RTA, vol. 2051 of LNCS, pp. 77–92, Springer-Verlag (2001)
Cirstea, H., Kirchner, C., Liquori, L.: The rho cube. In: Proc. of FOSSACS, vol. 2030 of LNCS, pp. 166–180 (2001)
Cirstea, H., Kirchner, C., Liquori, L.: Rewriting calculus with(out) types. In: Gadducci, F., Montanari, U. (eds.), Proceedings of WRLA’02, Pisa (Italy), ENTCS (2002).
Cirstea, H., Liquori, L., Wack, B.: Typed recursion by pattern matching. In: Proceeding of the TYPES conference (2004).
Faure, G., Kirchner, C.: Exceptions in the Rewriting Calculus. In: Proc. of RTA, vol. 2378 of LNCS, pp. 66–82 Springer-Verlag (2002).
Goldfarb, D.: The Undecidability of the Second Order Unification Problem. Theor. Comput. Sci. 13, 225–230 (1981)
Huet, G.: A Unification Algorithm for Typed Lambda Calculus. Theor. Comput. Sci. 1(1), 27–57 (1975)
Jouannaud, J., Okada, M.: Abstract Data Type Systems. Theor. Comput. Sci. 173(2), 349–391 (1997)
Khasidashvili, Z.: Expression Reduction Systems. In: Proceedings of I. Vekua Ins. Appl. Math., vol. 36, pp. 200–220 (1990)
Klop, J.W.: Combinatory Reduction Systems. Ph.D. thesis, CWI (1980)
Klop, J.W., Oostrom, V.V., Raamsdonk, F.V.: Combinatory Reduction Systems: Introduction and Survey. Theor. Comput. Sci. 121, 279–308 (1993)
Miller, D.: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification. J Logic Comput 1(4), 497–536 (1991)
Miller, D.A., Nadathur, G.: Higher-order logic programming. In: Shapiro, E. (ed.), Proceedings of the Third International Logic Programming Conference, vol. 225 of LNCS, pp. 448–462, Springer-Verlag, (1986)
Nipkow, T.: Higher-order critical pairs. In: Proceedings of Logic in Computer Science, pp. 342–349 (1991)
Nipkow, T.: Orthogonal higher-order rewrite systems are confluent. In: Proceedings of the International Conference on Typed La mbda Calculi and Applications, pp. 306–317 (1993)
Nipkow, T., Prehofer, C.: Higher-Order Rewriting and Equational Reasoning. In: Bibel, W., Schmitt, P. (eds.), Automated Deduction—A Basis for Applications, vol. I: Foundations, Kluwer (1998)
Pagano, B.: Des calculs de substitution explicites et de leur application la compilation des langages fonctionnels. Ph.D. thesis, U. Paris VI (1997)
Qian, Z.: Linear Unification of Higher-Order Patterns. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.), Proceedings of TAPSOFT’93, of Lecture Notes in Computer Science, vol. 668, pp. 391–405, Springer-Verlag (1993)
van Oostrom, V., van Raamsdonk, F.: Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems. In: Higher-Order Algebra, Logic and Term Rewriting (HOA), pp. 276–304 (1993)
Wolfram, D.A.: The Clausal Theory of Types, vol. 21 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bertolissi, C., Cirstea, H. & Kirchner, C. Expressing combinatory reduction systems derivations in the rewriting calculus. Higher-Order Symb Comput 19, 345–376 (2006). https://doi.org/10.1007/s10990-006-0479-z
Issue Date:
DOI: https://doi.org/10.1007/s10990-006-0479-z