@inproceedings{10.1007/10721975_11,
    Abstract = {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.},
    Address = {Berlin, Heidelberg},
    Author = {Levy, Jordi and Villaret, Mateu},
    BookTitle = {Rewriting Techniques and Applications},
    Editor = {Bachmair, Leo},
    File = {Levy-Villaret2000\_Chapter\_LinearSecond-OrderUnificationA - a - a - g.pdf},
    ISBN = {978-3-540-44980-5},
    Pages = {156--171},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Linear Second-Order Unification and Context Unification with Tree-Regular Constraints},
    Year = {2000},
    date-added = {2019-08-08 11:13:47 +0200},
    date-modified = {2019-08-08 11:13:47 +0200},
    doi = {10.1007/10721975_11}
}

@inproceedings{10.1007/10721975_11, Abstract = {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.}, Address = {Berlin, Heidelberg}, Author = {Levy, Jordi and Villaret, Mateu}, BookTitle = {Rewriting Techniques and Applications}, Editor = {Bachmair, Leo}, File = {Levy-Villaret2000_Chapter_LinearSecond-OrderUnificationA - a - a - g.pdf}, ISBN = {978-3-540-44980-5}, Pages = {156--171}, Publisher = {Springer Berlin Heidelberg}, Title = {Linear Second-Order Unification and Context Unification with Tree-Regular Constraints}, Year = {2000}, date-added = {2019-08-08 11:13:47 +0200}, date-modified = {2019-08-08 11:13:47 +0200}, doi = {10.1007/10721975_11} }