Ubuntu
haskell-data-reify package

haskell-data-reify 0.6.3-2build1 source package in Ubuntu

Changelog

haskell-data-reify (0.6.3-2build1) lunar; urgency=medium

  * Rebuild against new GHC ABI.

 -- Gianfranco Costamagna <email address hidden>  Sun, 11 Dec 2022 02:14:53 +0100

Upload details

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

See full publishing history Publishing

Series Pocket Published Component Section
Mantic release universe misc
Lunar release universe misc

Downloads

File Size SHA-256 Checksum
haskell-data-reify_0.6.3.orig.tar.gz 8.8 KiB a5c05440d75a88ab79ddb6b53905dc3cb8190f6e405d5e101036d89e685c4ce9
haskell-data-reify_0.6.3-2build1.debian.tar.xz 2.5 KiB b26f7ffe37d279b3f7d04c5272a879aa84dd2239d9022235d0d63faf3d4a00a8
haskell-data-reify_0.6.3-2build1.dsc 2.6 KiB a9b6e5e5c81792b371a53aa24875090bbd9bd4e79a5dc5e52815f0239dc278b4

View changes file

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.