scientific article; zbMATH DE number 1341609

MaRDI QIDQ4263158zbMATH OpenFDO

Authors Tomasz Wierzbicki

Publication date 22 September 1999

zbMATH Keywords

complexitydecidabilitysatisfiabilitysimply typed lambda calculushigher-order matchingfourth-order matchingNP-hardness bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)

Recommendations

• scientific article; zbMATH DE number 1615234
• scientific article; zbMATH DE number 2043532
• Term Rewriting and Applications
• Decidability of fourth-order matching
• scientific article; zbMATH DE number 1223619

Cited in

(11)

• Computational complexity of simultaneous elementary matching problems
• The role of polymorphism in the characterisation of complexity by soft types
• Complexity of matching problems
• Higher order matching polynomial
• Tractable and intractable second-order matching problems
• Deterministic second-order patterns
• Decidability of bounded higher-order unification
• Term Rewriting and Applications
• scientific article; zbMATH DE number 1615234 (Why is no real title available?)
• Automated Deduction – CADE-19
• scientific article; zbMATH DE number 2043532 (Why is no real title available?)

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 Q4263158)