Higher-order Matching in the Linear lambda-calculus with Pairing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

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

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.
Not file

Dates and versions

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

Identifiers

  • HAL Id : inria-00100082 , version 1

Cite

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⟩
214 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More