summaryrefslogtreecommitdiff
path: root/p/agda/debian/control
blob: 41c4014ce3016d10961b6167d7b76583b8ac7be9 (plain)
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
Source: agda
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders:
 Iain Lane <laney@debian.org>,
 Kiwamu Okabe <kiwamu@debian.or.jp>
Priority: extra
Section: haskell
Build-Depends:
 alex,
 cdbs,
 cpphs (>= 1.20.2),
 debhelper (>= 10),
 dh-elpa,
 ghc (>= 8),
 happy,
 haskell-devscripts (>= 0.13),
 libghc-boxes-dev (<< 0.2),
 libghc-boxes-dev (>= 0.1.3),
 libghc-data-hash-dev (<< 0.3),
 libghc-data-hash-dev (>= 0.2.0.0),
 libghc-edison-core-dev (<< 1.3.2),
 libghc-edison-core-dev (>= 1.3.1.1),
 libghc-edit-distance-dev (<< 0.3),
 libghc-edit-distance-dev (>= 0.2.1.2),
 libghc-equivalence-dev (<< 0.4),
 libghc-equivalence-dev (>= 0.2.5),
 libghc-filemanip-dev (<< 0.4),
 libghc-filemanip-dev (>= 0.3.6.3),
 libghc-geniplate-mirror-dev (<< 0.8),
 libghc-geniplate-mirror-dev (>= 0.6.0.6),
 libghc-gitrev-dev (<< 2.0),
 libghc-gitrev-dev (>= 1.2),
 libghc-hashable-dev (<< 1.3),
 libghc-hashable-dev (>= 1.2.1.0),
 libghc-hashtables-dev,
 libghc-ieee754-dev (<< 0.9),
 libghc-ieee754-dev (>= 0.7.8),
 libghc-monadplus-dev (<< 1.5),
 libghc-monadplus-dev (>= 1.4),
 libghc-murmur-hash-dev (<< 0.2),
 libghc-murmur-hash-dev (>= 0.1),
 libghc-mtl-dev,
 libghc-parallel-dev (<< 3.3),
 libghc-parallel-dev (>= 3.2.0.4),
 libghc-regex-tdfa-dev (<< 1.3),
 libghc-regex-tdfa-dev (>= 1.2.2),
 libghc-strict-dev (<< 0.4),
 libghc-strict-dev (>= 0.3.2),
 libghc-transformers-compat-dev (<< 0.6),
 libghc-transformers-compat-dev (>= 0.3.3.3),
 libghc-transformers-dev,
 libghc-unordered-containers-dev (<< 0.3),
 libghc-unordered-containers-dev (>= 0.2.5.0),
 libghc-zlib-dev (<< 0.7),
 libghc-zlib-dev (>= 0.4.0.1),
 libncurses5-dev,
Build-Depends-Indep:
 ghc-doc,
 libghc-boxes-doc,
 libghc-data-hash-doc,
 libghc-edison-core-doc,
 libghc-edit-distance-doc,
 libghc-equivalence-doc,
 libghc-geniplate-mirror-doc,
 libghc-gitrev-doc,
 libghc-hashable-doc,
 libghc-hashtables-doc,
 libghc-ieee754-doc,
 libghc-monadplus-doc,
 libghc-mtl-doc,
 libghc-murmur-hash-doc,
 libghc-parallel-doc,
 libghc-regex-tdfa-doc,
 libghc-strict-doc,
 libghc-transformers-compat-doc,
 libghc-transformers-doc,
 libghc-unordered-containers-doc,
 libghc-zlib-doc,
Standards-Version: 4.0.0
Homepage: http://wiki.portal.chalmers.se/agda/
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-haskell/DHG_packages.git/tree/p/agda
Vcs-Git: https://anonscm.debian.org/git/pkg-haskell/DHG_packages.git

Package: agda
Architecture: all
Section: misc
Depends:
 agda-bin,
 agda-stdlib,
 agda-stdlib-doc,
 elpa-agda2-mode,
 libghc-agda-dev,
 ${misc:Depends},
Description: dependently typed functional programming language
 Agda is a dependently typed functional programming language: It has inductive
 families, which are like Haskell's GADTs, but they can be indexed by values and
 not just types. It also has parameterised modules, mixfix operators, Unicode
 characters, and an interactive Emacs interface (the type checker can assist in
 the development of your code).
 .
 Agda is also a proof assistant: It is an interactive system for writing and
 checking proofs. Agda is based on intuitionistic type theory, a foundational
 system for constructive mathematics developed by the Swedish logician Per
 Martin-Löf. It has many similarities with other proof assistants based on
 dependent types, such as Coq, Epigram and NuPRL.
 .
 This is a meta package which provides Agda's emacs mode, executable, standard
 library and its documentation.

Package: agda-bin
Architecture: any
Depends:
 ${haskell:Depends},
 ${misc:Depends},
 ${shlibs:Depends},
