Complete sets of unifiers and matchers in equational theories

François Fages; Gérard Huet

doi:10.1016/0304-3975(86)90175-1

Complete sets of unifiers and matchers in equational theories

François Fages, Gérard Huet

INRIA Rocquencourt

Research output: Contribution to journal › Article › peer-review

Abstract

We propose an abstract framework to present unification and matching problems. We argue about the necessity of a somewhat complicated definition of a basis of unifiers. In particular, we prove the nonexistence of complete sets of minimal unifiers (and matchers) in some equational theories, even regular.

Original language	English
Pages (from-to)	189-200
Number of pages	12
Journal	Theoretical Computer Science
Volume	43
Issue number	C
DOIs	https://doi.org/10.1016/0304-3975(86)90175-1
Publication status	Published - 1 Jan 1986
Externally published	Yes

Access to Document

10.1016/0304-3975(86)90175-1

Cite this

@article{79811224bd884a319035de9d8cd0172d,

title = "Complete sets of unifiers and matchers in equational theories",

abstract = "We propose an abstract framework to present unification and matching problems. We argue about the necessity of a somewhat complicated definition of a basis of unifiers. In particular, we prove the nonexistence of complete sets of minimal unifiers (and matchers) in some equational theories, even regular.",

author = "Fran{\c c}ois Fages and G{\'e}rard Huet",

year = "1986",

month = jan,

day = "1",

doi = "10.1016/0304-3975(86)90175-1",

language = "English",

volume = "43",

pages = "189--200",

journal = "Theoretical Computer Science",

issn = "0304-3975",

number = "C",

}

TY - JOUR

T1 - Complete sets of unifiers and matchers in equational theories

AU - Fages, François

AU - Huet, Gérard

PY - 1986/1/1

Y1 - 1986/1/1

N2 - We propose an abstract framework to present unification and matching problems. We argue about the necessity of a somewhat complicated definition of a basis of unifiers. In particular, we prove the nonexistence of complete sets of minimal unifiers (and matchers) in some equational theories, even regular.

AB - We propose an abstract framework to present unification and matching problems. We argue about the necessity of a somewhat complicated definition of a basis of unifiers. In particular, we prove the nonexistence of complete sets of minimal unifiers (and matchers) in some equational theories, even regular.

U2 - 10.1016/0304-3975(86)90175-1

DO - 10.1016/0304-3975(86)90175-1

M3 - Article

AN - SCOPUS:38249041361

SN - 0304-3975

VL - 43

SP - 189

EP - 200

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - C

ER -

Complete sets of unifiers and matchers in equational theories

Abstract

Access to Document

Fingerprint

Cite this