Tractable and intractable second-order matching problems
From MaRDI portal
Publication:2643530
DOI10.1016/J.JSC.2003.09.002zbMATH Open1137.68411OpenAlexW2038779261MaRDI QIDQ2643530FDOQ2643530
Masateru Harao, Kouichi Hirata, Keizo Yamada
Publication date: 24 August 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2003.09.002
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The undecidability of the second order predicate unification problem
- Proving and applying program transformations expressed with second-order patterns
- A unification algorithm for typed \(\overline\lambda\)-calculus
- The undecidability of the second-order unification problem
- Higher-order unification revisited: Complete sets of transformations
- On the undecidability of second-order unification
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- Title not available (Why is that?)
- A unification algorithm for second-order monadic terms
- Simple second-order languages for which unification is undecidable
- Title not available (Why is that?)
- Linear second-order unification
- Title not available (Why is that?)
- Efficient second-order matching
- Semantic generalizations for proving and disproving conjectures by analogy
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidable higher-order unification problems
- Title not available (Why is that?)
Cited In (2)
Recommendations
This page was built for publication: Tractable and intractable second-order matching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643530)
