lazy-hash: Identifiers for not-yet-computed values
This package gives a way to assign values with largely unique keys, without ever actually spending the time needed to compute the value. The basic idea is to hash the source code of some expression (in other words, its unnormalised AST), rather than the value (its normal form).
|Dependencies||base (>=4.8 && <4.13), constrained-categories (==0.3.*), hashable (>=1.0 && <1.3), haskell-src-meta (>=0.6 && <0.9), tagged, template-haskell, vector-space (>=0.9 && <0.18) [details]|
|Maintainer||(@) jsag $ hvl.no|
|Revised||Revision 3 made by leftaroundabout at 2019-09-18T13:22:06Z|
|Uploaded||by leftaroundabout at 2017-07-24T16:27:26Z|
|Downloads||784 total (4 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]
- lazy-hash-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees