Translating Combinatory Reduction Systems into the Rewriting Calculus

Clara Bertolissi 1 Horatiu Cirstea 1 Claude Kirchner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The last few years have seen the development of the rewriting calculus (or rho-calculus, RHO) that extends first order term rewriting and lambda-calculus. The integration 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, or by adding to lambda-calculus algebraic features. The different higher-order rewriting systems and the rewriting calculus share similar concepts and have similar applications, and thus, it seems natural to compare these formalisms. We analyze in this paper the relationship between the Rewriting Calculus and the Combinatory Reduction Systems and we present a translation of CRS-terms and rewrite rules into rho-terms and we show that for any CRS-reduction we have a corresponding rho-reduction.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Publications Loria <>
Submitted on : Thursday, October 19, 2006 - 9:03:43 AM
Last modification on : Thursday, January 11, 2018 - 6:19:57 AM
Document(s) archivé(s) le : Wednesday, March 29, 2017 - 1:13:15 PM


  • HAL Id : inria-00107640, version 1



Clara Bertolissi, Horatiu Cirstea, Claude Kirchner. Translating Combinatory Reduction Systems into the Rewriting Calculus. 4th International Workshop on Rule-Based Programming - RULE 2003, 2003, Valencia, Spain. ⟨inria-00107640⟩



Record views


Files downloads