If I understand correctly, the problem with datatype contexts is that if we
have e.g.
data Eq a => Foo a = Foo a
the constraint Eq a is thrown away after a Foo is constructed, and any
method using Foos must repeat Eq a in its type signature.
Why were these contexts removed from the language, ins
Kim-Ee Yeoh atamo.com> writes:
> data Foo a where
> Foo :: Eq a => a -> Foo a
>
> is equivalent to
>
> data Foo a = Eq a => Foo a
>
> but is different from
>
> data Eq a => Foo a = Foo a
... and nothing in GADTs does what one would naively expect the last
declaration to do.
_
Brandon Allbery gmail.com> writes:
> As I understand it, it's because fixing them involves passing around a
dictionary along with the data, and you can't do that with a standard
declaration (it amounts to an extra chunk of data that's only *sometimes*
wanted, and that "sometimes" complicates thin
Dan Doel gmail.com> writes:
> However, another thing to consider is that getting rid of data type
contexts was accepted into the language standard.
... which means that implementers should be free to "fix" data type contexts
however they like, as they are now complier extensions which won't conf
Hans Georg Schaathun schaathun.net> writes:
> Does anyone have experience with integrating Haskell and Java?
> I have done some searching, finding a lot of pointers but hardly
> anything in terms of evaluation, successes, or caveats.
>
> From what I see Frege looks promising, arguably not hask
Mark Lentczner gmail.com> writes:
> Some of the release candidates for Haskell Platform 2013.2 are up.These
are what I expect to simply "re-brand" as the release, unless anyone
uncovers some issues.
Will they go on
http://trac.haskell.org/haskell-platform/wiki/ReleaseCandidates?
(http://trac.has
Niklas Hambüchen nh2.me> writes:
> Reading the other thread (Adding Applicative/Functor instances to all
> Monads in GHC) I was wondering if there was infrastructure for testing
> what effect making the often-discussed Functor/Monad change would have:
> How many packages on hackage would break et
Good to see it released! Was there a deliberate decision not to build a
Windows x64 platform, or is it just that there wasn't anyone to do it?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Edward Kmett gmail.com> writes:
> * Haskell Qt Binding Generator by Zhengliang Feng, mentored by Carter
Schonwald with help from Ian-Woo Kim
Interesting, as this has been done at least twice before. Is there a public
write-up of what's going to be different this time?
_
On Tue, 26 Mar 2013 08:58:18 +0100, Eric Wong wrote:
> The best way to do this, is to download from
>https://github.com/atzedijkstra/wxHaskell
> . (This is the most up to date repository online.) Then replace the
> wxcore\Setup.hs file with the one attached to this e-mail (this has not
>
Edward Kmett gmail.com> writes:
> There should be a link from the google-melange website, but one slight
shift in focus is on either getting SWIG bindings or possibly even using
Ian-Woo Kim's C++FFI tools. Carter may be able to go into more detail.
There's almost no information in the google pro
Jeff,
I don't think your code works in general, since it is not guaranteed that
x' == mzero is allowed unless (m b) is an instance of Eq. I'm unsure if you
are able to test for mzero in general.
Harry
On Mon, Mar 26, 2012 at 3:11 PM, Jeff Shaw wrote:
>
> can :: (Mona
This is more of an algorithm question than a language question, but any
insights would be much appreciated.
The problem is to input a series of programs and find previous
occurrences of the same algorithm.
The programs consist of a set of input parameters (a, b, c, ...), and a
set of side-ef
13 matches
Mail list logo
