How does instantiation of higher-rank types and subsumption interact during unification?...

How is the scope of a nested universal quantifier determined (higher-rank types)?...

Unification of applicators with different arity through substitution...

Generalized HM vs. Higher-Order Unification...

What is the optimal "most general unifier" algorithm?...

Most General Unifier (Prolog)...

Prolog unification broken when argument order is changed...

Agda: what does `.(` mean?...

Unification in pattern matching case...

Why does this function/constructor argument become a free implicit variable?...

Prolog and List Unification...

Define a rule happened_before(X,Y) which defines the relation that event X happened before event Y u...

Can fix only be typed in non-strict evaluated languages?...

Prolog: why this predicate finds the answer but ignores it and goes on to unify with []?...

Why agda with-abstraction don't erase some clauses?...

Auto implicit not solved, even though it should be straightforward function application on closed te...

My Datanova Data Unifier model-maps throw "Rule parsing error. Span expected '(' at )&q...

Algorithm to transform from an expression to a graph (DAG) representation...

Finding the most general unifier in Haskell using Data.Comp.Unification (beginner question)...

Printer in Haskell for Subst in Data.Comp.Variables...

How do I unwrap a generic type alias from a union type which makes the type alias more specific?...

What's an elegant way to unify X,Y with (1,2), (1,-2), (-1,2), (-1,-2), (2,1), (2,-1) , (-2,1), ...

Why does this expression not unifiy...

Prolog - Explain trace steps in English...

Seeking Unification Algorithm in F#...

Prolog - unifying two lists with/without variables...

Is it impossible to let-bind a composite lens?...

Deriving type of foldr (!!)...

How to communicate with a polymorphic child component in Elm?...

SLD resolution tree, Which predicate applies to give first re-solvent...