Linear higher-order matching is NP-complete

Philippe de Groote 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Keywords : filtrage matching
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:51:57 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM


  • 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⟩



Record views