haskell-free 5.1.3-1build2 source package in Ubuntu
Changelog
haskell-free (5.1.3-1build2) hirsute; urgency=medium * No-change rebuild for new GHC ABIs -- Steve Langasek <email address hidden> Thu, 29 Oct 2020 20:27:08 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Hirsute
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Jammy | release | universe | haskell |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
haskell-free_5.1.3.orig.tar.gz | 62.8 KiB | 2c70d66e3a1ad52ce4b22d5510ffc6d7b3db950bd7f43bc61801cfe7b24c2e2d |
haskell-free_5.1.3-1build2.debian.tar.xz | 3.5 KiB | 7a60fdc2d9b673e7cee922d18f964b6e2168ac7750ea63b35441284ade06f3ee |
haskell-free_5.1.3-1build2.dsc | 3.0 KiB | 58fd40d90ed227a21407c951697f608c81f7b76dc3649c38cc163366507d5e1b |
Available diffs
- diff from 5.1.3-1build1 to 5.1.3-1build2 (517 bytes)
Binary packages built by this source
- libghc-free-dev: No summary available for libghc-free-dev in ubuntu kinetic.
No description available for libghc-free-dev in ubuntu kinetic.
- 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.