Sorry for not sending to the list.
- Forwarded message from Felipe Lessa felipe.le...@gmail.com -
On Fri, Nov 06, 2009 at 07:58:30PM -0200, Felipe Lessa wrote:
On 11/6/09, Gaius Hammond ga...@gaius.org.uk wrote:
To be fair, Python offloads its heavy lifting to C libraries - NumPy
On Fri, Nov 06, 2009 at 10:04:45PM -0800, jfred...@gmail.com wrote:
* mauke: @unpl const (flip const)
lambdabot: (\ _ c d - d)
I didn't get this one, is it just because lambdabot didn't change
'c' to an underscore?
Thanks for the HWN, as always :),
--
Felipe.
On Sat, Nov 7, 2009 at 10:48 AM, Felipe Lessa felipe.le...@gmail.com wrote:
On Fri, Nov 06, 2009 at 10:04:45PM -0800, jfred...@gmail.com wrote:
* mauke: @unpl const (flip const)
lambdabot: (\ _ c d - d)
I didn't get this one, is it just because lambdabot didn't change
'c' to an
Hi!
I would like to know if anybody has already thought of or tried
to code an EDSL for card games. Ideally you should be able to
write the rules the games and get for free:
- Game generator: given an input deck, construct the initial
state of the game.
- Random game generator: besides
You might peek at my library HCard (it's on Hackage), it uses
associated datatypes to allow for a very
general playing-card interface. It was only ever a toy to play w/
Assoc. types for me, but I imagine it
could be a decent starting point for someone interested in turning it
into a real
Thanks, I'll check it out.
At 22:03 06/11/2009, S. Doaitse Swierstra wrote:
The UHC compiler contains a combinator based Haskell parser from which
you can borrow fragments,
Doaitse Swierstra
On 6 nov 2009, at 15:49, Eric Macaulay wrote:
Hi all,
I was hoping to use Language.Haskell.Parser
It has indeed reached me. Thanks!
At 16:23 06/11/2009, Niklas Broberg wrote:
You'd have to modify the parser in haskell-src(-exts) to do add the entry
points, though.
Actually haskell-src-exts already defines entry points for Module,
Stmt, Exp, Pat and Type (as well as [Module] in 1.3.x).
Hi Felipe
Close (or maybe not...), Martin Erwig and Eric Walkingshaw have a few
papers on embedding a DSL in Haskell for game theory available from
Martin's web site:
http://web.engr.oregonstate.edu/~erwig/papers/abstracts.html
Best wishes
Stephen
2009/11/7 Felipe Lessa
Hi Felipe,
Interesting idea. But I guess you should clarify what kind of card
games you want to support. E.g, a DSL for trick taking games like
Bridge, Skat or Doppelkopf might be different from one that's good for
Canasta or Rummy. Or do you aim at Solitaire? I'd suggest starting
with a very
On Sat, Nov 07, 2009 at 08:46:07AM -0500, Matthias Görgens wrote:
Interesting idea. But I guess you should clarify what kind of card
games you want to support. E.g, a DSL for trick taking games like
Bridge, Skat or Doppelkopf might be different from one that's good for
Canasta or Rummy. Or
Luke Palmer escribió:
On Fri, Nov 6, 2009 at 6:54 PM, klondike
klondikehaskellc...@xiscosoft.es wrote:
Henning Thielemann escribió:
That's what I meant with my post: Programming errors (like head [])
are not handled by control-monad-exception. As far as I understand,
hi,
my Avira antivirus program says that there is a trojan in the
bamse-0.9.5 package. I downloaded the hackage-torrent a week ago, and
Avira says TR/Crypt.CFI.Gen is in bamse. To be sure, I downloaded
bamse-0.9.5 from hackage today, and now avira says less specificly that
there are some
Hello Ryan,
thank you for your email, it's much appreciated.
In summary I'd like to say that in the 2 years that I have been using
Haskell I have managed to get a good working knowledge of the language
which allows me to construct programs that are concise, correct and
without greater
The UHC compiler contains a combinator based Haskell parser from
which you can borrow fragments,
... and the nhc98/yhc compiler likewise has a combinator parser for
full Haskell'98 (the combinators are in applicative style).
Regards,
Malcolm
Am 07.11.2009, 16:28 Uhr, schrieb Daniel van den Eijkel d...@gmx.net:
hi,
my Avira antivirus program says that there is a trojan in the
bamse-0.9.5 package. I downloaded the hackage-torrent a week ago, and
Avira says TR/Crypt.CFI.Gen is in bamse. To be sure, I downloaded
bamse-0.9.5 from
L.S.,
I changed the options in WinGHCi and now WinGHCi is stuck in a loop each
time I start it; how can I edit the options? I cannot find them in the
registry.
--
Met vriendelijke groet,
Henk-Jan van Tuyl
--
http://Van.Tuyl.eu/
http://members.chello.nl/hjgtuyl/tourdemonad.html
--
Duncan Coutts wrote:
On Tue, 2009-07-14 at 03:01 -0700, Michael Vanier wrote:
Charles,
Haskell is a wonderful language (my favorite language by far) but it is
pretty difficult for a beginner. In fact, it is pretty difficult for
anyone to learn in my experience, because it has so many
On Sat, Nov 7, 2009 at 8:07 AM, Felipe Lessa felipe.le...@gmail.com wrote:
On Sat, Nov 07, 2009 at 08:46:07AM -0500, Matthias Görgens wrote:
Interesting idea. But I guess you should clarify what kind of card
games you want to support. E.g, a DSL for trick taking games like
Bridge, Skat or
When using happstack, I find it really annoying to get a
Prelude.head: null list error (or similar) in my web browser window
because somewhere, some library used something unsafe -- and of
course, since this is haskell, no stack trace.
if c-m-e can offer benefits around this, I would be
On Pi, 2009-11-06 at 17:25 -0500, Brent Yorgey wrote:
On Fri, Nov 06, 2009 at 03:29:47PM +, Stephen Tetley wrote:
Hello all,
Are any of the of the more exotic recursion schemes definable without
a least-fixed point /Mu/ type?
Note that Haskell datatypes have a built-in implicit mu
Hi,
We have names for properties of operators/functions. For example, if
this holds:
a % b = b % a
for some operator %, we say that % is commutative. Similarly, if this
holds:
(a % b) % c = a % (b % c)
we say that % is associative. Is there a name for this property, which
I'm
The syntax is similar, but what else is?
In JavaScript there is a null value, that is the only value of the null type.
Isn't () the same thing? The only value of the unary type?
Best,
titto
2009/11/6 John Dorsey hask...@colquitt.org:
In what sense () is a 0-length tuple?
2009/11/7 Pasqualino Titto Assini tittoass...@gmail.com:
The syntax is similar, but what else is?
In JavaScript there is a null value, that is the only value of the null
type.
Isn't () the same thing? The only value of the unary type?
No, () has two values: () and undefined (t.i., _|_).
Forgot to cc haskell-cafe. Trying again:
-- Forwarded message --
From: Matthew Gruen wikigraceno...@gmail.com
Date: Sat, Nov 7, 2009 at 2:16 PM
Subject: Re: [Haskell-cafe] Is () a 0-length tuple?
To: Pasqualino Titto Assini tittoass...@gmail.com
On Sat, Nov 7, 2009 at 2:00 PM,
On Sat, 7 Nov 2009, Jose Iborra wrote:
Sorry for the confusion, I never meant that c-m-e can show stack traces for
asynchronous exceptions. It can not.
My post was not related in any way to asynchronous exceptions. It's just
the everlasting issue of the distinction of programming errors and
Matus Tejiscak wrote:
On Pi, 2009-11-06 at 17:25 -0500, Brent Yorgey wrote:
On Fri, Nov 06, 2009 at 03:29:47PM +, Stephen Tetley wrote:
Hello all,
Are any of the of the more exotic recursion schemes definable without
a least-fixed point /Mu/ type?
Note that Haskell datatypes have a
Hi all,
The task I'm trying to accomplish:
Given a log file containing several lines of white space delimited entries like
this:
[Sat Oct 24 08:12:37 2009] [error] GET /url1 HTTP/1.1]: Requested URI does not
exist
[Sat Oct 24 08:12:37 2009] [error] GET /url2 HTTP/1.0]: Requested URI does not
2009/11/8 Gokul P. Nair gpnai...@yahoo.com
Hi all,
The task I'm trying to accomplish:
Given a log file containing several lines of white space delimited entries
like this:
[Sat Oct 24 08:12:37 2009] [error] GET /url1 HTTP/1.1]: Requested URI does
not exist
[Sat Oct 24 08:12:37 2009]
On Sun, Nov 08, 2009 at 12:15:57AM +0300, Eugene Kirpichov wrote:
Here, you should not use Map.fromListWith (+) because Map is not
strict in its entries and you end up having big fat thunks there.
You should use Map.fromListWith plus where x `plus` y = x `seq` y `seq` x+y.
fromListWith is
gpnair78:
I really hope I'm missing some obvious optimization that's making it so slow
compared to the perl version, hence this email soliciting feedback.
Here's my first attempt. 1.5s on a 2M line log file in the format you give.
General notes:
* unpack is almost always wrong.
* list
Ah, you're right. Then we need a foldl' insertWith with a strict plus.
2009/11/8 Felipe Lessa felipe.le...@gmail.com:
On Sun, Nov 08, 2009 at 12:15:57AM +0300, Eugene Kirpichov wrote:
Here, you should not use Map.fromListWith (+) because Map is not
strict in its entries and you end up having
On Sat, Nov 7, 2009 at 9:54 PM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
On Sat, 7 Nov 2009, Jose Iborra wrote:
Sorry for the confusion, I never meant that c-m-e can show stack traces
for asynchronous exceptions. It can not.
My post was not related in any way to
2009/11/7 Eugene Kirpichov ekirpic...@gmail.com:
Ah, you're right. Then we need a foldl' insertWith with a strict plus.
We only need a foldl' insertWith' : (+) is already strict for all
the numeric types in the Prelude.
--
Jedaï
___
Haskell-Cafe
JAPI is by far my favorite GUI library. Since every machine has Java RE
installed, JAPI offers GUI with a very small footprint. Besides this, it is
very easy to code, and delivers GUI programs that are hardly larger than
console applications. I use Jorlano's version of JAPI, coded for Java 2,
John van Groningen johnvg at cs.ru.nl writes:
Doaitse Swierstra wrote:
One of this differences between Haskell and Clean I did not see mentioned in
this discussion is that Clean
does not allow so-called partial parametrisation. I.e. all function calls have
to be fully saturated
I don't
1. and 2. are called left- and right-commutative.
And I think that 3. and 4. are left- and right-commutative rings
(please correct me if I'm wrong here).
Cheers, Thomas
2009/11/7 Neil Brown nc...@kent.ac.uk:
Hi,
We have names for properties of operators/functions. For example, if this
No, they aren't rings, because rings are distributive...
2009/11/8 Thomas Danecker tdanec...@gmail.com:
1. and 2. are called left- and right-commutative.
And I think that 3. and 4. are left- and right-commutative rings
(please correct me if I'm wrong here).
Cheers, Thomas
2009/11/7 Neil
Hi Neil,
You wrote:
[...] Is there a name for this property, which
I'm numbering 1, (where (%) :: a - b - b; i.e. the operator is
potentially, but not necessarily, asymmetrically typed):
1: a % (b % c) = b % (a % c)
I don't know any snappy names for this, but the following might help to
castAny :: (Storable a, Storable b) = a - b
castAny = unsafePerformIO . genericCast
where
genericCast :: (Storable a, Storable b) = a - IO b
genericCast v = return undefined = \r -
allocaBytes (max (sizeOf v) (sizeOf r)) $ \p -
poke p v if False then return r else peek
39 matches
Mail list logo
