Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Higher-order Matching in the Linear lambda-calculus with Pairing

Philippe de Groote 1 Sylvain Salvati 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We prove that higher-order matching in the linear $\lambda$-calculus with pairing is decidable. We also establish its NP-completeness under the assumption that the right-hand side of the equation to be solved is given in normal form.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 10:13:58 AM
Last modification on : Friday, February 4, 2022 - 3:30:04 AM


  • HAL Id : inria-00100082, version 1



Philippe de Groote, Sylvain Salvati. Higher-order Matching in the Linear lambda-calculus with Pairing. 18th International Workshop on Computer Science Logic - CSL'2004, Sep 2004, Karpacz, Poland, pp.220-234. ⟨inria-00100082⟩



Record views