scientific article; zbMATH DE number 3935004

From MaRDI portal
Publication:3708774





[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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3708774)