Order-sorted completion: The many-sorted way
Identifieur interne : 00E046 ( Main/Curation ); précédent : 00E045; suivant : 00E047Order-sorted completion: The many-sorted way
Auteurs : Harald Ganzinger [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Order-sorted specifications can be transformed into equivalent many-sorted ones by using injections to implement subsort relations. In this paper we improve a result of Goguen/Jouannaud/Meseguer about the relation between order-sorted and many-sorted rewriting. We then apply recent techniques in completion of many-sorted conditional equations to systems obtained from translating order-sorted conditional equations. Emphasis will be on ways to overcome some of the problems with non-sort-decreasing rules.
Url:
DOI: 10.1007/3-540-50939-9_136
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001008
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :000F93
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :003330
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :00E929
Links to Exploration step
ISTEX:4461E99204AC34A1DBF6F207219574F8A0C08D38Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Order-sorted completion: The many-sorted way</title>
<author><name sortKey="Ganzinger, Harald" sort="Ganzinger, Harald" uniqKey="Ganzinger H" first="Harald" last="Ganzinger">Harald Ganzinger</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:4461E99204AC34A1DBF6F207219574F8A0C08D38</idno>
<date when="1989" year="1989">1989</date>
<idno type="doi">10.1007/3-540-50939-9_136</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-9V1L60G3-3/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001008</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001008</idno>
<idno type="wicri:Area/Istex/Curation">000F93</idno>
<idno type="wicri:Area/Istex/Checkpoint">003330</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003330</idno>
<idno type="wicri:doubleKey">0302-9743:1989:Ganzinger H:order:sorted:completion</idno>
<idno type="wicri:Area/Main/Merge">00E929</idno>
<idno type="wicri:Area/Main/Curation">00E046</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Order-sorted completion: The many-sorted way</title>
<author><name sortKey="Ganzinger, Harald" sort="Ganzinger, Harald" uniqKey="Ganzinger H" first="Harald" last="Ganzinger">Harald Ganzinger</name>
<affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Fachbereich Informatik, Universität Dortmund, D-4600, Dortmund 50</wicri:regionArea>
<placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region>
<region type="district" nuts="2">District d'Arnsberg</region>
<settlement type="city">Dortmund</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<title level="s" type="abbrev">Lect Notes Comput Sci</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Order-sorted specifications can be transformed into equivalent many-sorted ones by using injections to implement subsort relations. In this paper we improve a result of Goguen/Jouannaud/Meseguer about the relation between order-sorted and many-sorted rewriting. We then apply recent techniques in completion of many-sorted conditional equations to systems obtained from translating order-sorted conditional equations. Emphasis will be on ways to overcome some of the problems with non-sort-decreasing rules.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00E046 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 00E046 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Curation |type= RBID |clé= ISTEX:4461E99204AC34A1DBF6F207219574F8A0C08D38 |texte= Order-sorted completion: The many-sorted way }}
This area was generated with Dilib version V0.6.33. |