Bounded Second-Order Unification Is NP-Complete
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 400-414
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Well-Nested Context Unification2005
- Efficient Memory Representation of XML DocumentsLecture Notes in Computer Science, 2005
- Monadic Second-Order Unification Is NP-Complete2004
- Currying Second-Order Unification ProblemsLecture Notes in Computer Science, 2002
- Higher-Order Unification and Matching2001
- On the Undecidability of Second-Order UnificationInformation and Computation, 2000
- Simple second-order languages for which unification is undecidableTheoretical Computer Science, 1991
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUPMathematics of the USSR-Sbornik, 1977
- A unification algorithm for typed λ-calculusTheoretical Computer Science, 1975