[Pkg-haskell-commits] [SCM] Packaging for Agda branch, master, updated. debian/2.3.2-2

[Iain Lane]

The following commit has been merged in the master branch:
commit bd2a43feb2cc664834d406a9e7870d58d40dd2a1
Author: Iain Lane <laney at debian.org>
Date:   Mon May 27 19:11:50 2013 +0100

    Use common substvars for description blurbs
    
    Conflicts:
    	debian/control

diff --git a/debian/control b/debian/control
index 3f3c48a..6d8492e 100644
--- a/debian/control
+++ b/debian/control
@@ -4,7 +4,7 @@ Section: haskell
 Maintainer: Debian Haskell Group <pkg-haskell-maintainers at lists.alioth.debian.org>
 Uploaders: Iain Lane <laney at debian.org>, Kiwamu Okabe <kiwamu at debian.or.jp>
 Build-Depends: debhelper (>= 9),
-               haskell-devscripts (>= 0.8.13~),
+               haskell-devscripts (>= 0.8.15~),
                cdbs (>> 0.4.58),
                ghc (>= 7.6),
                libghc-binary-dev,
@@ -67,7 +67,7 @@ Depends: ${haskell:Depends},
 Recommends: ${haskell:Recommends}
 Suggests: ${haskell:Suggests}
 Provides: ${haskell:Provides}
-Description: dependently typed functional programming language - development libraries
+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
@@ -80,7 +80,7 @@ Description: dependently typed functional programming language - development lib
  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.
+ ${haskell:Blurb}
 
 Package: libghc-agda-doc
 Architecture: all
@@ -91,7 +91,7 @@ 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
+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
@@ -104,7 +104,7 @@ Description: dependently typed functional programming language - documentation
  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.
+ ${haskell:Blurb}
 
 Package: agda-mode
 Architecture: all

-- 
Packaging for Agda