Implementation of a general completion procedure parameterized by built-in theories and strategies
Identifieur interne : 00F233 ( Main/Merge ); précédent : 00F232; suivant : 00F234Implementation of a general completion procedure parameterized by built-in theories and strategies
Auteurs : C. Kirchner ; H. KirchnerSource :
English descriptors
Abstract
This paper describes a software which presents a unified point of view of several known completion procedures. It allows working with built-in theories and strategies and is aimed to perform proofs and experiments in term rewriting systems.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 000138
- to stream Crin, to step Curation: 000138
- to stream Crin, to step Checkpoint: 004357
Links to Exploration step
CRIN:kirchner85aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="360">Implementation of a general completion procedure parameterized by built-in theories and strategies</title></titleStmt><publicationStmt><idno type="RBID">CRIN:kirchner85a</idno><date when="1985" year="1985">1985</date><idno type="wicri:Area/Crin/Corpus">000138</idno><idno type="wicri:Area/Crin/Curation">000138</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000138</idno><idno type="wicri:Area/Crin/Checkpoint">004357</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">004357</idno><idno type="wicri:Area/Main/Merge">00F233</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Implementation of a general completion procedure parameterized by built-in theories and strategies</title><author><name sortKey="Kirchner, C" sort="Kirchner, C" uniqKey="Kirchner C" first="C." last="Kirchner">C. Kirchner</name></author><author><name sortKey="Kirchner, H" sort="Kirchner, H" uniqKey="Kirchner H" first="H." last="Kirchner">H. Kirchner</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>completion</term><term>equational deduction</term><term>modulo equalities</term><term>term rewriting systems</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="506">This paper describes a software which presents a unified point of view of several known completion procedures. It allows working with built-in theories and strategies and is aimed to perform proofs and experiments in term rewriting systems.</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 00F233 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00F233 | 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:kirchner85a
|texte= Implementation of a general completion procedure parameterized by built-in theories and strategies
}}
| This area was generated with Dilib version V0.6.33. |  |