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
110
111
112
113
114
115
116
117
118
119
|
Source: haskell-free
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders: Iulian Udrea <iulian@linux.com>
Priority: extra
Section: haskell
Build-Depends:
cdbs,
debhelper (>= 9),
ghc (>= 8),
ghc-prof,
haskell-devscripts (>= 0.13),
libghc-bifunctors-dev (<< 6),
libghc-bifunctors-dev (>= 4),
libghc-bifunctors-prof,
libghc-comonad-dev (<< 6),
libghc-comonad-dev (>= 4),
libghc-comonad-prof,
libghc-distributive-dev (>= 0.2.1),
libghc-distributive-prof,
libghc-exceptions-dev (<< 0.9),
libghc-exceptions-dev (>= 0.6),
libghc-exceptions-prof,
libghc-mtl-dev (<< 2.3),
libghc-mtl-dev (>= 2.0.1.0),
libghc-mtl-prof,
libghc-prelude-extras-dev (<< 1),
libghc-prelude-extras-dev (>= 0.4),
libghc-prelude-extras-prof,
libghc-profunctors-dev (<< 6),
libghc-profunctors-dev (>= 4),
libghc-profunctors-prof,
libghc-semigroupoids-dev (<< 6),
libghc-semigroupoids-dev (>= 4),
libghc-semigroupoids-prof,
libghc-semigroups-dev (<< 1),
libghc-semigroups-dev (>= 0.8.3.1),
libghc-semigroups-prof,
libghc-transformers-compat-dev (<< 1),
libghc-transformers-compat-dev (>= 0.3),
libghc-transformers-compat-prof,
Build-Depends-Indep:
ghc-doc,
libghc-bifunctors-doc,
libghc-comonad-doc,
libghc-distributive-doc,
libghc-exceptions-doc,
libghc-mtl-doc,
libghc-prelude-extras-doc,
libghc-profunctors-doc,
libghc-semigroupoids-doc,
libghc-semigroups-doc,
libghc-transformers-compat-doc,
Standards-Version: 3.9.8
Homepage: http://github.com/ekmett/free/
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-haskell/DHG_packages.git/tree/p/haskell-free
Vcs-Git: https://anonscm.debian.org/git/pkg-haskell/DHG_packages.git
Package: libghc-free-dev
Architecture: any
Depends: ${haskell:Depends}, ${misc:Depends}, ${shlibs: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
Architecture: all
Section: doc
Depends: ${haskell:Depends}, ${misc: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}
|
