1 Source: agda
2 Priority: optional
3 Section: haskell
4 Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
5 Uploaders: Iain Lane <laney@ubuntu.com>
6 Build-Depends: debhelper (>= 7.0),
7 haskell-devscripts (>= 0.6.15+nmu12~),
8 cdbs (>> 0.4.58),
9 ghc6 (>= 6.10.3-2~),
10 ghc6-prof (>= 6.10.3-2~),
11 libghc6-quickcheck2-dev (>= 2.1.0.1),
12 libghc6-quickcheck2-dev (<< 2.1.0.1+),
13 libghc6-binary-dev (>= 0.4.4),
14 libghc6-binary-dev (<< 0.6),
15 libghc6-haskeline-dev (>= 0.3),
16 libghc6-haskeline-dev (<< 0.7),
17 libghc6-haskell-src-dev (>= 1.0.1.1),
18 libghc6-haskell-src-dev (<< 2),
19 libghc6-mtl-dev (>= 1.1),
20 libghc6-mtl-dev (<< 2),
21 libghc6-utf8-string-dev (>= 0.3),
22 libghc6-utf8-string-dev (<< 0.4),
23 libghc6-xhtml-dev (>= 3000.2),
24 libghc6-xhtml-dev (<< 3000.3),
25 libghc6-zlib-dev (>= 0.4.0.1),
26 libghc6-zlib-dev (<< 1),
27 libghc6-quickcheck2-prof (>= 2.1.0.1),
28 libghc6-quickcheck2-prof (<< 2.1.0.1+),
29 libghc6-binary-prof (>= 0.4.4),
30 libghc6-binary-prof (<< 0.6),
31 libghc6-haskeline-prof (>= 0.3),
32 libghc6-haskeline-prof (<< 0.7),
33 libghc6-haskell-src-prof (>= 1.0.1.1),
34 libghc6-haskell-src-prof (<< 2),
35 libghc6-mtl-prof (>= 1.1),
36 libghc6-mtl-prof (<< 2),
37 libghc6-utf8-string-prof (>= 0.3),
38 libghc6-utf8-string-prof (<< 0.4),
39 libghc6-xhtml-prof (>= 3000.2),
40 libghc6-xhtml-prof (<< 3000.3),
41 libghc6-zlib-prof (>= 0.4.0.1),
42 libghc6-zlib-prof (<< 1),
43 happy (>= 1.15),
44 happy (<< 2),
45 alex (>= 2.0.1),
46 alex (<< 3),
47 hscolour (>= 1.8),
48 ghc6-doc (>= 6.10.3-2~),
49 haddock (>= 2.4.2),
50 libncurses5-dev
51 Build-Depends-Indep: libghc6-quickcheck2-doc (>= 2.1.0.1),
52 libghc6-quickcheck2-doc (<< 2.1.0.1+),
53 libghc6-binary-doc (>= 0.4.4),
54 libghc6-binary-doc (<< 0.6),
55 libghc6-haskeline-doc (>= 0.3),
56 libghc6-haskeline-doc (<< 0.7),
57 libghc6-haskell-src-doc (>= 1.0.1.1),
58 libghc6-haskell-src-doc (<< 2),
59 libghc6-mtl-doc (>= 1.1),
60 libghc6-mtl-doc (<< 2),
61 libghc6-terminfo-doc,
62 libghc6-utf8-string-doc (>= 0.3),
63 libghc6-utf8-string-doc (<< 0.4),
64 libghc6-xhtml-doc (>= 3000.2),
65 libghc6-xhtml-doc (<< 3000.3),
66 haskell-zlib-doc (>= 0.4.0.1),
67 haskell-zlib-doc (<< 1)
68 Standards-Version: 3.8.2
69 Vcs-Browser: http://git.debian.org/?p=pkg-haskell/agda.git;a=summary
70 Vcs-Git: git://git.debian.org/pkg-haskell/agda.git
72 Package: libghc6-agda-dev
73 Architecture: any
74 Section: haskell
75 Depends: ${haskell:Depends},
76 ${misc:Depends},
77 Suggests: ${haskell:Suggests}
78 Description: a dependently typed functional programming language - development libraries
79 Agda is a dependently typed functional programming language: It has inductive
80 families, which are like Haskell's GADTs, but they can be indexed by values and
81 not just types. It also has parameterised modules, mixfix operators, Unicode
82 characters, and an interactive Emacs interface (the type checker can assist in
83 the development of your code).
84 .
85 Agda is also a proof assistant: It is an interactive system for writing and
86 checking proofs. Agda is based on intuitionistic type theory, a foundational
87 system for constructive mathematics developed by the Swedish logician Per
88 Martin-Löf. It has many similarities with other proof assistants based on
89 dependent types, such as Coq, Epigram and NuPRL.
90 .
91 This package contains the normal library files.
93 Package: libghc6-agda-prof
94 Architecture: any
95 Section: haskell
96 Depends: ${haskell:Depends},
97 ${misc:Depends},
98 Description: a dependently typed functional programming language - profiling libraries
99 Agda is a dependently typed functional programming language: It has inductive
100 families, which are like Haskell's GADTs, but they can be indexed by values and
101 not just types. It also has parameterised modules, mixfix operators, Unicode
102 characters, and an interactive Emacs interface (the type checker can assist in
103 the development of your code).
104 .
105 Agda is also a proof assistant: It is an interactive system for writing and
106 checking proofs. Agda is based on intuitionistic type theory, a foundational
107 system for constructive mathematics developed by the Swedish logician Per
108 Martin-Löf. It has many similarities with other proof assistants based on
109 dependent types, such as Coq, Epigram and NuPRL.
110 .
111 This package contains the libraries compiled with profiling enabled.
113 Package: haskell-agda-doc
114 Architecture: all
115 Section: doc
116 Depends: ${misc:Depends}
117 Recommends: ${haskell:Recommends}
118 Suggests: ${haskell:Suggests}
119 Description: a dependently typed functional programming language - documentation
120 Agda is a dependently typed functional programming language: It has inductive
121 families, which are like Haskell's GADTs, but they can be indexed by values and
122 not just types. It also has parameterised modules, mixfix operators, Unicode
123 characters, and an interactive Emacs interface (the type checker can assist in
124 the development of your code).
125 .
126 Agda is also a proof assistant: It is an interactive system for writing and
127 checking proofs. Agda is based on intuitionistic type theory, a foundational
128 system for constructive mathematics developed by the Swedish logician Per
129 Martin-Löf. It has many similarities with other proof assistants based on
130 dependent types, such as Coq, Epigram and NuPRL.
131 .
132 This package contains the documentation files.
134 Package: agda-mode
135 Architecture: all
136 Section: misc
137 Depends: ${shlibs:Depends},
138 ${haskell:Depends},
139 ${misc:Depends},
140 emacs | emacsen,
141 haskell-mode,
142 libghc6-agda-dev (>= ${source:Version}),
143 libghc6-agda-dev (<< ${source:Version}.1~)
144 Description: the emacs mode for Agda
145 Agda is a dependently typed functional programming language: It has inductive
146 families, which are like Haskell's GADTs, but they can be indexed by values and
147 not just types. It also has parameterised modules, mixfix operators, Unicode
148 characters, and an interactive Emacs interface (the type checker can assist in
149 the development of your code).
150 .
151 Agda is also a proof assistant: It is an interactive system for writing and
152 checking proofs. Agda is based on intuitionistic type theory, a foundational
153 system for constructive mathematics developed by the Swedish logician Per
154 Martin-Löf. It has many similarities with other proof assistants based on
155 dependent types, such as Coq, Epigram and NuPRL.
156 .
157 This package contains the emacs interactive development mode for Agda. This
158 mode is the preferred way to write Agda code, and offers features such as
159 iterative development, refinement, case analysis and so on.
