by jozefg

A small implementation of higher-order unification

131 Stars 1 Forks Last release: Not found MIT License 12 Commits 0 Releases

Available items

No Items, yet!

The developer of this repository has not created any items for sale yet. Need a bug fixed? Help with integration? A different license? Create a request here:


A simple, concise implementation of Huet's algorithm. Written because it's difficult to translate the simple prose explanations of algorithms often adopted by the unification community to a working piece of code. The code is documented fully in


An example of how higher-order unification might be used may be found in

which provides a simple type-inference/checking algorithm for a dependently typed language with
Type : Type

We use cookies. If you continue to browse the site, you agree to the use of cookies. For more information on our use of cookies please see our Privacy Policy.