No label defined (Q3708774)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3935004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3935004 |
Statements
1985
0 references
infinite trees
0 references
term grammars
0 references
unification problem
0 references
typed lambda- calculus
0 references
regular expression
0 references
0.7863807678222656
0 references
0.7783445119857788
0 references
0.7782624959945679
0 references
[For the entire collection see Zbl 0568.00022.] The unification problem is undecidable for the typed lambda-calculus and, moreover, there may exist an infinite number of most general unifiers. The paper shows that for a certain class of unification problems, the set of the unifiers can be represented by a regular expression over a finite alphabet consisting of elementary substitutions.
0 references