Implementation of higher-order unification based on calculus of explicit substitution
Identifieur interne : 002B63 ( Istex/Checkpoint ); précédent : 002B62; suivant : 002B64Implementation of higher-order unification based on calculus of explicit substitution
Auteurs : Peter Borovansk [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In this paper, we present several improvements of an algorithm for a higher-order unification based on the calculus of explicit substitutions. The main difference between our algorithm and the already known version is, that we try to postpone normalisation of λσ-terms as long as possible, i.e. until some information of these λσ-terms is necessary for the next step of the unification algorithm.
Url:
DOI: 10.1007/3-540-60609-2_18
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:D59FF8BCCE5F2F649B713E5EC68EACBEE60D4CE7Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Implementation of higher-order unification based on calculus of explicit substitution</title>
<author><name sortKey="Borovansk, Peter" sort="Borovansk, Peter" uniqKey="Borovansk P" first="Peter" last="Borovansk">Peter Borovansk</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:D59FF8BCCE5F2F649B713E5EC68EACBEE60D4CE7</idno>
<date when="1995" year="1995">1995</date>
<idno type="doi">10.1007/3-540-60609-2_18</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-V2DQPCB6-2/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">003294</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003294</idno>
<idno type="wicri:Area/Istex/Curation">003253</idno>
<idno type="wicri:Area/Istex/Checkpoint">002B63</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002B63</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Implementation of higher-order unification based on calculus of explicit substitution</title>
<author><name sortKey="Borovansk, Peter" sort="Borovansk, Peter" uniqKey="Borovansk P" first="Peter" last="Borovansk">Peter Borovansk</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>CRIN & INRIA-Lorraine, B.P 239, F 54506, Vandoeuvre lès Nancy Cedex</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</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: In this paper, we present several improvements of an algorithm for a higher-order unification based on the calculus of explicit substitutions. The main difference between our algorithm and the already known version is, that we try to postpone normalisation of λσ-terms as long as possible, i.e. until some information of these λσ-terms is necessary for the next step of the unification algorithm.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Vandœuvre-lès-Nancy</li>
</settlement>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Borovansk, Peter" sort="Borovansk, Peter" uniqKey="Borovansk P" first="Peter" last="Borovansk">Peter Borovansk</name>
</region>
<name sortKey="Borovansk, Peter" sort="Borovansk, Peter" uniqKey="Borovansk P" first="Peter" last="Borovansk">Peter Borovansk</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002B63 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 002B63 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Istex |étape= Checkpoint |type= RBID |clé= ISTEX:D59FF8BCCE5F2F649B713E5EC68EACBEE60D4CE7 |texte= Implementation of higher-order unification based on calculus of explicit substitution }}
This area was generated with Dilib version V0.6.33. |