unbound-generics

Reimplementation of Unbound using GHC Generics

BSD-3-Clause licensed by Aleksey Kliger

Maintained by [email protected]

This version can be pinned in stack with:unbound-generics-0.1@sha256:a82e60e33b50f563a9b313410d32b1858f5d1efb578c29fc3fc34cb3590b7d9c,3748

Depends on 6 packages(full list with versions):

This is a reimplementation of (parts of) unbound but using GHC generics instead of RepLib.

Differences from `unbound`

For the most part, I tried to keep the same methods with the same signatures. However there are a few differences.

fv :: Alpha t => Fold t (Name n)

The fv method returns a Fold (in the sense of the lens library), rather than an Unbound.Util.Collection instance. That means you will generally have to write toListOf fv t or some other summary operation.
isPat :: Alpha t => t -> DisjointSet AnyName

You should only notice this if you’re implementing an instance of Alpha by hand (rather than by using the default generic instance). The original unbound returned a Maybe [AnyName] here with the same interpretation as DisjointSet: Nothing means an inconsistency was encountered, or Just the free variables of the pattern.

Add acompare functiona and acompare' method to Alpha typeclass. (christiaanb)

Handwritten Alpha instances will need to define this additional method now. Major version bump.

Export internal type-directed gaeq, gopen, gclose, etc functions from Unbound.Generics.LocallyNameless.Alpha.

Allows definitions like:

  instance Alpha Term where
    aeq' _ (Prim t1 _dk1) (Prim t2 _dk2) = t1 == t2
    aeq' c t1             t2             = gaeq c (from t1) (from t2)

Unconditionally add ErrorT and ExceptT instances using transformers-compat (bergmark)