A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Regular expression order-sorted unification and matching
2015
Journal of symbolic computation
We extend order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottom-up unranked tree automaton. We prove that regular expression order-sorted (REOS) unification is of type infinitary and decidable. The unification problem presented by us generalizes some known problems, such as, e.g., order-sorted unification for ranked terms, sequence unification, and word unification with regular
doi:10.1016/j.jsc.2014.08.002
pmid:26523088
pmcid:PMC4599633
fatcat:pn2d4zysb5d7lpgueqyczgx3r4