Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A version of Huet's algorithm for higher-order unification
RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
1989 (English)Report (Other academic)
Abstract [en]

This paper describes a procedure for unification in extensional higher order logics. The procedure is due to Gerard Huet and was described in /Hu75/. In this paper we consider unification in extensional theories' which is a significantly simpler problem and is not described in detail in Huet's paper. In addition, the description here focuses on computation of substitutions rather than deciding inifiability, as in Huet's paper. To this some explanatory and clarifying material has been added.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1989, 1.
Series
SICS Research Report, ISSN 0283-3638 ; R89:12
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22178OAI: oai:DiVA.org:ri-22178DiVA: diva2:1041722
Note

Original report number R89012.

Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2017-08-07Bibliographically approved

Open Access in DiVA

No full text

By organisation
Decisions, Networks and Analytics lab
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.27.0