Recommends:
 libghc-agda-dev (<< ${source:Upstream-Version}+~),
 libghc-agda-dev (>= ${source:Upstream-Version}),
 ${haskell:Recommends},
Suggests:
 elpa-agda2-mode,
 ${haskell:Suggests},
Description: commandline interface to Agda
 Agda is a dependently typed functional programming language: It has inductive
 families, which are like Haskell's GADTs, but they can be indexed by values and
 not just types. It also has parameterised modules, mixfix operators, Unicode
 characters, and an interactive Emacs interface (the type checker can assist in
 the development of your code).
 .
 Agda is also a proof assistant: It is an interactive system for writing and
 checking proofs. Agda is based on intuitionistic type theory, a foundational
 system for constructive mathematics developed by the Swedish logician Per
 Martin-Löf. It has many similarities with other proof assistants based on
 dependent types, such as Coq, Epigram and NuPRL.
 .
 This package provides a command-line program for type-checking and compiling
 Agda programs. The program can also generate hyperlinked, highlighted HTML
 files from Agda sources.

Package: elpa-agda2-mode
Section: editors
Architecture: all
Depends:
 agda-bin (<< ${source:Version}.1~),
 agda-bin (>= ${source:Version}),
 libghc-agda-dev (<< ${source:Version}.1~),
 libghc-agda-dev (>= ${source:Version}),
 ${haskell:Depends},
 ${misc:Depends},
 ${shlibs:Depends},
Built-Using: ${misc:Built-Using}
Recommends:
 emacs (>= 46.0),
Enhances:
 emacs,
 emacs24,
Breaks:
 agda-mode (<< 2.5.1),
Provides:
 agda-mode,
Description: dependently typed functional programming language — emacs mode
 Agda is a dependently typed functional programming language: It has inductive
 families, which are like Haskell's GADTs, but they can be indexed by values and
 not just types. It also has parameterised modules, mixfix operators, Unicode
 characters, and an interactive Emacs interface (the type checker can assist in
 the development of your code).
 .
 Agda is also a proof assistant: It is an interactive system for writing and
 checking proofs. Agda is based on intuitionistic type theory, a foundational
 system for constructive mathematics developed by the Swedish logician Per
 Martin-Löf. It has many similarities with other proof assistants based on
 dependent types, such as Coq, Epigram and NuPRL.
 .
 This package contains the emacs interactive development mode for Agda. This
 mode is the preferred way to write Agda code, and offers features such as
 iterative development, refinement, case analysis and so on.

Package: agda-mode
Architecture: all
Priority: extra
Section: oldlibs
Depends:
 ${misc:Depends},
Description: transitional dummy package for elpa-agda2-mode
 agda-mode has been ELPAfied.  See the elpa-agda2-mode package.  This
 transitional package is safe to remove.

Package: libghc-agda-dev
Architecture: any
Section: haskell
Depends:
 ${haskell:Depends},
 ${misc:Depends},
 ${shlibs:Depends},
Recommends:
 ${haskell:Recommends},
Suggests:
 ${haskell:Suggests},
Provides:
 ${haskell:Provides},
Description: dependently typed functional programming language${haskell:ShortBlurb}
 Agda is a dependently typed functional programming language: It has inductive
 families, which are like Haskell's GADTs, but they can be indexed by values and
 not just types. It also has parameterised modules, mixfix operators, Unicode
 characters, and an interactive Emacs interface (the type checker can assist in
 the development of your code).
 .
 Agda is also a proof assistant: It is an interactive system for writing and
 checking proofs. Agda is based on intuitionistic type theory, a foundational
 system for constructive mathematics developed by the Swedish logician Per
 Martin-Löf. It has many similarities with other proof assistants based on
 dependent types, such as Coq, Epigram and NuPRL.
 .
 ${haskell:Blurb}

Package: libghc-agda-doc
Architecture: all
Section: doc
Depends:
 ${haskell:Depends},
 ${misc:Depends},
Recommends:
 ${haskell:Recommends},
Suggests:
 ${haskell:Suggests},
Conflicts:
 haskell-agda-doc (<< 2.2.6-5),
Provides:
 haskell-agda-doc,
Replaces:
 haskell-agda-doc,
Description: dependently typed functional programming language${haskell:ShortBlurb}
 Agda is a dependently typed functional programming language: It has inductive
 families, which are like Haskell's GADTs, but they can be indexed by values and
 not just types. It also has parameterised modules, mixfix operators, Unicode
 characters, and an interactive Emacs interface (the type checker can assist in
 the development of your code).
 .
 Agda is also a proof assistant: It is an interactive system for writing and
 checking proofs. Agda is based on intuitionistic type theory, a foundational
 system for constructive mathematics developed by the Swedish logician Per
 Martin-Löf. It has many similarities with other proof assistants based on
 dependent types, such as Coq, Epigram and NuPRL.
 .
 ${haskell:Blurb}