1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
|
Source: haskell-free
Section: haskell
Priority: extra
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders: Iulian Udrea <iulian@linux.com>
Build-Depends: debhelper (>= 9)
, cdbs
, haskell-devscripts (>= 0.9)
, ghc
, ghc-prof
, libghc-bifunctors-dev (>= 4.0)
, libghc-bifunctors-dev (<< 5)
, libghc-bifunctors-prof
, libghc-comonad-dev (>= 4.0)
, libghc-comonad-dev (<< 5)
, libghc-comonad-prof
, libghc-distributive-dev (>= 0.2.1)
, libghc-distributive-prof
, libghc-mtl-dev (>= 2.0.1.0)
, libghc-mtl-dev (<< 2.2)
, libghc-mtl-prof
, libghc-prelude-extras-dev (>= 0.4)
, libghc-prelude-extras-dev (<< 1)
, libghc-prelude-extras-prof
, libghc-profunctors-dev (>= 4.0)
, libghc-profunctors-dev (<< 5)
, libghc-profunctors-prof
, libghc-semigroupoids-dev (>= 4.0)
, libghc-semigroupoids-dev (<< 5)
, libghc-semigroupoids-prof
, libghc-semigroups-dev (>= 0.8.3.1)
, libghc-semigroups-dev (<< 1)
, libghc-semigroups-prof
Build-Depends-Indep: ghc-doc,
, libghc-bifunctors-doc
, libghc-comonad-doc
, libghc-distributive-doc
, libghc-mtl-doc
, libghc-prelude-extras-doc
, libghc-profunctors-doc
, libghc-semigroupoids-doc
, libghc-semigroups-doc
Standards-Version: 3.9.5
Homepage: http://hackage.haskell.org/package/free
Vcs-Darcs: http://darcs.debian.org/pkg-haskell/haskell-free
Vcs-Browser: http://darcs.debian.org/cgi-bin/darcsweb.cgi?r=pkg-haskell/haskell-free
Package: libghc-free-dev
Architecture: any
Depends: ${haskell:Depends}, ${shlibs:Depends}, ${misc:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
Description: Monads for free${haskell:ShortBlurb}
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.
.
${haskell:Blurb}
Package: libghc-free-prof
Architecture: any
Depends: ${haskell:Depends}, ${misc:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
Description: Monads for free${haskell:ShortBlurb}
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.
.
${haskell:Blurb}
Package: libghc-free-doc
Section: doc
Architecture: all
Depends: ${misc:Depends}, ${haskell:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Description: Monads for free${haskell:ShortBlurb}
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.
.
${haskell:Blurb}
|
