The Rewriting Calculus - Part I
Identifieur interne : 009456 ( Main/Merge ); précédent : 009455; suivant : 009457The Rewriting Calculus - Part I
Auteurs : Horatiu Cirstea ; Claude KirchnerSource :
- Logic Journal of the Interest Group in Pure and Applied Logics ; 2001.
English descriptors
- KwdEn :
Abstract
The rho-calculus integrates in a uniform and simple setting first-order rewriting, lambda-calculus and non-deterministic computations. Its abstraction mechanism is based on the rewrite rule formation and its main evaluation rule is based on matching modulo a theory T. In this first part, the calculus is motivated and its syntax and evaluation rules for any theory T are presented. In the syntactic case, i.e. when T is the empty theory, we study its basic properties for the untyped case. We first show how it uniformly encodes lambda-calculus as well as first-order rewriting derivations. Then we provide sufficient conditions for ensuring confluence of the calculus.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002F26
- to stream Crin, to step Curation: 002F26
- to stream Crin, to step Checkpoint: 001551
Links to Exploration step
CRIN:cirstea01dLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="43">The Rewriting Calculus - Part I</title></titleStmt><publicationStmt><idno type="RBID">CRIN:cirstea01d</idno><date when="2001" year="2001">2001</date><idno type="wicri:Area/Crin/Corpus">002F26</idno><idno type="wicri:Area/Crin/Curation">002F26</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002F26</idno><idno type="wicri:Area/Crin/Checkpoint">001551</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001551</idno><idno type="wicri:Area/Main/Merge">009456</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">The Rewriting Calculus - Part I</title><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><series><title level="j">Logic Journal of the Interest Group in Pure and Applied Logics</title><imprint><date when="2001" type="published">2001</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>lambda-calculus</term><term>matching</term><term>non-determinism</term><term>rewriting</term><term>rewriting-calculus</term><term>rule based language.</term><term>strategy</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1650">The rho-calculus integrates in a uniform and simple setting first-order rewriting, lambda-calculus and non-deterministic computations. Its abstraction mechanism is based on the rewrite rule formation and its main evaluation rule is based on matching modulo a theory T. In this first part, the calculus is motivated and its syntax and evaluation rules for any theory T are presented. In the syntactic case, i.e. when T is the empty theory, we study its basic properties for the untyped case. We first show how it uniformly encodes lambda-calculus as well as first-order rewriting derivations. Then we provide sufficient conditions for ensuring confluence of the calculus.</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 009456 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 009456 | 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:cirstea01d
|texte= The Rewriting Calculus - Part I
}}
| This area was generated with Dilib version V0.6.33. |  |