scientific article; zbMATH DE number 2043532

MaRDI QIDQ4447236zbMATH OpenFDO

Authors S. Salvati, Philippe de Groote

Publication date 16 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2706/27060234.htm

zbMATH Keywords

linear \(\lambda\)-calculusNP-completenesssecond-order matching

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Grammars and rewriting systems (68Q42)

Recommendations

• Computer Science Logic
• Term Rewriting and Applications
• Decidability of higher-order matching
• scientific article; zbMATH DE number 2090083
• scientific article; zbMATH DE number 1341609
• Automated Deduction – CADE-19
• Higher-order pattern complement and the strict \(\lambda\)-calculus
• scientific article; zbMATH DE number 176135
• Third-order matching in the polymorphic lambda calculus

Cited in

(9)

• scientific article; zbMATH DE number 1615234 (Why is no real title available?)
• scientific article; zbMATH DE number 176135 (Why is no real title available?)
• scientific article; zbMATH DE number 1341609 (Why is no real title available?)
• scientific article; zbMATH DE number 1405696 (Why is no real title available?)
• Polynomial-time inverse computation for accumulative functions with multiple data traversals
• Computer Science Logic
• Matching Modulo Superdevelopments Application to Second-Order Matching
• Term Rewriting and Applications
• Automated Deduction – CADE-19

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4447236)