Translating Combinatory Reduction Systems into the Rewriting Calculus
Identifieur interne : 007934 ( Main/Merge ); précédent : 007933; suivant : 007935Translating Combinatory Reduction Systems into the Rewriting Calculus
Auteurs : Clara Bertolissi ; Horatiu Cirstea ; Claude KirchnerSource :
English descriptors
- KwdEn :
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.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003797
- to stream Crin, to step Curation: 003797
- to stream Crin, to step Checkpoint: 000A87
Links to Exploration step
CRIN:bertolissi03aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="484">Translating Combinatory Reduction Systems into the Rewriting Calculus</title></titleStmt><publicationStmt><idno type="RBID">CRIN:bertolissi03a</idno><date when="2003" year="2003">2003</date><idno type="wicri:Area/Crin/Corpus">003797</idno><idno type="wicri:Area/Crin/Curation">003797</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003797</idno><idno type="wicri:Area/Crin/Checkpoint">000A87</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000A87</idno><idno type="wicri:Area/Main/Merge">007934</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Translating Combinatory Reduction Systems into the Rewriting Calculus</title><author><name sortKey="Bertolissi, Clara" sort="Bertolissi, Clara" uniqKey="Bertolissi C" first="Clara" last="Bertolissi">Clara Bertolissi</name></author><author><name sortKey="Cirstea, Horatiu" sort="Cirstea, Horatiu" uniqKey="Cirstea H" first="Horatiu" last="Cirstea">Horatiu Cirstea</name></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>lambda calculus</term><term>rewriting calculus</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1752">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.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007934 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 007934 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:bertolissi03a
|texte= Translating Combinatory Reduction Systems into the Rewriting Calculus
}}
| This area was generated with Dilib version V0.6.33. |  |