open-adt: Open algebraic data types.
This library, built upon row-types, provides types and functions for variants of various functors that all have the same type applied to them. This is very similar to, and inspired by, haskus-utils-variant. At the time of writing, the compile-time performance of haskus-utils-variant is poor for variants with many fields, which should be improved in this package by using row-types.
The main types of interest in this package are
VarF wraps a variant of functors, all over the same
type, and provides a functor instance that fmaps over whatever
the variant is.
OpenADT is the fixed-point type of
which allows for recursive structures to be created.
A convenience function,
generates patterns that can be used as constructors for variants.
The key aspect of these patterns is that they are polymorphic
in the type of the row, allowing them to be used as constructors
for any open algebraic data type that includes a particular
For examples, see the
|Dependencies||base (>=4.9 && <5), constraints (>=0.8 && <1), recursion-schemes (==5.*), row-types (>=0.2.3 && <1), template-haskell (>=2.12 && <3) [details]|
|Copyright||Copyright (c) 2018 Jordan Woehr|
|Source repo||head: git clone https://github.com/woehr/open-adt|
|Uploaded||by Woehr at Sun Nov 25 18:23:17 UTC 2018|
|Downloads||120 total (19 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2018-11-25 [all 1 reports]
For package maintainers and hackage trustees