Need help with higher-order-unification?
Click the “chat” button below for chat support from the developer who created it, or find similar developers for support.

About the developer

jozefg
152 Stars 3 Forks MIT License 12 Commits 1 Opened issues

Description

A small implementation of higher-order unification

Services available

!
?

Need anything else?

Contributors list

# 385,132
OCaml
Haskell
Shell
12 commits

higher-order-unification

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

explanation.md
.

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

src/Client.hs
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.