Huet unification algorithm
E265288
UNEXPLORED
The Huet unification algorithm is a higher-order unification procedure introduced by Gérard Huet that generalizes first-order unification to handle lambda calculus terms and plays a key role in type theory and automated theorem proving.
Jump to:
Referenced by
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.