Linear higher-order matching is NP-complete - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

Linear higher-order matching is NP-complete


We consider the problem of higher-order matching restricted to the set of linear lambda-terms (i.e., lambda-terms where each abstraction (lambda x. M) is such that there is exactly one free occurrence of x in M). We prove that this problem is decidable by showing that it belongs to NP. Then we prove that this problem is in fact NP-complete. Finally, we discuss some heuristics for a practical algorithm.



Other [cs.OH]
No file

Dates and versions

inria-00099220 , version 1 (26-09-2006)


  • HAL Id : inria-00099220 , version 1


Philippe de Groote. Linear higher-order matching is NP-complete. International Conference on Rewriting Techniques & Applications - RTA'2000, 2000, Norwich, UK, pp.127-140. ⟨inria-00099220⟩
54 View
0 Download


Gmail Facebook Twitter LinkedIn More