#4116: Type supplement for constructor specific uses of sum types
-+--
Reporter: gabrielrf | Owner:
Type: proposal | Status: new
Priority: normal
#4116: Type supplement for constructor specific uses of sum types
-+--
Reporter: gabrielrf | Owner:
Type: proposal | Status: new
Priority: normal
#4123: Control.Concurrent.MVar doesn't need to depend on the Prelude
-+--
Reporter: tibbe | Owner:
Type: bug | Status: new
Priority:
#4116: Type supplement for constructor specific uses of sum types
-+--
Reporter: gabrielrf | Owner:
Type: proposal | Status: new
Priority: normal
#4122: Data.Monoid doesn't need to depend on the Prelude
-+--
Reporter: tibbe | Owner:
Type: bug | Status: new
Priority: normal
#4122: Data.Monoid doesn't need to depend on the Prelude
-+--
Reporter: tibbe | Owner:
Type: bug | Status: new
Priority: normal
#4122: Data.Monoid doesn't need to depend on the Prelude
-+--
Reporter: tibbe |Owner:
Type: bug | Status: patch
Priority: normal
#4116: Type supplement for constructor specific uses of sum types
-+--
Reporter: gabrielrf | Owner:
Type: proposal | Status: new
Priority: normal
#2889: Compilation fails - Can't opne temporary
---+
Reporter: fobrock | Owner: simonmar
Type: bug | Status: new
Priority: high | Milestone: 6.12.3
#3994: Add support for creating and interrupting process groups
--+-
Reporter: hamish |Owner: simonmar
Type: proposal | Status: patch
Priority: high
#3994: Add support for creating and interrupting process groups
--+-
Reporter: hamish |Owner: simonmar
Type: proposal | Status: new
Priority: high
#4117: GHC does not accept --srcdir
-+--
Reporter: uzytkownik|Owner:
Type: bug | Status: new
Priority: normal|
#4123: Control.Concurrent.MVar doesn't need to depend on the Prelude
-+--
Reporter: tibbe |Owner:
Type: bug | Status: patch
#4117: GHC does not accept --srcdir
-+--
Reporter: uzytkownik|Owner:
Type: bug | Status: new
Priority: normal|
#4124: GHC rejects instance quotations with splices in the instance head
-+--
Reporter: lilac | Owner:
Type: bug | Status: new
#4124: GHC rejects instance quotations with splices in the instance head
-+--
Reporter: lilac | Owner:
Type: bug | Status: new
#4125: Template haskell rejects duplicate instances before they're spliced
-+--
Reporter: lilac | Owner:
Type: bug | Status: new
#4127: Template haskell instance declaration quotations with members don't work
in
ghci
-+--
Reporter: lilac | Owner:
Type: bug | Status: new
#4128: Can't capture classes inside a template haskell type quotation
-+--
Reporter: lilac | Owner:
Type: feature request | Status: new
Priority:
#4129: Template haskell API makes inconsistent use of [Q Dec], Q [Dec] and Q Dec
-+--
Reporter: lilac | Owner:
Type: proposal | Status: new
#2833: internal error: throwTo: unrecognised why_blocked value
-+--
Reporter: lilac | Owner:
Type: bug | Status: closed
Priority: low
Hi all,
we're facing serious problems (the seg'faulting kind) with Gtk2Hs on
Mac OS 10.6. Chris has tracked this down to incorrect structure
offsets that hsc2hs calculates.
The offsets that hsc2hs calculates are too large, so it is probably in
x86_64 mode. The offsets with which Gtk+ was
Ivan Lazar Miljenovic schrieb:
We considered giving it a new name (fgl', etc.) but figured that in the
long term this wouldn't be advantagous. We feel that the situation is
analogous to QuickCheck: when the new version came out most people kept
using the old one until slowly the momentum
Christian Maeder christian.mae...@dfki.de writes:
Ivan Lazar Miljenovic schrieb:
We considered giving it a new name (fgl', etc.) but figured that in the
long term this wouldn't be advantagous. We feel that the situation is
analogous to QuickCheck: when the new version came out most people
Ivan Lazar Miljenovic schrieb:
[...]
we don't need to repeat a parsec-2 vs parsec-3 discussion.
There are obviously different opinions that cannot be easily changed.
Well, I've created a custom instance:
http://trac.informatik.uni-bremen.de:8080/hets/browser/trunk/Common/Lib/Graph.hs
and our
Ivan Lazar Miljenovic schrieb:
Although parsec-3 can be used as an replacement for parsec-2 it would
have been better, they had different names (as argued elsewhere for the
haskell platform).
I'm sorry, I don't recall this discussion: care to summarise?
On Mon, Jun 07, 2010 at 11:50:44AM -0700, Donald Bruce Stewart wrote:
ivan.miljenovic:
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to make an initial release to get feedback
on the API in the next few weeks.
However, I'm sending this
Christian Maeder christian.mae...@dfki.de writes:
Ivan Lazar Miljenovic schrieb:
Although parsec-3 can be used as an replacement for parsec-2 it would
have been better, they had different names (as argued elsewhere for the
haskell platform).
I'm sorry, I don't recall this discussion: care
ivan.miljenovic:
Christian Maeder christian.mae...@dfki.de writes:
Ivan Lazar Miljenovic schrieb:
Although parsec-3 can be used as an replacement for parsec-2 it would
have been better, they had different names (as argued elsewhere for the
haskell platform).
I'm sorry, I don't
Hey Robby,
Yeah, two documents:
The PVP
http://www.haskell.org/haskellwiki/Package_versioning_policy
The Package Addition Policy for the Haskell Platform
http://trac.haskell.org/haskell-platform/wiki/AddingPackages
robby:
Hi all. Just thought I'd poke my head in here
Ian Lynagh ig...@earth.li writes:
On Mon, Jun 07, 2010 at 11:50:44AM -0700, Donald Bruce Stewart wrote:
A complete rewrite with a new maintainer: fgl-awesome
In 10 years time, we don't want to have
fgl
fgl-awesome
fgl-great
fgl-joe
which all do the same thing, and have
On Sun, Jun 6, 2010 at 5:10 AM, Thomas Hartman tphya...@gmail.com wrote:
Here's two implementations of break, a snappy one from the prelude,
...
prelbreak p xs = (takeWhile (not . p) xs,dropWhile (not . p) xs) --
fast, more or less as implemented in prelude iiuc
I had a look at the prelude,
Sorry, I should have said. I have installed Haskell Platform in the default
place:
C:\Program Files\Haskell Platform\2010.1.0.0
Chris
-Original Message-
From: Ivan Lazar Miljenovic [mailto:ivan.miljeno...@gmail.com]
Sent: 07 June 2010 23:35
To: Chris Dornan
Cc:
Thanks very much: I didn't know about this resource.
I do appreciate all of the hard work everyone has put in and I want to
contribute myself, especially in 2011 (I am fully committed until then). For
the moment the best contribution I can make is to report the problems I am
having.
The above
Hi,
The real reason behind my surprise was, that I was wondering how more
modern languages could make inroads into such an environment. Haskell
without recursion and dynamic memory allocation? Hard to imagine.
for some safety critical applications that require certification, SCADE with the
R J wrote:
What's the cleanest definition for a function f :: [a] - [a] that takes a
list and returns the same list, with alternate items removed? e.g., f [0,
1, 2, 3, 4, 5] = [1,3,5]?
f = map head . takeWhile (not . null) . iterate (drop 2) . drop 1
Regards,
Yitz
The fonts aren't rasterized, but PDFs that were converted from PS
tend to look awful in almost any PDF viewer other than Adobe's Acrobat
Reader. Fonts look especially bad.
I don't know exactly what the problem is, but my experience is that
you are best off generating PDF directly, and using
Hi, I cannot subscribe to libraries maillist. So I forward this here.
I cannot install gtk2hs-cairo by cabal using cairo 1.9.6 compiled
myself. Cabal always said that the cairo library/devel files were
missing.
-- Forwarded message --
From: Axel Simon axel.si...@in.tum.de
Date:
Can't forget fix in a game of code golf!
(fix $ \f (x:_: xs) - x : f xs) [1..]
= [1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,4...
2010/6/8 Yitzchak Gale g...@sefer.org:
R J wrote:
What's the cleanest definition for a function f :: [a] - [a] that takes a
list and returns the
R J wrote:
What's an elegant definition of a Haskell function that takes two strings
and returns Nothing in case the first string isn't a substring of the
first, or Just i, where i is the index number of the position within the
first string where the second string begins?
Thomas Hartman
This isn`t a manifestation of the Curry-Howard isomorphism?
2010/6/8 Alexander Solla a...@2piix.com
On Jun 7, 2010, at 4:10 PM, Alexander Solla wrote:
You might note how much like evaluating the function generating the
analysis is.
___
Hello David,
Tuesday, June 8, 2010, 10:33:51 AM, you wrote:
( my guess is USE_REPORT_PRELUDE compiles functions as defined in
the haskell report, but the other version is faster and used by default. )
you are right
--
Best regards,
Bulat
if we add 'a' to the definition of this function, (to make it work), the
type of it turns out to be: [a] - [(a, Bool)]
you might have forgotten the map fst $ part.
Best,
On 8 June 2010 14:51, Bill Atkins watk...@alum.rpi.edu wrote:
f :: [a] - [a]
f = filter snd $ zip a (cycle [True, False])
f :: [a] - [a]
f = filter snd $ zip a (cycle [True, False])
On Monday, June 7, 2010, Ozgur Akgun ozgurak...@gmail.com wrote:
or, since you don't need to give a name to the second element of the list:
f :: [a] - [a]
f (x:_:xs) = x : f xsf x = x
On 7 June 2010 20:11, Ozgur Akgun
From: Don Stewart d...@galois.com
ivan.miljenovic:
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to make an initial release to get feedback
on the API in the next few weeks.
However, I'm sending this email out now to warn people that I
What's an elegant definition of a Haskell function that takes two strings
and returns Nothing in case the first string isn't a substring of the
first, or Just i, where i is the index number of the position within the
first string where the second string begins?
my quick take, with Maybe and
jwlato:
From: Don Stewart d...@galois.com
ivan.miljenovic:
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to make an initial release to get feedback
on the API in the next few weeks.
However, I'm sending this email out now to warn
Did you manage to fix this problem, or are there any updates on it? I am now
having the same issue - presumably due to updating my Mac OS X version, because
cabal was working fine before that. I can't upgrade cabal or install anything
either, same reason.
Gordon J. Uszkay
And for a few more lines of codes, you get a more flexible solution:
data Consume = Take | Skip
consumeBy :: [Consume] - [a] - [a]
consumeBy [] _ = []
consumeBy _[] = []
consumeBy (tOrS:takesAndSkips) (x:xs) = case tOrS of
On Tuesday 08 June 2010 08:33:51, David Virebayre wrote:
On Sun, Jun 6, 2010 at 5:10 AM, Thomas Hartman tphya...@gmail.com
wrote:
Here's two implementations of break, a snappy one from the prelude,
...
prelbreak p xs = (takeWhile (not . p) xs,dropWhile (not . p) xs) --
fast, more or
There have been a few cases of major API / rewrites to famous old
packages causing problems, including:
* QuickCheck 1 vs 2
* parsec 2 vs 3
* OpenGL
a similar opportunity is present with 'fgl', where the new maintainers
are seeking to improve the code.
Below I try to summarise
On Tue, Jun 8, 2010 at 4:13 PM, Don Stewart d...@galois.com wrote:
jwlato:
From: Don Stewart d...@galois.com
ivan.miljenovic:
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to make an initial release to get feedback
on the API in the
Hi,
R J wrote:
What's an elegant definition of a Haskell function that takes two
strings and returns Nothing in case the first string isn't a
substring of the first, or Just i, where i is the index number of
the position within the first string where the second string begins?
The naive
2010/6/6 R J rj248...@hotmail.com:
What's the cleanest definition for a function f :: [a] - [a] that takes a
list and returns the same list, with alternate items removed? e.g., f [0,
1, 2, 3, 4, 5] = [1,3,5]?
f x = [y | (True, y) - zip (cycle [False, True]) x]
Thanks Stephen--that was related to my original question, about using HP
with Cygwin. The answer seems to be No!--you must use MSYS (for real
work).
The short version:
- Cygwin provides commandline tools, compilers and libraries
- MSYS provides commandline tools for the MinGW compilers and
El dom, 06-06-2010 a las 15:51 +, R J escribió:
What's an elegant definition of a Haskell function that takes two
strings and returns Nothing in case the first string isn't a
substring of the first, or Just i, where i is the index number of
the position within the first string where the
Hi,
I have a call grah which contains information of the edges in the following
format
caller callee count (time spent by the
caller)
===
foo bar 10100
xxx yyy 2010
zzz yyy 1010
(I used pintool pintool.org
Hi Arie (and others who are interested in the regions library),
I would like to let you know that I'm working on a new version of my
regions package and its reverse dependencies:
regions-monadsfd, regions-monadstf,
safer-file-handles, regional-pointers and usb-safe.
The major change is that I
Yes, this was an old draft I accidentally sent out.
My post higher up the thread is correct. :)
On Tuesday, June 8, 2010, Ozgur Akgun ozgurak...@gmail.com wrote:
if we add 'a' to the definition of this function, (to make it work), the type
of it turns out to be: [a] - [(a, Bool)]
you might
On 8 June 2010 15:13, Jürgen Doser jurgen.do...@gmail.com wrote:
El dom, 06-06-2010 a las 14:46 +, R J escribió:
What's the cleanest definition for a function f :: [a] - [a] that
takes a list and returns the same list, with alternate items removed?
e.g., f [0, 1, 2, 3, 4, 5] = [1,3,5]?
jwlato:
Great points: I've added them to this wiki page of for and against
points:
http://haskell.org/haskellwiki/Libraries/WhenToRewriteOrRename
Please add points as you see fit, and maybe we can come up with a
mitigation/change plan.
Thanks very much; that's a useful page.
Hello
The regular list functionals - map, zip, foldl, foldr, filter, etc. -
all process the input list at speed 1 - i.e. one element at a time.
As Ozgur Akgun has shown - consuming the list at speed 2 gives a
very pleasant implementation - algorithmically:
consume at speed 2, produce the new
El dom, 06-06-2010 a las 14:46 +, R J escribió:
What's the cleanest definition for a function f :: [a] - [a] that
takes a list and returns the same list, with alternate items removed?
e.g., f [0, 1, 2, 3, 4, 5] = [1,3,5]?
adding another suggestion:
import Data.Either(rights)
f = rights
It only works for infinite lists, though
you wanted it :)
(fix $ \f xs - case xs of { (x:_: xs) - x : f xs; _ - [] }) [1..10]
= [1,3,5,7,9]
here you go :)
2010/6/8 Yitzchak Gale g...@sefer.org
Christopher Done wrote:
Can't forget fix in a game of code golf!
(fix $ \f (x:_: xs) - x :
Michael Schuerig wrote:
I was dumbfounded, although I have known all this. I have no personal
experience with either embedded or real time software, but I've been
aware that C still is the most popular language for that purpose and
that coding standards are very restrictive.
The real
I saw on the Reddit page that people urged caution about the costs of
hosting haskell.org commercially. This was a jest wasn't it? ( The cost of
webhosting is absurdly cheap, by almost any standards.)
I would be very happy to help out here but time (where the true costs lie)
is my main concern.
R J rj248...@hotmail.com writes:
What's an elegant definition of a Haskell function that takes
two strings and returns Nothing in case the first string
isn't a substring of the first, or Just i, where i is the
index number of the position within the first string where the
second string
Christopher Done wrote:
Can't forget fix in a game of code golf!
(fix $ \f (x:_: xs) - x : f xs) [1..]
= [1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,4...
Ho, good shot! It only works for infinite lists, though:
Prelude (fix $ \f (x:_: xs) - x : f xs) [1..10]
[1,3,5,7,9***
OK, here's mine:
f as = [ x | (True,x) - zip (cycle [True, False]) as ]
-md
begin R J quotation:
What's the cleanest definition for a function f :: [a] - [a] that takes a
list and returns the same list, with alternate items removed? e.g., f [0, 1,
2, 3, 4, 5] = [1,3,5]?
Hello all
While new libraries develop at pace, their documentation rarely does;
so I'd have to disagree with John's claim that re-naming libraries
makes development by new users harder. I'd argue that having tutorials
not work for later revisions is more confusing than having various
packages
On 06/08/10 11:08, Don Stewart wrote:
Are there any other arguments I'm missing?
Also parsec3 had an issue as an upgrade that it was slower at runtime
(at least for a few years). (and some people were using parsec in the
real world for performance-critical applications.)
-Isaac
On Jun 8, 2010, at 2:38 AM, Alberto G. Corona wrote:
This is`t a manifestation of the Curry-Howard isomorphism?
Yes, basically.
If we rephrase the isomorphism as a proof is a program, the formula
it proves is a type for the program (as Wikipedia states it), we can
see the connection.
On Tue, Jun 8, 2010 at 8:08 AM, Don Stewart d...@galois.com wrote:
(... There have been a few cases of major API / rewrites to famous old
packages causing problems, including:
* QuickCheck 1 vs 2
* parsec 2 vs 3
* OpenGL
...)
(... * No additional breakages are introduced.
On Tuesday 08 June 2010, Heinrich Apfelmus wrote:
Michael Schuerig wrote:
I was dumbfounded, although I have known all this. I have no
personal experience with either embedded or real time software,
but I've been aware that C still is the most popular language for
that purpose and that
Or you just put an upper bound on the versions of the fgl library that your
program will build against, as you should be doing anyway, and then nothing
breaks.
Cheers,
Greg
On Jun 8, 2010, at 11:08 AM, Gene A wrote:
On Tue, Jun 8, 2010 at 8:08 AM, Don Stewart d...@galois.com wrote:
On Tuesday 08 June 2010 20:21:54, Gregory Crosswhite wrote:
Or you just put an upper bound on the versions of the fgl library that
your program will build against, as you should be doing anyway, and then
nothing breaks.
Cheers,
Greg
Right. At least, nothing breaks until the next compiler
That's interesting, writing a DSL that compiles to C. I've actually
inerviewed Gerard Holzamann twice, the first time when he received the
ACM Software System Award in 2002 [1] and in 2008 after he moved to JPL
[2]. What they use to test distributed software is the Process Meta
Language (Promela)
Sorry for reopening an old thread, but I thought I'd counter some of the
negative feedback :)
I think this proposal is a great idea!
It seems like this would make working with MPTCs much easier.
When programming, I generally want to only specify the minimum amount of
information to make my code
On Tuesday 08 June 2010, Hans van Thiel wrote:
Now, what Gerard Holzmann told me in the interview, is that NASA is
very conservative in it's use of software tools. They don't use C++,
just C, and a well defined version of the GNU C compiler at that.
The coding standards, which even prohibit
Thanks Claus,
Your condensed summary was my understanding, but if I try to issue
Cabal install --reinstall cmu
It works every time from a MSYS shell, but with Cygwin I get
Linking dist\build\cmu\cmu.exe ...
C:\Program Files\Haskell Platform\2010.1.0.0\lib\..\mingw\bin\windres:
can't
Your condensed summary was my understanding, but if I try to issue
Cabal install --reinstall cmu
It works every time from a MSYS shell, but with Cygwin I get
If MSYS works for you, why not stick with it?-)
Cygwin with MinGW tools should work, but it is very easy to mess up
with this setup
with Cygwin I get
Linking dist\build\cmu\cmu.exe ...
C:\Program Files\Haskell Platform\2010.1.0.0\lib\..\mingw\bin
\windres:
can't open temporary file `\/cca04932.irc': No such file or directory
This sounds very much like a temporary-filename issue. The reported
filename's lack of a
Louis Wasserman wasserman.louis at gmail.com writes:
While working on the Shootout, I noticed the following benchmarks:
http://shootout.alioth.debian.org/u64/program.php?test=chameneosreduxlang=ghcid=3
http://shootout.alioth.debian.org/u64q/program.php?test=chameneosreduxlang=ghcid=3
[...]
Ian Lynagh ig...@earth.li writes:
On Mon, Jun 07, 2010 at 11:50:44AM -0700, Donald Bruce Stewart wrote:
A complete rewrite with a new maintainer: fgl-awesome
In 10 years time, we don't want to have
fgl
fgl-awesome
fgl-great
fgl-joe
which all do the same thing, and have
Gene A yumag...@gmail.com writes:
Oh lord yes... just call it fgl3 and leave the fgl package alone.
This is a source based community here... so you take a package that
has a dependency on another library and you go out and get that to
cover the dependency and the API is not the same!!! AND
C K Kashyap ckkash...@gmail.com writes:
Hi,
I have a call grah which contains information of the edges in the following
format
caller callee count (time spent by the
caller)
===
foo bar 10100
xxx yyy 2010
zzz
Don Stewart d...@galois.com writes:
Yes, my intent here is to produce a set of guidelines for maintainers of
important packages, that ensures we balance stability with innovation.
We have a great document for what to consider when adding packages to
the HP, for example:
Sorry, I hit Reply instead of Reply To All.
-- Forwarded message --
From: Jake McArthur jake.mcart...@gmail.com
Date: Tue, Jun 8, 2010 at 6:16 PM
Subject: Re: [Haskell-cafe] Rewriting a famous library and using the
same name: pros and cons
To: Don Stewart d...@galois.com
Making
On Tue, Jun 8, 2010 at 4:13 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Don Stewart d...@galois.com writes:
Yes, my intent here is to produce a set of guidelines for maintainers of
important packages, that ensures we balance stability with innovation.
We have a great
Jason Dagit da...@codersbase.com writes:
On Tue, Jun 8, 2010 at 4:13 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
As part of this, we should consider if we want an official process to do
what I've done to kick-off this whole discussion: have a way of telling
users Oj! New
I don't really see this listed on your list, but maybe I missed it.
Happstack has been affected by QuickCheck 1 - QuickCheck 2, parsec 2
- 3, and HaXml 1.13 - 1.20.
Those packages are common, and people often want to use happstack with
other libraries that also use those packages. The problem is
I am also experiencing this problem.
I read that the problem was fixed in the latest Cabal-install version.
But I'm not sure, as I tried to install the latest Cabal-install and
got 50 linker errors which I'm not prepared to tackle until the
weekend.
On 8 June 2010 18:21, Gordon J. Uszkay
Hello,
when compiling unix-compat I get this:
4 of 4] Compiling System.PosixCompat.Extensions (
dist/build/System/PosixCompat/Extensions.hs,
dist/build/System/PosixCompat/Extensions.o )
cbits/HsUnixCompat.c: In function `unix_major':
cbits/HsUnixCompat.c:4:0:
warning: implicit
Jeremy Shaw jer...@n-heptane.com writes:
I don't really see this listed on your list, but maybe I missed it.
Happstack has been affected by QuickCheck 1 - QuickCheck 2, parsec 2
- 3, and HaXml 1.13 - 1.20.
Those packages are common, and people often want to use happstack with
other
On Tue, Jun 8, 2010 at 7:06 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
I recall having a discussion with either you or someone else from the
happstack team about why it isn't applicable there, but the QuickCheck
problem can be solved in the general case by having its dependency
Jeremy Shaw jer...@n-heptane.com writes:
On Tue, Jun 8, 2010 at 7:06 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
I recall having a discussion with either you or someone else from the
happstack team about why it isn't applicable there, but the QuickCheck
problem can be solved
From: Stephen Tetley stephen.tet...@gmail.com
Hello all
While new libraries develop at pace, their documentation rarely does;
so I'd have to disagree with John's claim that re-naming libraries
makes development by new users harder. I'd argue that having tutorials
not work for later
On Tue, Jun 8, 2010 at 6:28 PM, John Lato jwl...@gmail.com wrote:
From: Stephen Tetley stephen.tet...@gmail.com
Hello all
While new libraries develop at pace, their documentation rarely does;
so I'd have to disagree with John's claim that re-naming libraries
makes development by new
Ryan Newton wrote:
What I would next *like* to do is something like the following:
import qualified Data.IntMap as DI
instance FitInWord t = GMapKey t where
data GMap t v = GMapInt (DI.IntMap v) deriving Show
The problem is that there's already a more general instance of
On 9 June 2010 12:11, Jason Dagit da...@codersbase.com wrote:
Or write translator tools for upgrading to the new API :) Pipe dream?
Maybe.
Too an extent, yes: the types are more generalised so it's going to be
difficult to do automatic translations.
However, Thomas has demonstrated that you
1 - 100 of 103 matches
Mail list logo
