Abstract
AbstractThe decidability of higher-order matching is a longstanding open problem. This paper contributes to this question by investigating the naïve method of generating arity-bounded unifiers in η-long lifted form and then testing whether they are solutions. Arity-bounded means that the arity of types and subtypes of terms in unifiers in lifted form are bounded by some given number N. It is shown that this generation can be enforced to terminate without losing unifiers, if compared using a variant of Padovani’s behavioral equivalence. The same method also shows decidability of higher-order matching under the restriction that every subterm of a unifier in η-long β-normal form (or in β-normal form, respectively) contains at most N different free variables.The paper also gives an improved account of a variant of Padovani’s behavioral equivalence.KeywordsEquivalence ClassFree VariableElementary TypeFunction SymbolInterpolation ProblemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
