Source: agda
Priority: extra
Section: haskell
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders: Iain Lane <laney@debian.org>
Build-Depends: debhelper (>= 7.0),
               haskell-devscripts (>= 0.8),
               cdbs (>> 0.4.58),
               ghc,
               libghc-binary-dev,
               libghc-hashable-dev (>= 1.1),
               libghc-hashable-dev (<< 1.2),
               libghc-hashtables-dev (>= 1.0),
               libghc-hashtables-dev (<< 1.1),
               libghc-haskeline-dev (>= 0.3),
               libghc-haskeline-dev (<< 0.7),
               libghc-haskell-src-dev (>= 1.0.1.1),
               libghc-haskell-src-dev (<< 2),
               libghc-mtl-dev (>= 2.0),
               libghc-mtl-dev (<< 3.2),
               libghc-xhtml-dev (>= 3000.2),
               libghc-xhtml-dev (<< 3000.3),
               libghc-zlib-dev (>= 0.4.0.1),
               libghc-zlib-dev (<< 0.6),
               libghc-src-exts-dev (>= 1.9.6),
               libghc-src-exts-dev (<< 1.12),
               libghc-quickcheck2-dev (>= 2.3),
               libghc-quickcheck2-dev (<< 2.5),
               libghc-syb-dev (>= 0.1),
               libghc-syb-dev (<< 0.4),
               happy (>= 1.15),
               happy (<< 2),
               alex (>= 2.3.1),
               libncurses5-dev
Build-Depends-Indep: ghc-doc,
                     libghc-binary-doc,
                     libghc-hashable-doc,
                     libghc-hashtables-doc,
                     libghc-haskeline-doc,
                     libghc-haskell-src-doc,
                     libghc-mtl-doc,
                     libghc-terminfo-doc,
                     libghc-xhtml-doc,
                     libghc-zlib-doc,
                     libghc-src-exts-doc, 
                     libghc-quickcheck2-doc,
                     libghc-syb-doc,
Standards-Version: 3.9.2
Vcs-Browser: http://git.debian.org/?p=pkg-haskell/agda.git;a=summary
Vcs-Git: git://git.debian.org/git/pkg-haskell/agda.git
Homepage: http://wiki.portal.chalmers.se/agda/

Package: libghc-agda-dev
Architecture: any
Section: haskell
Depends: ${haskell:Depends},
         ${misc:Depends},
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
Description: dependently typed functional programming language - development libraries
 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 normal library files.

Package: libghc-agda-doc
Architecture: all
Section: doc
Depends: ${misc:Depends}, ${haskell:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Replaces: haskell-agda-doc
Conflicts: haskell-agda-doc (<< 2.2.6-5)
Provides: haskell-agda-doc
Description: dependently typed functional programming language - documentation
 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 documentation files.

Package: agda-mode
Architecture: all
Section: misc
Depends: ${shlibs:Depends},
         ${haskell:Depends},
         ${misc:Depends},
         emacs | emacsen,
         haskell-mode,
         libghc-agda-dev (>= ${source:Version}),
         libghc-agda-dev (<< ${source:Version}.1~)
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
Architecture: all
Section: misc
Depends: ${misc:Depends},
         libghc-agda-dev,
         agda-mode,
         agda-bin,
         agda-stdlib,
         agda-stdlib-doc
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.
