Abstract
Semi-unification is a generalization of both unification and matching with applications in proof theory, term rewriting systems, polymorphic type inference, and natural language processing. It is the problem of solving a set of term inequalities M1 ≤ N1, …, Mk
Author supplied keywords
Cite
CITATION STYLE
APA
Henglein, F. (1990). Fast left-linear semi-unification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 468 LNCS, pp. 82–91). Springer Verlag. https://doi.org/10.1007/3-540-53504-7_64
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free