On the complexity of higher-order matching in the linear $\lambda$-calculus - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

On the complexity of higher-order matching in the linear $\lambda$-calculus

Sylvain Salvati
Linear logic, proof networks and categorial grammars
Philippe de Groote
Linear logic, proof networks and categorial grammars

Résumé

We prove that linear second-order matching in the linear $\lambda$-calculus with linear occurrences of the unknowns is NP-complete. This result shows that context matching and second-order matching in the linear $\lambda$-calculus are, in fact, two different problems.

Domaines

Autre [cs.OH]

Publications Loria  : Connectez-vous pour contacter le contributeur

https://inria.hal.science/inria-00099593

Soumis le : mardi 26 septembre 2006-09:39:07

Dernière modification le : jeudi 15 février 2024-03:31:52

Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : inria-00099593 , version 1

Citer

Sylvain Salvati, Philippe de Groote. On the complexity of higher-order matching in the linear $\lambda$-calculus. International Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, pp.234-245. ⟨inria-00099593⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-RENNES1 CNRS INRIA IRISA UNIV-LORRAINE INRIA2 LORIA UR1-MATH-STIC UR1-UFR-ISTIC UNIV-RENNES UR1-MATH-NUM
95 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More