Translating Combinatory Reduction Systems into the Rewriting Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Translating Combinatory Reduction Systems into the Rewriting Calculus

Résumé

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.
Fichier principal
Vignette du fichier
A03-R-057.pdf (305.06 Ko) Télécharger le fichier

Dates et versions

inria-00107640 , version 1 (19-10-2006)

Identifiants

  • HAL Id : inria-00107640 , version 1

Citer

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⟩
126 Consultations
88 Téléchargements

Partager

Gmail Facebook X LinkedIn More