On Unification Problems in Restricted Second-Order Languages

We review known results and improve knownboundaries between the decidable and the undecidable cases of second-order unification with various restrictions on second-order variables. As a key tool we prove an undecidability result that provides a partial solution to an open problem about simultaneous rigid E-unification.

csl98.pdf
PDF file

In  Annual Conference of the European Association for Computer Science Logic, CSL'98

Details

TypeInproceedings
> Publications > On Unification Problems in Restricted Second-Order Languages