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.
https://hal.inria.fr/inria-00100082
Contributor : Publications Loria
<>
Submitted on : Tuesday, September 26, 2006 - 10:13:58 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM
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⟩
