Also, maybe the lifting operation could be
plift :: (PMonad m) = m s1 s2 a - t m s1 s2 s s a
where s1 and s2 are passed to the underlying type constructor. That
way, the kind of m would be
* - * - * - *
and the kind of t would be
(* - * - * - *) - * - * - * - * - * - *
so we see how if we
Hello Henry,
Changes to GHC regarding the treatment of higher-rank types required a few
changes to that test too. You have to eta-expand the application of mkTT and
give it a type signature. Therefore, main becomes
print $ gzip (\x y - mkTT maxS x y) genCom1 genCom2
and you have to add the
Peter Verswyvelen wrote:
I'm having trouble understanding the explanation of the meaning of the
signature of runST at
http://en.wikibooks.org/wiki/Haskell/Existentially_quantified_types
I could try to read the article a couple of times again, but are there any
other good readings about
The result of the fact that I needed to use a support
vector machine and didn't want to leave haskell land.
LibSVM is a support vector machine library written in C++
with an exposed C interface.
More information about LibSVM can be found at:
http://www.csie.ntu.edu.tw/~cjlin/libsvm/
This is my
Well, I think a type system like Clean's that had linear/uniqueness
types could fix the issue by actually checking that the state is
single-threaded (and thus stop you from applying it to a forking
monad). But there's a fundamental operational problem that ST makes
destructive updates, so to
Heinrich Apfelmus wrote:
Alberto Ruiz wrote:
How about using random doubles?
randomPerm xs = fmap (map snd . sort . flip zip xs) rs
where rs = fmap (randoms . mkStdGen) randomIO :: IO [Double]
Interesting idea. The chance of duplicates should be negligible now, but
that's because we're
Hi all,
If you've noticed the lack of a HWN this week, that's because I've
been doggedly finishing my article entitled 'The Typeclassopedia',
which I have just submitted for publication in the Monad.Reader.
Here's the abstract:
The standard Haskell libraries feature a number of type classes
Michael D. Adams mdmko...@gmail.com writes:
A bit hurray for strong typing!
Don't forget Algebraic Data Types. Those seem to also avoid many of
the sorts of errors that you would see in OO or struct-based (i.e. C)
programming.
I think the combination of algebraic data types and strong
Hi Stephan,
it seems you beat me ;-)
I've been working on the same thing as well.
You'll find my effort at http://bitbucket.org/pao/hsvm/.
What is missing is:
- the final bindings to complete the API
- haddock documentation
- cabal setup
Unfortunately the commit log are in italian (I didn't
Paul Johnson p...@cogito.org.uk writes:
See http://okmij.org/ftp/Haskell/perfect-shuffle.txt
I should have read that first time round!
--
Jón Fairbairn jon.fairba...@cl.cam.ac.uk
http://www.chaos.org.uk/~jf/Stuff-I-dont-want.html (updated 2009-01-31)
Maurício briqueabra...@yahoo.com writes:
Hi,
I've checked this 'BitC' language (www.bitc-lang.org). It
uses some ideas we see in Haskell, although with different
realization, and target mainly reliable low level code,
like micro-kernels (although I think it could be used
anywhere C is
Hi Brent,
I want to congratulate you on your article! An excellent piece of work
which should be compulsory reading for all serious haskell
programmers :)
My one suggestion would be that you expand on some of the examples;
for example, in the monoid section, you refer to various cool
Brent Yorgey wrote:
My hope is that this will be a valuable resource to the Haskell
community, especially those who are learning. Any feedback would be
greatly appreciated, especially if it helps improve the article before
publication. A draft can be found here:
http://www.ats-lang.org/
2009/2/16 Jon Fairbairn jon.fairba...@cl.cam.ac.uk
Maurício briqueabra...@yahoo.com writes:
Hi,
I've checked this 'BitC' language (www.bitc-lang.org). It
uses some ideas we see in Haskell, although with different
realization, and target mainly reliable low
Wonderful, thank you!
On Mon, Feb 16, 2009 at 4:29 AM, Brent Yorgey byor...@seas.upenn.edu wrote:
Hi all,
If you've noticed the lack of a HWN this week, that's because I've
been doggedly finishing my article entitled 'The Typeclassopedia',
which I have just submitted for publication in the
L.S.,
I have updated wxFruit to compile with GHC 6.10.1, but when I compil using
the commands:
runhaskell Setup configurerunhaskell Setup buildrunhaskell
Setup install
and run paddle.exe, I get the message:
paddle: loop
If I compile with:
ghc --make paddle
, the game starts
Hi Henk-Jan,
I believe cabal adds a -O on the command line, perhaps try ghc --make
-O (after deleting all object files)
Thanks
Neil
On Mon, Feb 16, 2009 at 12:04 PM, Henk-Jan van Tuyl hjgt...@chello.nl wrote:
L.S.,
I have updated wxFruit to compile with GHC 6.10.1, but when I compil using
Am Sonntag, 15. Februar 2009 23:00 schrieb Peter Verswyvelen:
But if I understand it correctly, dependent types are a bit like that,
values and types can inter-operate somehow?
With dependent types, parameters of types can be values. So you can define a
data type List which is parameterized by
Dear Haskellers,
I'm pleased to announce the release of Yogurt-0.3!
This version improves over 0.2 in several ways:
* It compiles and runs with GHC 6.10.
* The Mud monad is now built on top of IO.
* Vars are expressed as IORefs. No more unsafeCoerce needed.
* Forking of threads is supported,
Am Sonntag, 15. Februar 2009 17:50 schrieb Peter Verswyvelen:
I'm having trouble understanding the explanation of the meaning of the
signature of runST
Were you just reading the documentation of Grapefruit’s era parameters or why
are you studying ST? ;-)
Best wishes,
Wolfgang
Neil Mitchell wrote:
Hi
However the createProcess command structure has the close_fds flag,
which seems like it should override that behaviour, and therefore this
seems like a bug in createProcess.
close_fds :: Bool
Close all file descriptors except stdin, stdout and stderr
[redirecting to haskell-cafe]
Am Samstag, 14. Februar 2009 23:13 schrieben Sie:
Great, does it run well on Windows and Mac platforms in addition to Linux
platform which should run fine?
Actually, I have no idea. ;-)
Well, Grapefruit is a pure Haskell library without any own binding to C
[redirecting to haskell-cafe]
Am Sonntag, 15. Februar 2009 00:25 schrieben Sie:
Hi Wolfgang,
I was wondering if I can use FLTK as GUI backend for Grapefruit?
This should be possible in principal. It just could be that my assumptions
about how widgets are created and composed were too tight
[redirecting to haskell-cafe]
Am Sonntag, 15. Februar 2009 00:26 schrieben Sie:
One more thing, would Grapefruit work with files created by Glade (UI
builder)?
No, it won’t, I’m afraid. There is, for example, the principal problem that
Glade is GTK+-specific (as far as I know) while
Brent Yorgey wrote:
If you've noticed the lack of a HWN this week, that's because I've
been doggedly finishing my article entitled 'The Typeclassopedia',
which I have just submitted for publication in the Monad.Reader.
My hope is that this will be a valuable resource to the Haskell
Aha! Wolfgang is a man who knows his own code :)
Yes, I've seen this a couple of times but when I saw it again in Grapefruit,
I wanted to know how this usage of existentials worked, since I'm sooo
curious to find out how you managed to use the type system for solving some
of the typical FRP
Am Sonntag, 15. Februar 2009 16:27 schrieben Sie:
Hi Wolfgang,
Thank you for the excellent introduction
Oh, I thought that you didn’t send you original question to the list and
therefore answered you only privately. So the others don’t know yet the
introduction you refer to (but see below).
On Mon, Feb 16, 2009 at 2:30 AM, wren ng thornton w...@freegeek.org wrote:
Louis Wasserman wrote:
I follow. The primary issue, I'm sort of wildly inferring, is that use of
STT -- despite being pretty much a State monad on the inside -- allows
access to things like mutable references?
Am Samstag, 14. Februar 2009 23:37 schrieb Roman Cheplyaka:
* Wolfgang Jeltsch g9ks1...@acme.softbase.org [2009-02-14 17:19:09+0100]
Dear friends of Haskell and Functional Reactive Programming,
its my pleasure to announce the first official release of Grapefruit, a
library for Functional
However the createProcess command structure has the close_fds flag,
which seems like it should override that behaviour, and therefore this
seems like a bug in createProcess.
close_fds :: Bool
Close all file descriptors except stdin, stdout and stderr in
the new process
Am Montag, 16. Februar 2009 13:07 schrieb Neil Mitchell:
Hi Henk-Jan,
I believe cabal adds a -O on the command line, perhaps try ghc --make
-O (after deleting all object files)
If it’s the -O option what causes the loop then it is problably because of
this:
2009/2/16 Josef Svenningsson josef.svennings...@gmail.com:
On Mon, Feb 16, 2009 at 2:30 AM, wren ng thornton w...@freegeek.org wrote:
Louis Wasserman wrote:
I follow. The primary issue, I'm sort of wildly inferring, is that use of
STT -- despite being pretty much a State monad on the inside
Am Montag, 16. Februar 2009 14:21 schrieben Sie:
Aha! Wolfgang is a man who knows his own code :)
Yes, I've seen this a couple of times but when I saw it again in
Grapefruit, I wanted to know how this usage of existentials worked, since
I'm sooo curious to find out how you managed to use the
Wolfgang == Wolfgang Jeltsch g9ks1...@acme.softbase.org writes:
Wolfgang This would be really great. Writing applications with
Wolfgang Grapefruit gives me useful feedback and pressure for
Wolfgang improvement. Note that currently the set of supported
Wolfgang widgets is very low
On Mon, 16 Feb 2009, Wolfgang Jeltsch wrote:
[redirecting to haskell-cafe]
Am Samstag, 14. Februar 2009 23:13 schrieben Sie:
Great, does it run well on Windows and Mac platforms in addition to Linux
platform which should run fine?
Actually, I have no idea. ;-)
Well, Grapefruit is a pure
What was that stripped-down low-level version of C I saw coming out of ...
was it Microsoft Research? C-- or something. Unfortunately, the name
appears to be immune to Googling.
2009/2/16 Alberto G. Corona agocor...@gmail.com
http://www.ats-lang.org/
2009/2/16 Jon Fairbairn
On Mon, 16 Feb 2009, Wolfgang Jeltsch wrote:
[redirecting to haskell-cafe]
Am Sonntag, 15. Februar 2009 00:25 schrieben Sie:
Hi Wolfgang,
I was wondering if I can use FLTK as GUI backend for Grapefruit?
This should be possible in principal. It just could be that my assumptions
about how
Google doesn't hear you ? Yell louder !
http://www.cminusminus.org/
2009/2/16 Fraser Wilson blancoli...@gmail.com:
What was that stripped-down low-level version of C I saw coming out of ...
was it Microsoft Research? C-- or something. Unfortunately, the name
appears to be immune to
Super! Also, best definition of bottom I've yet seen -- ignoring _|_,
which is a party pooper. Like good code, it's short, to the point, and
obviously correct.
Thanks for this. It's great to have it all in one place, and so
entertainingly presented.
cheers,
Fraser.
On Mon, Feb 16, 2009 at
On Mon, 16 Feb 2009, Wolfgang Jeltsch wrote:
[redirecting to haskell-cafe]
Am Sonntag, 15. Februar 2009 00:26 schrieben Sie:
One more thing, would Grapefruit work with files created by Glade (UI
builder)?
No, it won’t, I’m afraid. There is, for example, the principal problem that
Glade is
Am Montag, 16. Februar 2009 10:29 schrieb Brent Yorgey:
Hi all,
If you've noticed the lack of a HWN this week, that's because I've
been doggedly finishing my article entitled 'The Typeclassopedia',
which I have just submitted for publication in the Monad.Reader.
Good decision (not in any way
Am Montag, 16. Februar 2009 15:13 schrieben Sie:
So I have an application that I am developing. The UI module includes
the following:
import Graphics.UI.Gtk
import Graphics.Rendering.Cairo
import Graphics.Rendering.Cairo.SVG
import Graphics.UI.Gtk.Gdk.EventM
Can you tell from that list if
Positively brilliant. What else can be said? Time for Brent to sign a
Haskell recipes deal with O'Reilly (or whatever the next normal book
should be).
On Mon, Feb 16, 2009 at 4:29 AM, Brent Yorgey byor...@seas.upenn.eduwrote:
Hi all,
If you've noticed the lack of a HWN this week, that's
Wolfgang == Wolfgang Jeltsch g9ks1...@acme.softbase.org writes:
Hello Wolfgang,
congratulation for your Grapefruit release!
Wolfgang This would be really great. Writing applications with
Wolfgang Grapefruit gives me useful feedback and pressure for
Wolfgang improvement. Note that currently the
2009/2/16 Gour g...@mail.inet.hr
Do you anticipate that Grapefruit will be capable for writing real-world
GUI
apps quit soon?
LOL. Funny typo. If the apps quit soon we're in trouble! :-)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I would actually quite like to integrate Hieroglyph with Grapefruit,
which would give you your Cairo support and give me a sensible way to
implement events outside of my really rather broken model.
On Mon, Feb 16, 2009 at 10:04 AM, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
Am Montag,
Peter == Peter Verswyvelen bugf...@gmail.com writes:
Peter 2009/2/16 Gour g...@mail.inet.hr
Do you anticipate that Grapefruit will be capable for writing
real-world GUI apps quit soon?
Peter LOL. Funny typo. If the apps quit soon we're in trouble!
Peter :-)
Nay - it just
Overnight I had the following thought, which I think could work rather
well. The most basic implementation of the idea is as follows:
class MonadST s m | m - s where
liftST :: ST s a - m a
instance MonadST s (ST s) where ...
instance MonadST s m = MonadST ...
newtype FooT m e = FooT (StateT
I don't think this can be right, because the m - s dependency will
contradict the universal quantification of s required by runST. In other
words, unwrapping the transformers will leave you with an ST computation
for a specific s, which runST will reject.
From:
Peter == Peter Verswyvelen bugf...@gmail.com writes:
Peter LOL. Funny typo. If the apps quit soon we're in trouble! :-)
Well, let's do some LOL-ing on my own account...
Sincerely,
Gour
--
Gour | Zagreb, Croatia | GPG key: C6E7162D
But the m - s dependency will have been removed by the time runST gets a
hold of it! It works, I just tested it.
*Control.Monad.Array.ArrayM :t runST (runArrayT 5 Nothing getContents)
runST (runArrayT 5 Nothing getContents) :: [Maybe a]
*Control.Monad.Array.ArrayM runST (runArrayT 5 Nothing
I apologize, I did not mean to be rude at all, I found it a great typo to
summarize the previous attempts for doing fully functional GUIs in Haskell.
2009/2/16 Gour g...@mail.inet.hr
Peter == Peter Verswyvelen bugf...@gmail.com writes:
Peter LOL. Funny typo. If the apps quit soon we're in
Oh, I see, every derived monad has to have an 's' in its type somewhere.
From: Louis Wasserman [mailto:wasserman.lo...@gmail.com]
Sent: 16 February 2009 16:17
To: Sittampalam, Ganesh
Cc: Dan Doel; Henning Thielemann; haskell-cafe@haskell.org
Subject: Re:
On Mon, Feb 16, 2009 at 11:53 AM, Daniel Fischer
daniel.is.fisc...@web.de wrote:
Hah, seems I'm the first to point out a flaw in it:
Bottom of page 13:
Also, note that although _ m = m would be a type-correct implementation
of (), it
The remainder of the sentence is missing.
Sorry, I've
On Sat, Feb 14, 2009 at 2:43 AM, Felipe Lessa felipe.le...@gmail.com wrote:
Hello!
There was a new HaskellDB release, but I didn't see any announcement
here. Is it back alive? What happened to 0.11?
0.11 existed in the repository but was never uploaded to Hackage. I
updated the HDBC backends
Am Montag, 16. Februar 2009 16:43 schrieb Peter Verswyvelen:
2009/2/16 Gour g...@mail.inet.hr
Do you anticipate that Grapefruit will be capable for writing real-world
GUI apps quit soon?
LOL. Funny typo. If the apps quit soon we're in trouble! :-)
I’m sure that current Grapefruit
You didn't notice setHandlers?
-- | Set the 'Logger'\'s list of handlers to the list supplied.
-- All existing handlers are removed first.
setHandlers :: LogHandler a = [a] - Logger - Logger
It is perfectly valid to set the root logger's handlers to [] if you
want it to do nothing
Am Montag, 16. Februar 2009 16:27 schrieb Gour:
Do you anticipate that Grapefruit will be capable for writing real-world
GUI apps quit soon?
I have no concrete anticipation. It depends very much on the community. If
there is notable interest and this interest makes people hacking on
I just posted stateful-mtl and pqueue-mtl 1.0.2, making use of the new
approach to single-threaded ST wrapping. I discovered while making the
modifications to both packages that the MonadSTTrans type class was
unnecessary, enabling a cleaner integration with mtl proper. I'm pretty
confident that
Am Montag, 16. Februar 2009 17:46 schrieb Wolfgang Jeltsch:
Am Montag, 16. Februar 2009 16:27 schrieb Gour:
Do you anticipate that Grapefruit will be capable for writing real-world
GUI apps quit soon?
I have no concrete anticipation. It depends very much on the community. If
there is
Am Montag, 16. Februar 2009 18:05 schrieb Fraser Wilson:
I'd love to hack on Grapefruit.
That’s great!
I'll do some study (and take a break from my own world-changing functional
GUI :-)
I tried to check out your repository at
http://thewhitelion.org/darcs/barrie/
but darcs get failed
Peter Verswyvelen-2 wrote:
I'm having trouble understanding the explanation of the meaning of the
signature of runST at
http://en.wikibooks.org/wiki/Haskell/Existentially_quantified_types
I could try to read the article a couple of times again, but are there any
other good readings
Yeah, I lack some darcs fu unfortunately. I understood it was just a
matter of copying a repository. I'll have a look, and by have a look
I mean bother #haskell :-)
Cheers,
Fraser
Sent from my iPhone
On 16 feb 2009, at 18:51, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
Am
Arch now has 926 Haskell packages in AUR.
That’s an increase of 27 new packages in the last 8 days, or 3.38 new
Haskell apps a day.
This weekly news includes:
* Noteworthy updates: grapefruit, haskelldb, gtk2hs
* A video on how to use Arch packages
* Updated releases by category
Am Montag, 16. Februar 2009 19:08 schrieben Sie:
Yeah, I lack some darcs fu unfortunately. I understood it was just a
matter of copying a repository. I'll have a look, and by have a look
I mean bother #haskell :-)
If you don’t use this lazy fetch feature (or whatever it is called) then you
Am Montag, 16. Februar 2009 19:04 schrieb Kim-Ee Yeoh:
Despite its rank-2 type, runST really doesn't have anything to do with
existential quantification.
First, I thought so too but I changed my mind. To my knowledge a type
(forall a. T[a]) - T' is equivalent to the type exists a. (T[a] - T').
Am Montag, 16. Februar 2009 19:22 schrieb Wolfgang Jeltsch:
Am Montag, 16. Februar 2009 19:04 schrieb Kim-Ee Yeoh:
Despite its rank-2 type, runST really doesn't have anything to do with
existential quantification.
First, I thought so too but I changed my mind. To my knowledge a type
Hello Haskellers,
I'm pleased to announce version 4.2.0 of Crypto has been uploaded to
Hackage that I am taking over maintenance of the library from
Dominic Steinitz. As of this release it should be cabal install'able
on GHC 6.10.1. I'm also pleased to announce that the darcs repo will
be
Since I'm congenitally lazy, and writing a GUI by hand in the IO monad is
... not what I expect from a beautiful program, and because what I often
need is a GUI that manipulates a state, and because I don't understand
arrows, and having been intrigued by a recent cafe thread, I threw together
a
Am Montag, 16. Februar 2009 19:27 schrieben Sie:
Ah. Copy, don't darcs get.
If you copy a repository which was itself fetched from somewhere using this
lazy patch fetching feature, you’ll probably experience problems too. If it’s
the repository you work in and you never fetched any patches
wchogg:
Hello Haskellers,
I'm pleased to announce version 4.2.0 of Crypto has been uploaded to
Hackage that I am taking over maintenance of the library from
Dominic Steinitz. As of this release it should be cabal install'able
on GHC 6.10.1. I'm also pleased to announce that the darcs
You must have missed the bit about congenitally lazy :-)
Username requested ...
cheers,
Fraser.
On Mon, Feb 16, 2009 at 8:10 PM, Lennart Augustsson
lenn...@augustsson.netwrote:
Put it on hackage!
2009/2/16 Fraser Wilson blancoli...@gmail.com:
Since I'm congenitally lazy, and writing a
Don't use the
data (context) = type = constructors
syntax, it doesn't do what you want.
All it does is add the context to the constructor B while not
providing it to any of the functions that use it.
A better solution is
data Bar a = forall b. Foo a b = B a b
or, equivalently, using GADT
Correct. And under the hood, GHC does implement runST in its
existential dual form using a hidden State# type.
I wonder however, if we're wandering too far away from the
OP's query about grokking runST and how the ST monad
works. I'd imagine that means he'd like to see how rank-2
polymorphism
Oh, cheers! Newtype deriving is more general than I expected. Thanks for
the comment.
I've requested a hackage account, so I expect it to be there shortly :-)
cheers,
Fraser.
On Mon, Feb 16, 2009 at 9:12 PM, Ryan Ingram ryani.s...@gmail.com wrote:
Tiny code-review comment:
data Style =
On Mon, 16 Feb 2009 14:56:01 +0100, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
Am Montag, 16. Februar 2009 13:07 schrieb Neil Mitchell:
Hi Henk-Jan,
I believe cabal adds a -O on the command line, perhaps try ghc --make
-O (after deleting all object files)
If it’s the -O option
C-- is kind of dead; it lives on in spirit as a data type used by the
back end of GHC, but there hasn't been much development in C-- as a
language proper in a while.
LLVM seems to be gaining momentum in that space; Lennart has been
posting some experiments with generating LLVM code in Haskell in
Louis Wasserman wasserman.lo...@gmail.com wrote in article
ab4284220902160801x51e6c3b6m3a7ee0698ac97...@mail.gmail.com in
gmane.comp.lang.haskell.cafe:
The point here is that a MonadST instance guarantees that the bottom monad
is an ST -- and therefore single-threaded of necessity -- and
On Monday 16 February 2009 8:44:21 am Josef Svenningsson wrote:
On Mon, Feb 16, 2009 at 2:30 AM, wren ng thornton w...@freegeek.org wrote:
Louis Wasserman wrote:
I follow. The primary issue, I'm sort of wildly inferring, is that use
of STT -- despite being pretty much a State monad on the
Dan Doel wrote:
Someone already mentioned using Dynamic as an alternate base (for
instance, use a Map of dynamics for underlying storage). Of course,
the implementation of Dynamic in GHC uses unsafeCoerce, just like ST,
so you may not count that.
However, using GADTs, you can implement
On Mon, 2009-02-16 at 20:30 +0100, Fraser Wilson wrote:
You must have missed the bit about congenitally lazy :-)
Username requested ...
See http://hackage.haskell.org/packages/accounts.html
All you need to do is email Ross and ask.
Duncan
___
On Mon, 2009-02-16 at 19:36 +0100, Wolfgang Jeltsch wrote:
Am Montag, 16. Februar 2009 19:22 schrieb Wolfgang Jeltsch:
Am Montag, 16. Februar 2009 19:04 schrieb Kim-Ee Yeoh:
Despite its rank-2 type, runST really doesn't have anything to do with
existential quantification.
First, I
Now that I re-read my email, it looks like I'm saying Username requested
in the sense of OK, Cafe people, treat this as a user name request and step
to it. What I meant was that I have requested a username (via the email),
and once I have an account I'll put it on hackage.
Sorry for the
On Sat, Feb 14, 2009 at 2:06 PM, Job Vranish jvran...@gmail.com wrote:
I'm pretty sure that the problem is decidable, at least with haskell
98 types (other type extensions may complicate things a bit). It ends
up being a graph unification algorithm. I've tried some simple
algorithms and they
Hi Fraser,
That's some great hacking you did :-)
What version of GTK2HS did you use? I get various compiler errors when using
the latest GTK2HS 0.10.0.
Cheers,
Peter
2009/2/16 Fraser Wilson blancoli...@gmail.com
Now that I re-read my email, it looks like I'm saying Username requested
in
On Mon, 2009-02-16 at 15:30 +0100, Fraser Wilson wrote:
Super! Also, best definition of bottom I've yet seen -- ignoring _|
_, which is a party pooper. Like good code, it's short, to the
point, and obviously correct.
This brings up something I've thought about: On page 8, it is said that
On Fri, 13 Feb 2009 11:09:35 +0100, Paolino paolo.verone...@gmail.com
wrote:
When I came to haskell, I arrived with a small and only evolutionary
background in programming. First monad I met was MonadState StdGen m.
Everything was in someway acceptable, I had no problem in
explicitating the
On 2009-02-14, Maurício briqueabra...@yahoo.com wrote:
The way you wrote CComplex a, is it possible to write
foreign import ccall somename somename
:: CComplex CDouble - IO CComplex CDouble
Ah, no, I'm afraid not, I misunderstood what you wanted. You do indeed
need to go through CPtr
Hi Peter,
Thanks!
I haven't tried to compile with 0.10.0 but I can guess that the errors
arise from the use of ListStore. I'm not sure what the best approach
is here. Is 0.9.13 over now? If so, then I'll upgrade and fix it.
For now it would certainly make sense to put the dependency into
Daniel Kraft wrote:
Do you think something would be
especially nice to have and is currently missing?
Have type class aliases been implemented yet? This proposal (or parts or
it) seems like a very useful compiler extension to have, and might be an
interesting GSoC project.
On Mon, Feb 16, 2009 at 12:48 PM, Creighton Hogg wch...@gmail.com wrote:
Hello Haskellers,
I'm pleased to announce version 4.2.0 of Crypto has been uploaded to
Hackage that I am taking over maintenance of the library from
Dominic Steinitz. As of this release it should be cabal install'able
On Mon, Feb 16, 2009 at 7:30 PM, Antoine Latter aslat...@gmail.com wrote:
On Mon, Feb 16, 2009 at 12:48 PM, Creighton Hogg wch...@gmail.com wrote:
Hello Haskellers,
I'm pleased to announce version 4.2.0 of Crypto has been uploaded to
Hackage that I am taking over maintenance of the library
Natural numbers under min don't form a monoid, only naturals under max do (so
you can have a zero element)
Brent Yorgey wrote:
Hi all,
If you've noticed the lack of a HWN this week, that's because I've
been doggedly finishing my article entitled 'The Typeclassopedia',
which I have just
I'm really confused that when I replied (not reply-to-all, not reply-to-list,
just reply) to that message, it went to the lists and not to you Brent!
(KMail 1.10.3) -- so I totally edited the To lines, to send this message...
Brent Yorgey wrote:
Hi all,
If you've noticed the lack of a HWN
Isaac Dupree wrote:
Natural numbers under min don't form a monoid, only naturals under max do (so
you can have a zero element)
Though, FWIW, you can use Nat+1 with the extra value standing for
Infinity as the identity of min (newtype Min = Maybe Nat).
I bring this up mainly because it can
On Mon, Feb 16, 2009 at 8:13 PM, wren ng thornton w...@freegeek.org wrote:
Isaac Dupree wrote:
Natural numbers under min don't form a monoid, only naturals under max do
(so you can have a zero element)
Though, FWIW, you can use Nat+1 with the extra value standing for Infinity
as the
Hello All,
The kind people at #haskell suggested I come to haskell-cafe for
questions about haskell performance issues.
I'm new to haskell, and I'm having a hard time understanding how to
deal with memory leaks.
I've been playing with some network server examples and I noticed with
each new
inbuninbu:
Hello All,
The kind people at #haskell suggested I come to haskell-cafe for
questions about haskell performance issues.
I'm new to haskell, and I'm having a hard time understanding how to
deal with memory leaks.
I've been playing with some network server examples and I noticed
On 17/02/2009, at 3:56 PM, Jeff Douglas wrote:
Hello All,
The kind people at #haskell suggested I come to haskell-cafe for
questions about haskell performance issues.
I'm new to haskell, and I'm having a hard time understanding how to
deal with memory leaks.
I've been playing with some
Thanks Guys,
Not only did I not run optimizations, I misread the profile. It looks
like it was an imaginary problem from the beginning. I guess I should
go through all the profiling documentation more carefully.
Jeff
On Tue, Feb 17, 2009 at 2:46 PM, Bernie Pope bj...@csse.unimelb.edu.au wrote:
1 - 100 of 101 matches
Mail list logo
