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.
Recommendations
Cited in
(11)- Word operation definable in the typed -calculus
- Third order matching is decidable
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
- Higher-order unification revisited: Complete sets of transformations
- scientific article; zbMATH DE number 4068831 (Why is no real title available?)
- scientific article; zbMATH DE number 1302672 (Why is no real title available?)
- Efficient full higher-order unification
- Efficient full higher-order unification
- A -unifiability test for set theory
- \(\lambda\)-definability of free algebras
- A characterization of lambda definable tree operations
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)