It's deliberate.
As the user manual says
(http://www.haskell.org/ghc/docs/latest/html/users_guide/flag-reference.html#id3101511),
FlexibleInstances implies TypeSynonymInstances.
See Trac http://hackage.haskell.org/trac/ghc/ticket/4841
I'll clarify the docs a bit.
Simon
| -Original
Thank you for your response.
If I execute ghc-pkg list gtk I receive this output:
ghc-pkg list gtk
/usr/local/Cellar/ghc/7.0.4/lib/ghc-7.0.4/package.conf.d
/Users/tanjapiechnick/.ghc/i386-darwin-7.0.4/package.conf.d
But ghc-pkg check gives me no results
ghc-pkg check
Is this the issue?
Hello cafe,
I would like to announce two parallel libraries from Japan.
- Paraiso (http://hackage.haskell.org/package/Paraiso)
The purpose of this library is to design a high-level language for
implementing explicit partial-differential equations solvers on
supercomputers as well as
On 7 June 2012 16:26, Simon Peyton-Jones simo...@microsoft.com wrote:
It's deliberate.
As the user manual says
(http://www.haskell.org/ghc/docs/latest/html/users_guide/flag-reference.html#id3101511),
FlexibleInstances implies TypeSynonymInstances.
See Trac
On 7 June 2012 18:09, Tanja Piechnick tanja.piechn...@stud.uni-due.de wrote:
Thank you for your response.
If I execute ghc-pkg list gtk I receive this output:
ghc-pkg list gtk
/usr/local/Cellar/ghc/7.0.4/lib/ghc-7.0.4/package.conf.d
Hi Cafe!
I know, this topic comes back on the list from time to time. I know, there
probably isn't anything new since the last time it was asked here, on
reddit or on SO.
However, I remember seeing that iPwn Studios were thinking about getting
GHC to build applications for android, in addition to
Hi cafe!
The ConstraintKinds extension makes it possible to create classes of classes,
like this:
class F c where cfmap :: c f = (a - b) - f a - f b
instance F Functor where cfmap = fmap
instance F Monad where cfmap = liftM
So, basically we are saying that c is a class that has some special
All right.
After a re-installation I could load my GTK2HS example successfully.
But I received another error. What is the meaning of that?
A wrong architecture?
Prelude :l guitest.hs
[1 of 1] Compiling Main ( guitest.hs, interpreted )
Ok, modules loaded: Main.
*Main main
Loading
Tanja Piechnick wrote:
All right.
After a re-installation I could load my GTK2HS example successfully.
But I received another error. What is the meaning of that?
A wrong architecture?
Prelude :l guitest.hs
[1 of 1] Compiling Main ( guitest.hs, interpreted )
Ok, modules loaded:
Hi,
I have a short question on using Data.Bitmap.
I have imported an image using STB-image.
img - loadImage filename
Now I get img which is a Bitmap data structure. How do I access individual
pixels?
Thank you in advance,
Anders
___
Haskell-Cafe
On Thu, Jun 7, 2012 at 8:40 AM, Heinrich Apfelmus apfel...@quantentunnel.de
wrote:
Tanja Piechnick wrote:
Loading package glib-0.12.3.1 ... can't load .so/.DLL for: intl
(dlopen(/usr/local/Cellar/**gettext/0.18.1.1/lib/libintl.**dylibhttp://0.18.1.1/lib/libintl.dylib,
9): no suitable image
There is module with a set of unsafeFoo functions here:
http://hackage.haskell.org/packages/archive/bitmap/0.0.2/doc/html/Data-Bitmap-Pure-Pixels.html
I guess you can use them, but I haven't personally used it.
I have, with great success, used different package: JuicyPixels (here:
Oh, yeah. Thanks, Sjoerd.
I wonder if there's some way not to require Monad. Some sort of
ApplicativeFix instead. Hm.
-- Conal
On Wed, Jun 6, 2012 at 2:43 PM, Sjoerd Visscher sjo...@w3future.com wrote:
If there would be a package where this could be in it would be
contravariant[1], but it
Hello all,
I've just released stylish-haskell 0.2 [1]. This release adds a
flexible configuration file, which already provides some options for
the different processing steps, and it will also make future
enhancements easy. You can use a per-project configuration file, as
documented in the README
Excellent, I'll check these new features work in haskell-mode when I get home.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, Jun 7, 2012 at 1:42 PM, Miguel Mitrofanov miguelim...@yandex.ru wrote:
Hi cafe!
The ConstraintKinds extension makes it possible to create classes of classes,
like this:
class F c where cfmap :: c f = (a - b) - f a - f b
instance F Functor where cfmap = fmap
instance F Monad where
Thats almost certainly what happened.
(and that HP detail even had an unfortunate effect of having the
machomebrew install defaults for ghc haskell-platform default to 32bit
rather than 64bit for a while, though that was recently corrected)
On Thu, Jun 7, 2012 at 9:05 AM, Brandon Allbery
On 7 Jun 2012, at 20:55, Gábor Lehel wrote:
If I'm understanding you correctly, this is similar to something I
recently filed as a feature request:
http://hackage.haskell.org/trac/ghc/ticket/5927
Yes, that seems to be it. Now I know I'm not alone.
In the meantime it's possible to
Hi, i've been using DataKinds for a while and there seems to be a
recurring annoyance that could be possibly eliminated with a language
extension. It goes something like this:
data Tuple (l :: [*]) where
Unit :: Tuple '[]
Comma :: a - Tuple as - Tuple (a ': as)
data Proxy k = Proxy
class
Hi,
This has been discussed before:
http://haskell.1045720.n5.nabble.com/Data-Kinds-and-superfluous-in-my-opinion-constraints-contexts-td5689436.html
Feel free to open a feature request for this. I think it's something we
should consider
addressing, but at the moment it's not immediately clear
2012/6/7 Krzysztof Skrzętnicki gte...@gmail.com
There is module with a set of unsafeFoo functions here:
http://hackage.haskell.org/packages/archive/bitmap/0.0.2/doc/html/Data-Bitmap-Pure-Pixels.html
Thank you. I must have missed it on my Google tour de force. Works like a
charm.
I guess you
The doc page
http://www.haskell.org/ghc/docs/7.4.1/html/users_guide/kind-polymorphism-and-promotion.html#promotionshow
that lists are now usable as types.
So I'm trying to make a type level function to test if a type list contains
a type. Unless I'm wrong, that calls to the use of a type family.
On Jun 7, 2012, at 5:21 PM, Conal Elliott wrote:
Oh, yeah. Thanks, Sjoerd.
I wonder if there's some way not to require Monad. Some sort of
ApplicativeFix instead. Hm.
Something like this:
instance (Contravariant p, ApplicativeFix f) = Applicative (Q' p f) where
pure a = Q' (pure (pure
Hi,
After trying the whole afternoon to make a program work using ST and
mutable vectors, I must give up and ask for some help.
I have a pure function which generates a list of moves. But the whole
thing should live in the ST monad, so:
genMoves ... = runST $ do ...
Now, as I understand,
Hi,
Data.ByteString.Char8.getContents fails for files 2GB on OS X. Is
there a fix for this?
$ cat getContents.hs
main = getContents
$ ./getContents smallFile
$ ./getContents bigFile
getContents: stdin: hGetBuf: invalid argument (Invalid argument)
$ ghc --version
The Glorious Glasgow Haskell
Yves Parès yves.pares at gmail.com writes:
The doc page http://www.haskell.org/ghc/docs/7.4.1/html/users_guide/kind-
polymorphism-and-promotion.html#promotion show that lists are now usable as
types.So I'm trying to make a type level function to test if a type list
contains a type. Unless
Hi Cafe,
I'm working on inspecting some data that I'm trying to represent as records
in Haskell and seeing about twice the memory footprint than I was
expecting. I've got roughly 1.4 million records in a CSV file (400M on
disk) that I parse in using bytestring-csv. bytestring-csv returns a
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Now comes my question: in the impure values there is always that
s. I was thinking that the whole structure should have s as a
parameter:
Yes
data MList s = MList { mlVec :: MVector s Move, mlNextPh :: MList
-
ST s (Maybe (MList s)) }
you
If you want to get rid of the overlap in your type families, you have
to add an extra argument indicating if the two types are equal. For
this, you need a type family to indicate equality of types. Sadly, the
naive implementation (TEQ x x = True, TEQ x y = False) overlaps and
isn't allowed. I'm
29 matches
Mail list logo
