prolog-unification

What problem does it solve?

Unification is the single operation that drives all of Prolog's computation. Given two terms, unification finds a substitution -- a set of variable bindings -- that makes the two terms syntactically identical. If no such substitution exists, unification fails.

Core Features & Use Cases

• Bidirectional variable binding and aliasing, enabling both sides to carry unbound variables that resolve during solving.
• Handling constants, variables, and compound terms (including lists) with recursive, structural matching and backtracking support.
• Occurs check discussion and practical tradeoffs used to prevent infinite terms, with guidance on when to enable a full occurs check.
• Substitution environment semantics: write-once bindings, transitive resolution, and backtracking rollback.

Quick Start

Demonstrate unifying f(X, g(Y, a)) with f(h(Z), g(b, Z)) and display the final substitution.