TÃtulo | Linear Second-Order Unification and Context Unification with Tree-Regular Constraints |

Publication Type | Conference Paper |

Year of Publication | 2000 |

Authors | Levy J [1], Villaret M [2] |

Conference Name | Lecture Notes in Computer Science |

Volume | 1833 |

Editorial | Springer-Verlag |

PaginaciÃ³n | 156-171 |

Resumen | Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of linear second-order unification. Here we prove that linear second-order unification can be reduced to context unification with tree-regular constraints. Decidability of context unification is still an open question. We comment on the possibility that linear second-order unification is decidable, if context unification is, and how to get rid of the tree-regular constraints. This is done by reducing rank-bound tree-regular constraints to word-regular constraints. |