haskell-free 4.12.4-3build4 source package in Ubuntu

Changelog

haskell-free (4.12.4-3build4) bionic; urgency=medium

  * No-change rebuild for new GHC ABIs

 -- Steve Langasek <email address hidden>  Mon, 06 Nov 2017 01:29:28 +0000

Upload details

Uploaded by:
Steve Langasek
Uploaded to:
Bionic
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Bionic release universe haskell

Downloads

File Size SHA-256 Checksum
haskell-free_4.12.4.orig.tar.gz 49.4 KiB c9fe45aae387855626ecb5a0fea6afdb207143cb00af3b1f715d1032d2d08784
haskell-free_4.12.4-3build4.debian.tar.xz 3.3 KiB 7d5ba85e2eb912f9b018695ae0fceb5972328a6348d9b1297a4f04df559c3a54
haskell-free_4.12.4-3build4.dsc 3.3 KiB ede2db09276d6db7ec2287ec40d5812d1e75cea3080b9bdc1098b37752620c7d

Available diffs

View changes file

Binary packages built by this source

libghc-free-dev: No summary available for libghc-free-dev in ubuntu cosmic.

No description available for libghc-free-dev in ubuntu cosmic.

libghc-free-doc: Monads for free; documentation

 Free monads are useful for many tree-like structures and domain specific
 languages.
 .
 A Monad n is a free Monad for f if every Monad homomorphism from n to another
 monad m is equivalent to a natural transformation from f to m.
 .
 Cofree comonads provide convenient ways to talk about branching streams and
 rose-trees, and can be used to annotate syntax trees.
 .
 A Comonad v is a cofree Comonad for f if every Comonad homomorphism another
 comonad w to v is equivalent to a natural transformation from w to f.
 .
 This package provides the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-free-prof: Monads for free; profiling libraries

 Free monads are useful for many tree-like structures and domain specific
 languages.
 .
 A Monad n is a free Monad for f if every Monad homomorphism from n to another
 monad m is equivalent to a natural transformation from f to m.
 .
 Cofree comonads provide convenient ways to talk about branching streams and
 rose-trees, and can be used to annotate syntax trees.
 .
 A Comonad v is a cofree Comonad for f if every Comonad homomorphism another
 comonad w to v is equivalent to a natural transformation from w to f.
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.