A sound and complete unification procedure is given for deterministic higher-order patterns that allows infinite minimal complete sets of unifiers and leaves decidability open.
Logical Methods in Computer Science17(4), 18 (2021)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Unification of Deterministic Higher-Order Patterns (Full Version)
A sound and complete unification procedure is given for deterministic higher-order patterns that allows infinite minimal complete sets of unifiers and leaves decidability open.