Ubuntu
haskell-data-reify package

haskell-data-reify 0.6.3-5 source package in Ubuntu

Changelog

haskell-data-reify (0.6.3-5) unstable; urgency=medium

  * Fix Build-Depends.

 -- Clint Adams <email address hidden>  Tue, 12 Sep 2023 13:53:52 -0400

Upload details

Uploaded by:
Debian Haskell Group
Uploaded to:
Sid
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Noble release universe misc

Downloads

File Size SHA-256 Checksum
haskell-data-reify_0.6.3-5.dsc 2.6 KiB d8725e2678c7a489c1353a0b15b5f704ff7a4346affb8a79400cb0d18c7d555e
haskell-data-reify_0.6.3.orig.tar.gz 8.8 KiB a5c05440d75a88ab79ddb6b53905dc3cb8190f6e405d5e101036d89e685c4ce9
haskell-data-reify_0.6.3-5.debian.tar.xz 2.8 KiB 4f1f2d1f5f10420508652d4611f480d5d0de4658df8bf8f471d62824beb80ef4

No changes file available.

Binary packages built by this source

libghc-data-reify-dev: Reify a recursive data structure into an explicit graph.

 '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.
 .
 &#169; 2009 Andy Gill; BSD3 license.
 .
 This package provides a library for the Haskell programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-data-reify-doc: Reify a recursive data structure into an explicit graph.; documentation

 '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.
 .
 &#169; 2009 Andy Gill; BSD3 license.
 .
 This package provides the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-data-reify-prof: Reify a recursive data structure into an explicit graph.; profiling libraries

 '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.
 .
 &#169; 2009 Andy Gill; BSD3 license.
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.