scientific article; zbMATH DE number 1341609
From MaRDI portal
Publication:4263158
zbMath0937.03023MaRDI QIDQ4263158
Publication date: 22 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitydecidabilitysatisfiabilitysimply typed lambda calculushigher-order matchingfourth-order matchingNP-hardness bounds
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)
Related Items (4)
The role of polymorphism in the characterisation of complexity by soft types ⋮ Tractable and intractable second-order matching problems ⋮ Decidability of bounded higher-order unification ⋮ Deterministic second-order patterns
This page was built for publication: