Hello Chad,
Friday, May 19, 2006, 10:40:56 PM, you wrote:
It sounds like Bulat has gotten some impressive I/O speedups with
his Streams library. I'd like to try this out, but I'm having some
trouble installing it. I'm using GHC on Linux.
yes, and current (still unpublished) version is even
Thanks, Bulat. I'm looking forward to trying it out this weekend.
Is there any indication what fast IO approach might work its way into
the standard libraries? It would be nice for idiomatic Haskell to be
really fast by default, and I'd love to be able to show off the language
shootout
On 5/20/06, Chad Scherrer [EMAIL PROTECTED] wrote:
Thanks, Bulat. I'm looking forward to trying it out this weekend.
Is there any indication what fast IO approach might work its way into
the standard libraries? It would be nice for idiomatic Haskell to be
really fast by default, and I'd love to
On 2006-05-20 at 12:00+0200 Sebastian Sylvan wrote:
A quick sales pitch: usually you, the library user, can just type:
./runhaskell Setup.hs configure
./runhaskell Setup.hs build
./runhaskell Setup.hs install
And it will Do The Right Thing(TM), which is nice.
This is something I've never
Hello,
I'm writing a function 'preProcess' that simplifies the AST that comes out of
Language.Haskell.Parser.parseModule. Simplifying means rewriting infix
applications to normal prefix applications (in both patterns and
expressions), removing parentheses, rewriting guards to if-then-else
Hi Bas,
I had a requirement to do something similar as part of one of my
projects, essentially reduce full Haskell to a small and manageable
subset. Unfortunately I think you'll find that this task is a lot
bigger than you first realise, and in particular that case-of is
probably the expression
On Saturday 20 May 2006 06:53 am, Jon Fairbairn wrote:
On 2006-05-20 at 12:00+0200 Sebastian Sylvan wrote:
A quick sales pitch: usually you, the library user, can just type:
./runhaskell Setup.hs configure
./runhaskell Setup.hs build
./runhaskell Setup.hs install
And it will Do The
Hi
FWIW, it's almost identical to the incantation necessary for projects based on
autotools, where it usually reads something like:
./configure
make
make install
But sadly compared to Windows tools, where its just a case of double
click this sounds a bit too complex.
I am hoping that I can
SECOND ANNOUNCEMENT and CALL FOR PAPERS
!!! REGISTRATION IS NOW OPEN !!!
The registration site:
http://www.inf.elte.hu/rendezvenyek/ifl/registration.htm
**
*
On 5/20/06, Bas van Dijk [EMAIL PROTECTED] wrote:
How can I make this work?
As far as I know, you can't. To see the problem, rewrite it using dictionaries:
data Simplify a = Simplify { simplify :: a - a }
simplify_HsExp (HsInfixApp e1 op e2) = HsApp (HsApp (opToExp op) e1) e2
simplify_HsExp
On 5/20/06, Bas van Dijk [EMAIL PROTECTED] wrote:
simplifyExp (HsLeftSection e op)= HsApp (opToExp op) e
simplifyExp (HsRightSection op e) = HsApp (opToExp op) e
By the way, I think this looks wrong. One of these needs to create a
lambda expression.
--
Taral [EMAIL PROTECTED]
On 2006-05-20 at 11:58EDT Robert Dockins wrote:
On Saturday 20 May 2006 06:53 am, Jon Fairbairn wrote:
Make allows one to set up rules about what depends
on what, so why can't we just arrange it so that someone who
wants to install the thing just hast to type
./runhaskell Setup.hs
Neil Mitchell wrote:
Hi
FWIW, it's almost identical to the incantation necessary for
projects based on autotools, where it usually reads something like:
./configure
make
make install
But sadly compared to Windows tools, where its just a case of double
click this sounds a bit too complex.
I
Bas,
There is a really easy (and intended) way to make this work.
See Sec. 6.4 SYB1 paper (TLDI 2003).
- You compose things as follows:
simplify = id `extT` simplifyRhs `extT` simplifyExp `extT` ...
- You apply everything right away to simplify.
There is no need to use a class in your case.
Hello Evan,
Saturday, May 20, 2006, 5:35:15 AM, you wrote:
France: Army Marseilles SUPPORT Army Paris - Burgundy.
Russia: Fleet St Petersburg (south coast) - Gulf of Bothnia.
England: 4 Supply centers, 3 Units: Builds 1 unit.
The next phase of 'dip' will be Movement for Fall of 1901.
Evan Martin wrote:
Unfortunately, the output is intended to be human-readable, and this
makes parsing it a bit of a pain. Here are some sample lines from its
output:
France: Army Marseilles SUPPORT Army Paris - Burgundy.
Russia: Fleet St Petersburg (south coast) - Gulf of Bothnia.
On 5/21/06, Udo Stenzel [EMAIL PROTECTED] wrote:
do power
colon
integer
reserved Supply centers,
integer
reserved Units:
((reserved Builds return id) |
(reserved Disbands return negate))
`ap` integer
reserved units. | reserved unit.
Come on, it isn't
On 5/21/06, Evan Martin [EMAIL PROTECTED] wrote:
Thanks! I had looked at using the lexeme parser before but it didn't
seem like you can make newlines significant.
Upon further consideration I realized that you can mix lexeme-based
parsers with plain parsers. I think I've mostly figured this
18 matches
Mail list logo