Implementation of Higher-Order Unification based on Calculus of Explicit Substitution
Identifieur interne : 00C328 ( Main/Exploration ); précédent : 00C327; suivant : 00C329Implementation of Higher-Order Unification based on Calculus of Explicit Substitution
Auteurs : Peter BorovanskySource :
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.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001A84
- to stream Crin, to step Curation: 001A84
- to stream Crin, to step Checkpoint: 002B40
- to stream Main, to step Merge: 00CB85
- to stream Main, to step Curation: 00C328
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="514">Implementation of Higher-Order Unification based on Calculus of Explicit Substitution</title></titleStmt><publicationStmt><idno type="RBID">CRIN:borovansky95a</idno><date when="1995" year="1995">1995</date><idno type="wicri:Area/Crin/Corpus">001A84</idno><idno type="wicri:Area/Crin/Curation">001A84</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001A84</idno><idno type="wicri:Area/Crin/Checkpoint">002B40</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002B40</idno><idno type="wicri:Area/Main/Merge">00CB85</idno><idno type="wicri:Area/Main/Curation">00C328</idno><idno type="wicri:Area/Main/Exploration">00C328</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Implementation of Higher-Order Unification based on Calculus of Explicit Substitution</title><author><name sortKey="Borovansky, Peter" sort="Borovansky, Peter" uniqKey="Borovansky P" first="Peter" last="Borovansky">Peter Borovansky</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1356">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></list><tree><noCountry><name sortKey="Borovansky, Peter" sort="Borovansky, Peter" uniqKey="Borovansky P" first="Peter" last="Borovansky">Peter Borovansky</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C328 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C328 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:borovansky95a
|texte= Implementation of Higher-Order Unification based on Calculus of Explicit Substitution
}}
| This area was generated with Dilib version V0.6.33. |  |