Implementation of higher-order unification based on calculus of explicit substitution
Identifieur interne : 003294 ( Istex/Corpus ); précédent : 003293; suivant : 003295Implementation of higher-order unification based on calculus of explicit substitution
Auteurs : Peter BorovanskSource :
- 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
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><affiliation><mods:affiliation>CRIN & INRIA-Lorraine, B.P 239, F 54506, Vandoeuvre lès Nancy Cedex, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: borovan@loria.fr</mods:affiliation></affiliation></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></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><mods:affiliation>CRIN & INRIA-Lorraine, B.P 239, F 54506, Vandoeuvre lès Nancy Cedex, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: borovan@loria.fr</mods:affiliation></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><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Peter Borovanský</name><affiliations><json:string>CRIN & INRIA-Lorraine, B.P 239, F 54506, Vandoeuvre lès Nancy Cedex, France</json:string><json:string>E-mail: borovan@loria.fr</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-V2DQPCB6-2</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><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.</abstract><qualityIndicators><refBibsNative>false</refBibsNative><abstractWordCount>63</abstractWordCount><abstractCharCount>406</abstractCharCount><keywordCount>0</keywordCount><score>5.415</score><pdfWordCount>2659</pdfWordCount><pdfCharCount>12604</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>6</pdfPageCount><pdfPageSize>439.28 x 662.28 pts</pdfPageSize></qualityIndicators><title>Implementation of higher-order unification based on calculus of explicit substitution</title><chapterId><json:string>18</json:string><json:string>Chap18</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>1995</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>Gerhard Goos</name></json:item><json:item><name>Juris Hartmanis</name></json:item><json:item><name>Jan van Leeuwen</name></json:item></editor></serie><host><title>SOFSEM '95: Theory and Practice of Informatics</title><language><json:string>unknown</json:string></language><copyrightDate>1995</copyrightDate><doi><json:string>10.1007/3-540-60609-2</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-48463-9</json:string></eisbn><bookId><json:string>3540606092</json:string></bookId><isbn><json:string>978-3-540-60609-3</json:string></isbn><volume>1012</volume><pages><first>363</first><last>368</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Miroslav Bartosek</name></json:item><json:item><name>Jan Staudek</name></json:item><json:item><name>Jirí Wiedermann</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Software Engineering</value></json:item><json:item><value>Database Management</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Programming Techniques</value></json:item><json:item><value>Programming Languages, Compilers, Interpreters</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-V2DQPCB6-2</json:string></ark><publicationDate>1995</publicationDate><copyrightDate>1995</copyrightDate><doi><json:string>10.1007/3-540-60609-2_18</json:string></doi><id>D59FF8BCCE5F2F649B713E5EC68EACBEE60D4CE7</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-V2DQPCB6-2/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-V2DQPCB6-2/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-V2DQPCB6-2/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Implementation of higher-order unification based on calculus of explicit substitution</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1995">1995</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Implementation of higher-order unification based on calculus of explicit substitution</title><author role="corresp"><persName><forename type="first">Peter</forename><surname>Borovanský</surname></persName><email>borovan@loria.fr</email><affiliation><orgName type="institution">CRIN & INRIA-Lorraine</orgName><address><postBox>B.P 239</postBox><postCode>F 54506</postCode><settlement>Vandoeuvre lès Nancy Cedex</settlement><country key="FR">FRANCE</country></address></affiliation><affiliation><orgName type="department">Institute of Informatics</orgName><orgName type="institution">Comenius University</orgName><address><settlement>Bratislava</settlement></address></affiliation></author><idno type="istex">D59FF8BCCE5F2F649B713E5EC68EACBEE60D4CE7</idno><idno type="ark">ark:/67375/HCB-V2DQPCB6-2</idno><idno type="DOI">10.1007/3-540-60609-2_18</idno></analytic><monogr><title level="m" type="main">SOFSEM '95: Theory and Practice of Informatics</title><title level="m" type="sub">22nd Seminar on Current Trends in Theory and Practice of Informatics Milovy, Czech Republic November 23 – December 1, 1995 Proceedings</title><idno type="DOI">10.1007/3-540-60609-2</idno><idno type="book-id">3540606092</idno><idno type="ISBN">978-3-540-60609-3</idno><idno type="eISBN">978-3-540-48463-9</idno><idno type="chapter-id">Chap18</idno><editor><persName><forename type="first">Miroslav</forename><surname>Bartosek</surname></persName></editor><editor><persName><forename type="first">Jan</forename><surname>Staudek</surname></persName></editor><editor><persName><forename type="first">Jirí</forename><surname>Wiedermann</surname></persName></editor><imprint><biblScope unit="vol">1012</biblScope><biblScope unit="page" from="363">363</biblScope><biblScope unit="page" to="368">368</biblScope><biblScope unit="chapter-count">39</biblScope></imprint></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><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">Jan</forename><nameLink>van</nameLink><surname>Leeuwen</surname></persName></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>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 <hi rend="italic">λσ</hi>-terms as long as possible, i.e. until some information of these <hi rend="italic">λσ</hi>-terms is necessary for the next step of the unification algorithm.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I14029</label><item><term type="Secondary" subtype="priority-1">Software Engineering</term></item><label>I18024</label><item><term type="Secondary" subtype="priority-2">Database Management</term></item><label>I18032</label><item><term type="Secondary" subtype="priority-3">Information Storage and Retrieval</term></item><label>I16013</label><item><term type="Secondary" subtype="priority-4">Computation by Abstract Devices</term></item><label>I14010</label><item><term type="Secondary" subtype="priority-5">Programming Techniques</term></item><label>I14037</label><item><term type="Secondary" subtype="priority-6">Programming Languages, Compilers, Interpreters</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-V2DQPCB6-2/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540606092</BookID><BookTitle>SOFSEM '95: Theory and Practice of Informatics</BookTitle><BookSubTitle>22nd Seminar on Current Trends in Theory and Practice of Informatics Milovy, Czech Republic November 23 – December 1, 1995 Proceedings</BookSubTitle><BookVolumeNumber>1012</BookVolumeNumber><BookDOI>10.1007/3-540-60609-2</BookDOI><BookTitleID>42805</BookTitleID><BookPrintISBN>978-3-540-60609-3</BookPrintISBN><BookElectronicISBN>978-3-540-48463-9</BookElectronicISBN><BookChapterCount>39</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1995</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I14029" Priority="1" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I18024" Priority="2" Type="Secondary">Database Management</BookSubject><BookSubject Code="I18032" Priority="3" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I16013" Priority="4" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I14010" Priority="5" Type="Secondary">Programming Techniques</BookSubject><BookSubject Code="I14037" Priority="6" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Miroslav</GivenName><FamilyName>Bartosek</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><FamilyName>Staudek</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jirí</GivenName><FamilyName>Wiedermann</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap18" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>18</ChapterID><ChapterDOI>10.1007/3-540-60609-2_18</ChapterDOI><ChapterSequenceNumber>18</ChapterSequenceNumber><ChapterTitle Language="En">Implementation of higher-order unification based on calculus of explicit substitution</ChapterTitle><ChapterCategory>Contributed Papers</ChapterCategory><ChapterFirstPage>363</ChapterFirstPage><ChapterLastPage>368</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1995</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>6</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540606092</BookID><BookTitle>SOFSEM '95: Theory and Practice of Informatics</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1" CorrespondingAffiliationID="Aff1" PresentAffiliationID="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Peter</GivenName><FamilyName>Borovanský</FamilyName></AuthorName><Contact><Email>borovan@loria.fr</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>CRIN & INRIA-Lorraine</OrgName><OrgAddress><Postbox>B.P 239</Postbox><Postcode>F 54506</Postcode><City>Vandoeuvre lès Nancy Cedex</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgDivision>Institute of Informatics</OrgDivision><OrgName>Comenius University</OrgName><OrgAddress><City>Bratislava</City></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>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 <Emphasis Type="Italic">λσ</Emphasis>-terms as long as possible, i.e. until some information of these <Emphasis Type="Italic">λσ</Emphasis>-terms is necessary for the next step of the unification algorithm.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Implementation of higher-order unification based on calculus of explicit substitution</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Implementation of higher-order unification based on calculus of explicit substitution</title></titleInfo><name type="personal" displayLabel="corresp"><namePart type="given">Peter</namePart><namePart type="family">Borovanský</namePart><affiliation>CRIN & INRIA-Lorraine, B.P 239, F 54506, Vandoeuvre lès Nancy Cedex, France</affiliation><affiliation>E-mail: borovan@loria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="ReviewPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">1995</dateIssued><copyrightDate encoding="w3cdtf">1995</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract 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.</abstract><relatedItem type="host"><titleInfo><title>SOFSEM '95: Theory and Practice of Informatics</title><subTitle>22nd Seminar on Current Trends in Theory and Practice of Informatics Milovy, Czech Republic November 23 – December 1, 1995 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Miroslav</namePart><namePart type="family">Bartosek</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">Staudek</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jirí</namePart><namePart type="family">Wiedermann</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1995</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I18024">Database Management</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic><topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic></subject><identifier type="DOI">10.1007/3-540-60609-2</identifier><identifier type="ISBN">978-3-540-60609-3</identifier><identifier type="eISBN">978-3-540-48463-9</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">42805</identifier><identifier type="BookID">3540606092</identifier><identifier type="BookChapterCount">39</identifier><identifier type="BookVolumeNumber">1012</identifier><part><date>1995</date><detail type="volume"><number>1012</number><caption>vol.</caption></detail><extent unit="pages"><start>363</start><end>368</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1995</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1995</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1995</recordOrigin></recordInfo></relatedItem><identifier type="istex">D59FF8BCCE5F2F649B713E5EC68EACBEE60D4CE7</identifier><identifier type="ark">ark:/67375/HCB-V2DQPCB6-2</identifier><identifier type="DOI">10.1007/3-540-60609-2_18</identifier><identifier type="ChapterID">18</identifier><identifier type="ChapterID">Chap18</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1995</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag, 1995</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-V2DQPCB6-2/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003294 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 003294 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|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. |  |