data-reify
'data-reify' provided the ability to turn recursive structures into explicit graphs. Many (implicitly or explicitly) recursive data structure can be given this ability, via a type class instance. This gives an alternative to using Ref for observable sharing. Observable sharing in general is unsafe, so we use the IO monad to bound this effect, but can be used safely even with unsafePerformIO if some simple conditions are met. Typically this package will be used to tie the knot with DSL's that depend of observable sharing, like Lava. Providing an instance for MuRef is the mechanism for allowing a structure to be reified into a graph, and several examples of this are provided. © 2009 Andy Gill; BSD3 license.
hackage.haskell.org
0.6.4
over 1 year ago
10
16,414 total
3
159
ad 4.5.6
Forward-, reverse- and mixed- mode automatic differentiation combinators with a common API. Type...90 versions - Latest release: almost 2 years ago - 4 dependent packages - 333 dependent repositories - 87.7 thousand downloads total - 383 stars on GitHub - 3 maintainers
Past Dependents
Check this option to include packages that no longer depend on this package in their latest version but previously did.
Filter
Links
| Registry | hackage.haskell.org |
| Source | Repository |
| Homepage | Homepage |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:hackage/data-reify
spec |
| License | BSD-3-Clause |
| First Release | almost 17 years ago |
| Last Synced | 27 days ago |