bf3:
For me, a good reason why one should look at Haskell is because you
should NOT look at Haskell since it will change your view on programming
so much, you don't want to go back... ;-)
But where is the great IDE Haskell deserves??? :-) Seriously, 99% of the
programmers I know don't
The earlier message showed how to implement a typechecker from untyped
AST to wrapped typed terms. The complete code can be found at
http://okmij.org/ftp//Haskell/staged/TypecheckedDSL.hs
The typechecker has the type
typecheck :: Gamma - Exp - Either String TypedTerm
where
Ouch, now I really feel stupid, because I *knew* about the stricter
foldl' version.
But great to know about the new strictness on vars! I really should get
GHC 6.8 RC1 for Windows...
I just got puzzled why mysum worked better than sum for some reason...
mysym looks like an identical
2007/10/6, Peter Verswyvelen [EMAIL PROTECTED]:
But great to know about the new strictness on vars! I really should get GHC
6.8 RC1 for Windows...
Just in case you misunderstood : this functionality was already there
in GHC 6.4, it's just the new syntax to active it that is available
only in
On 10/6/07, Bertram Felgenhauer [EMAIL PROTECTED] wrote:
This is a language extension, you need -fbang-patterns
to allow it, or with a recent ghc (6.7, 6.9 or a 6.8 rc)
a {-# LANGUAGE BangPatterns #-} pragma, or -XBangPatterns.
LANGUAGE pragmas (including BangPatterns) work just fine in 6.6,
Hi Oleg,
Many thanks for this, it is really brilliant stuff.
It is a pity that it cannot be used in an interpreter but it is a great trick
to know for static compilation of DSLs.
All the best,
titto
On Saturday 06 October 2007 08:55:36 [EMAIL PROTECTED] wrote:
The earlier
Just to be clear, I doubt the difference had anything to do with
tail-recursion per se. My guess is that with the mysum version, ghc was
able to do some strictness analysis/optimization that it wasn't able to do
(for whatever reason) with the first version. The best solution (as others
have
Binary: high performance, pure binary encoding, decoding and serialisation for
Haskell
--
The Binary Strike Team is pleased to announce release 0.4 of Data.Binary, the
pure, efficient binary serialisation library for
On 10/6/07, Don Stewart [EMAIL PROTECTED] wrote:
The Binary Strike Team is pleased to announce release 0.4 of Data.Binary, the
pure, efficient binary serialisation library for Haskell, now available from
Hackage:
May I ask what are the changes? I didn't find some sort of changelog anywhere.
[EMAIL PROTECTED] wrote:
we might attempt to write
testr = either (error) (ev) (typecheck env0 te3)
where ev (TypedTerm t e) = sin (eval e)
We know that it should work.
If we know it has to be a Double, we can express that:
testr = either (error) (ev) (typecheck env0 te3)
where ev
Hi Peter,
This is of course very easy to do manually, but does a command line tool
exist for extracting source code from literate Haskell files?
Cpphs is the perfect tool to do this.
Thanks
Neil
On 9/30/07, Peter Verswyvelen [EMAIL PROTECTED] wrote:
Thanks,
Peter
Hi Peter,
It sounds like the problem is that you need to convert it to Hugs,
rather than WinHugs specific (which might put a few people off looking
to see if they can help). Perhaps an email to the author of the
library might help you find if they would be interested in doing a
port to Hugs.
I've seen quite a few people do crazy things to abuse the Haskell type
system in order to perform arithmetic in types. Stuff the type system
was never ever intended to do.
Well I was just wondering... did anybody ever sit down and come up with
a type system that *is* designed for this kind of
On 10/6/07, Andrew Coppin [EMAIL PROTECTED] wrote:
I've seen quite a few people do crazy things to abuse the Haskell type
system in order to perform arithmetic in types.
How did you know precisely what I was doing at this moment in time?
Stuff the type system
was never ever intended to do.
On Sat, Oct 06, 2007 at 01:26:18PM -0500, Alex Tarkovsky wrote:
...and the silliness continues:
In which case:
http://pics.livejournal.com/resiak/pic/00019kx6/
Will
signature.asc
Description: Digital signature
___
Haskell-Cafe mailing list
Will Thompson wrote:
http://pics.livejournal.com/resiak/pic/00019kx6/
Bravo. ;)
And here's what happens when you substitute your cat for GHCi:
http://arcanux.org/lambdacats3.html
--
Alex Tarkovsky
___
Haskell-Cafe mailing list
This is of course very easy to do manually, but does a command line tool
exist for extracting source code from literate Haskell files?
Cpphs is the perfect tool to do this.
In case the link is not immediately obvious, cpphs has the -unlit flag
to remove the literate parts of the file,
Don Stewart wrote:
*Very* high performance can be expected, with throughput over 1G/sec observed
in practice (good enough for most networking scenarios, we suspect).
Um... I wasn't aware that there was any harddrive or networking
technology that goes this fast?
Anyway, I'll have to take
agl:
On 10/6/07, Felipe Almeida Lessa [EMAIL PROTECTED] wrote:
May I ask what are the changes? I didn't find some sort of changelog
anywhere.
There's the darcs changes list. The descriptions there in are .. terse :)
But here's a selection:
* Add getLazyByteStringNul.
-- | Get a
On Sat, Oct 06, 2007 at 10:16:37PM +0100, Andrew Coppin wrote:
Don Stewart wrote:
*Very* high performance can be expected, with throughput over 1G/sec
observed
in practice (good enough for most networking scenarios, we suspect).
Um... I wasn't aware that there was any harddrive or
andrewcoppin:
Don Stewart wrote:
*Very* high performance can be expected, with throughput over 1G/sec
observed
in practice (good enough for most networking scenarios, we suspect).
Um... I wasn't aware that there was any harddrive or networking
technology that goes this fast?
My bus
Yes, that web page is a terrible introduction to dependent types. :)
On 10/6/07, Andrew Coppin [EMAIL PROTECTED] wrote:
Dan Piponi wrote:
On 10/6/07, Andrew Coppin [EMAIL PROTECTED] wrote:
I've seen quite a few people do crazy things to abuse the Haskell type
system in order to perform
felipe.lessa:
On 10/6/07, Don Stewart [EMAIL PROTECTED] wrote:
The Binary Strike Team is pleased to announce release 0.4 of Data.Binary,
the
pure, efficient binary serialisation library for Haskell, now available from
Hackage:
May I ask what are the changes? I didn't find some sort of
On 10/6/07, Dan Piponi [EMAIL PROTECTED] wrote:
I'm guessing you're talking about a language that
makes it easier to fake your own dependent types without properly
implementing dependent types. If you find one, I could use it right
now - the details of embedding the gaussian integers in
On 10/5/07, Don Stewart [EMAIL PROTECTED] wrote:
It has been suggested we could just sit DrScheme in front of ghc/ghci.
Anyone with experience who'd like to step up for this?
Note that there's a DrOCaml, which might be a good starting point.
martin
25 matches
Mail list logo
