Higher-Order and Symbolic Computation

, Volume 19, Issue 4, pp 345–376

Expressing combinatory reduction systems derivations in the rewriting calculus

  • Clara Bertolissi
  • Horatiu Cirstea
  • Claude Kirchner
Article

DOI: 10.1007/s10990-006-0479-z

Cite this article as:
Bertolissi, C., Cirstea, H. & Kirchner, C. Higher-Order Symb Comput (2006) 19: 345. doi:10.1007/s10990-006-0479-z
  • 27 Downloads

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.

Keywords

Rewriting calculusCombinatory reduction systemsMatching

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • Clara Bertolissi
    • 1
  • Horatiu Cirstea
    • 1
  • Claude Kirchner
    • 1
  1. 1.LORIA & INRIA, UHPUniversity Nancy IIVillers-lès-NancyFrance