Controls how the compiler searches for instances using type families.
|Version on this page:||0.1.1.1|
|LTS Haskell 20.23:||0.1.2.0|
|Stackage Nightly 2023-05-30:||0.1.2.0|
|Latest on Hackage:||0.1.2.0|
Maintained by email@example.com
This version can be pinned in stack with:
Module documentation for 0.1.1.1
Depends on 3 packages(full list with versions):
Used by 1 package in lts-7.24(full list with versions):
GHC has no capability to perform graph searches on instance definition. Because of that, transitive rules for type classes cannot be defined. This package solves the issue with type functions performing a search on the graph where nodes are types and edges are rules from a given rule database. After constructing the type-level representation of the wanted path, the system constructs the needed functions from the value-level representation of the database.