Regular patterns in second-order unification
From MaRDI portal
Recommendations
Cites work
- A Decision Algorithm for Stratified Context Unification
- A unification algorithm for second-order monadic terms
- A unification algorithm for typed \(\bar\lambda\)-calculus
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Decidability of bounded higher-order unification
- Decidable higher-order unification problems
- Decreasing diagrams and relative termination
- Higher-order unification revisited: Complete sets of transformations
- scientific article; zbMATH DE number 3916533 (Why is no real title available?)
- scientific article; zbMATH DE number 4068831 (Why is no real title available?)
- scientific article; zbMATH DE number 1189058 (Why is no real title available?)
- scientific article; zbMATH DE number 1189059 (Why is no real title available?)
- LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)
- Linear second-order unification
- Minimal and complete word unification
- On the Velocity-Pressure-Vorticity Least-Squares Mixed Finite Element Method for the 3D Stokes Equations
- Reasoning about sequences of memory states
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Towards parametrizing word equations
Cited in
(7)
This page was built for publication: Regular patterns in second-order unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454122)