Third Order Matching is Decidable

06/02/2023

∙

by   Gilles Dowek, et al.

∙

0

∙

share

The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed λ-calculus, i.e. to solve the equation a = b where a and b are simply typed λ-terms and b is ground. The decidability of this problem is still open. We prove the decidability of the particular case in which the variables occurring in the problem are at most third order.