On 29/03/07, Greg Buchholz [EMAIL PROTECTED] wrote:
Something out of Unicode?
≬⊳⌁⋆☕⚡‣‸‡⁏•△▴◆◇◊◬◢◮♘♣♲♪◖▻▿轢
There should be a good candidate for a rational arrow notation in
there! I always found the a - b - c syntax a bit disturbing. :-)
D.
readers of this thread might find ghc ticket #1241 relevant
http://hackage.haskell.org/trac/ghc/ticket/1241
class T root pos sel | pos - root, root - sel where
f :: pos - sel - Bool
instance T root (Any root) sel
But the same applies to the second functional dependency and the type
Andrzej Jaworski himself at poczta.nom.pl writes:
Perhaps you can also figure out how to replace the disturbing $ operator?
I suggest in place of $. For example:
h x = f g x
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 2007 Mar 29, at 12:26 AM, Nicolas Frisby wrote:
I don't think that
aName =
[ x
, y
, z
]
can be beat for adaptability (i.e. adding/removing/reorganizing
results or _especially_ renaming the declaration). Doesn't do so hot
regarding vertical space though...
IMHO (just as IYHO above),
Something out of Unicode?
≬⊳⌁⋆☕⚡‣‸‡⁏•△▴◆◇◊◬◢◮♘♣♲♪◖▻▿轢
Greg Buchholz
Why not Braille alphabet? These guys at least don't complain;-)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
DavidA [EMAIL PROTECTED] wrote:
I suggest in place of $. For example:
h x = f g x
I would feel better with : |
Ideally, redesigning Haskell syntax for 21st century should take more
scientific course.
But with know-how here still much lagging we can only tap on experience with
symbol
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Douglas Philips
On 2007 Mar 29, at 12:26 AM, Nicolas Frisby wrote:
I don't think that
aName =
[ x
, y
, z
]
can be beat for adaptability
IMHO (just as IYHO above), this cannot be beat:
aName = [
Hallo,
On 3/29/07, Nicolas Frisby [EMAIL PROTECTED] wrote:
A wee bit off topic... but bear with me.
More off-topic... but bear with me. :-)
I'm starting with Haskell. I'm writing a real application with Gtk2hs
and HDBC for a small furniture shop. I have enjoyed it very much so
far, and I
Daniel,
New combinator (:) that you introduced helps a lot to understand the whole
thing. I think that your explanation should be included in the next edition
of the Haskell. The Craft of Functional Programming, I really mean it.
To summarize how I now understand the parser:
Using your
Are they for working around some problems of HM type systems or do
they give Haskell super-language powers? I guess I could answer these
questions if I understood what FD and GATDs are all about, but I'm not
just there yet. :-)
When you are done with furniture and decide to help us with
On 3/27/07, Dave at haskell.org Dave at haskell.org wrote:
Given the amount of material posted at haskell.org and elsewhere
explaining IO, monads and functors, has anyone considered publishing
a comprehensive book explaining those subjects? (I am trying to
read all the material online,
Hi,
I had a bad time trying to parse the words of a text.
I suspect I miss some parsec knowledge.
In the end it seems working, though I haven't tested much and this example
contains the main features I was looking.
*Main parseTest (parseLine eof) [EMAIL PROTECTED] sara,mimmo! 9ab a9b
On Thu, Mar 29, 2007 at 08:29:51PM +0100, Iain Alexander wrote:
I eventually persuaded Plugin.Pl.Transform.hs to compile by disabling the
optimisation, and with other bits of hackery got lambdabot to build.
When I run it as
lambdabot
I get
Initialising plugins.
(with lots of '.'s,
On 3/29/07, Stefan O'Rear [EMAIL PROTECTED] wrote:
As a result of my recentish code cleanups, everything lambdabot does,
even the main command loop, is a @-command. If you just run it as
'lambdabot', you give it zero commands, so it loads all plugins,
executes zero commands, and quits.
Since
lambdabot runs on xp?
=(
On 3/29/07, Tim Chevalier [EMAIL PROTECTED] wrote:
On 3/29/07, Stefan O'Rear [EMAIL PROTECTED] wrote:
As a result of my recentish code cleanups, everything lambdabot does,
even the main command loop, is a @-command. If you just run it as
'lambdabot', you give it
Andrzej Jaworski wrote:
Hi Don,
I noticed your Clifford Algebra some time ago and was impressed. Geometric
Algebra with
its infinite dimensional structures needs lazy evaluation so Haskell should
shine, no
doubt.
What the?
Some uses use the somewhat hazy idea of infinite dimensional
Hi,
I had a bad time trying to parse the words of a text.
I suspect I miss some parsec knowledge.
In the end it seems working, though I haven't tested much and this example
contains the main features I was looking.
*Main parseTest (parseLine eof) [EMAIL PROTECTED] sara,mimmo! 9ab a9b
Hi,
I had a bad time trying to parse the words of a text.
I suspect I miss some parsec knowledge.
In the end it seems working, though I haven't tested much and this example
contains the main features I was looking.
*Main parseTest (parseLine eof) [EMAIL PROTECTED] sara,mimmo! 9ab a9b
18 matches
Mail list logo
