Duncan Coutts duncan.cou...@worc.ox.ac.uk writes:
The PVP says:
1. If any entity was removed, or the types of any entities
or the definitions of datatypes or classes were changed,
or instances were added or removed, then the new A.B
On Sun, 2009-05-24 at 16:36 +0200, Ketil Malde wrote:
Duncan Coutts duncan.cou...@worc.ox.ac.uk writes:
The PVP says:
1. If any entity was removed, or the types of any entities
or the definitions of datatypes or classes were changed,
or
Hi,
When I was learning to program in imperative languages like Java, there
were plenty of resources to learn from about how to design large
programs. Ideas like the GoF Design Patterns gave useful models that
one could then scale up.
Are there such resources for Haskell? As I'm learning the
On Mon, May 25, 2009 at 4:22 PM, Dan danielkc...@gmail.com wrote:
Are there any suggestions of wikis, books or particularly
well-architected and readable projects I could look at to about learn
larger-scale design in Haskell?
XMonad is pretty good, see
http://xmonad.org/
For its design and
:
By the way, I did submit my solution. It improved the score a bit but it
is still very memory hungry.
a bit?
Currentlly it is the fastest in 32 bit . the memory/speed problems happens
in 64 bit benchmarks. I suppose that the speed is related with the memory
leak that will be fixed, Dons
[snip]
Hi Hans,
I believe the problem is to do with the inductive nature of the FGL
library. A graph in FGL is a series of contexts, each corresponding to
a node. Each context contains lists of links to/from the latest node to
nodes in previous contexts. Each link is only recorded
There will soon (in the next couple of days) be a wiki page where
people can write down the projects they might like to work on. This
was just sort of a pre-announcement to gauge interest and so on;
sometime tomorrow or Wednesday we plan to send out an official
announcement with lots more info.
On Sun, May 24, 2009 at 10:39:50AM +0200, Petr Pudlak wrote:
On Sun, May 24, 2009 at 12:18:40PM +0400, Eugene Kirpichov wrote:
Haskell has terms depending on types (polymorphic terms) and types
depending on types (type families?), but no dependent types.
But how about undecidability? I'd
Hi,
I would like to get some advice on how to best implement a protocol.
The protocol in question is Bayeux:
http://svn.cometd.org/trunk/bayeux/bayeux.html. The details don't
matter here - it defines a couple of requests and responses in JSON
format, basically JSON objects with different
Type checking is decidable for all of the lambda cube, but not type inference.
Haskell 98 is a subset of Fw, Haskell with extensions is an superset of Fw.
-- Lennart
On Mon, May 25, 2009 at 12:59 PM, Brent Yorgey byor...@seas.upenn.edu wrote:
On Sun, May 24, 2009 at 10:39:50AM +0200, Petr
$diff main.simpl imported.simpl
...
223c232
a_s1rs [ALWAYS Just L] :: GHC.Integer.Internals.Integer
---
a_s1sV [ALWAYS Just S] :: GHC.Integer.Internals.Integer
...
Good find!
Does this S vs. L difference have anything to do with strictness and laziness?
Yes.
So, I think we
Hello all,
is there a function that can safely split a command line into a FilePath
to the executable and its parameters? I couldn't manage to find one. If
not, what are the pitfalls in creating a cross-platform solution to this
problem? Can I assume that the first space not within double quotes
On Monday 25 of May 2009 18:57:28 Patai Gergely wrote:
Hello all,
is there a function that can safely split a command line into a FilePath
to the executable and its parameters? I couldn't manage to find one. If
not, what are the pitfalls in creating a cross-platform solution to this
problem?
There getArgs and getProgName in System module. If you want
parse this parameters there is System.Console.GetOpt.
Those will only tell me how my program was called. I want to work with
command lines as data within my program, which is a completely different
thing.
All the splitting, escaping
Is anyone up for Anglohaskell this year?
Perhaps more importantly, is anyone willing to step forward to run it? I
can lend a hand, having organised and to some extent meta-organised in
previous years, but I'm not sure I have spare time to do the same kind
of job as I did in 2007.
For those
On Mon, 2009-05-25 at 17:45 +0200, Patai Gergely wrote:
There getArgs and getProgName in System module. If you want
parse this parameters there is System.Console.GetOpt.
Those will only tell me how my program was called. I want to work with
command lines as data within my program, which is a
Hello all,
MultiRec[1,2] is a great library for generic programming for families
of possibly mutual recursive data types. Creating new generic
functions might take some effort but the use of these functions is
very straightforward.
The multirec-binary[3] packages allows generic
That is amazing! It's the fastest 32-bit entry, good job.
On Sat, May 23, 2009 at 5:33 PM, Arnaud Payement
arnaud.payem...@gmail.com wrote:
By the way, I did submit my solution. It improved the score a bit but it is
still very memory hungry.
- Original Message - From: Don Stewart
It is quite hard for me to tell why this entry is faster than the one one as I
used the C entry as a starting point which I then refactored multiple times to
ensure that the solution is closer to what one who right in Haskell.
The only big difference I can see between the two is the different
heh, a Lisp-br community of about 100 people generates about some 1
message a month. I won't even try to guess 5 Haskellers from Sao
Paulo. :P
2009/5/23 Daniel Yokomizo daniel.yokom...@gmail.com:
Hey, we have enough people for a São Paulo Haskell User Group.
Anyone else interested?
Best
Anyone interested in just getting together, from complete beginner, to those
with experience, to share ideas and help each other other out.
The Filmhouse on Lothian Road, is quite handy for Edinburgh folk, and for
anyone was coming through from Glasgow, and alighting(using train speak) at
Here is some furniture that ought to appeal to the Haskell afficionado:
http://karl-andersson.se/view_product.asp?rangeId=39catId=2picture=2
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Hi all,
In preparation for my GSoC project, I've set up some new
infrastructure for the haskell-src-exts package. Instead of residing
with the HSP packages, it's now old enough to be allowed to live on
its own. The new repository is
darcs get http://code.haskell.org/haskell-src-exts
I've also
Conal Elliott co...@conal.net wrote:
I gather that some people are terribly uncomfortable
without certainty. If you take away their certainty, they demand an
immediate replacement!
This is a very important observation, vast areas of human psychology
can be explained in terms of feeling
Michael Mossey m...@alumni.caltech.edu wrote:
Based on a previous reply, I think some people think this sounds like
vapid cheerleading, but I think you would agree with me that life
(and software) always offers more possibilities when we engage our
imagination with hope and energy, not giving
On Tue, May 26, 2009 at 12:40 AM, Steve Schafer st...@fenestra.com wrote:
Here is some furniture that ought to appeal to the Haskell afficionado:
http://karl-andersson.se/view_product.asp?rangeId=39catId=2picture=2
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
I
G'day all.
Quoting Conal Elliott co...@conal.net:
The main objection I have to the negative process (can't be done) is that is
so often bogus. Proof by lack of imagination. I guess it works for
Richard, though not for Michael's architect, because Richard is able to
catch his bogus reasoning
vo...@tcs.inf.tu-dresden.de wrote:
2009/5/24 Petr Pudlak d...@pudlak.name:
If all Haskell had would be HM, it would be System F.
That cannot be quite right, can it? System F has more powerful
polymorphism than HM.
As I recall HM is along the edge to \lambda^2.
Haskell 98 is typically
ntu...@googlemail.com wrote:
This however does not work because record selectors have module scope,
so the compiler will complain that channel et. al. are defined
multiple times. As a workaround I could put each type into its own
module, but at least GHC requires a file per module (which is
On 26 May 2009, at 12:54 pm, a...@spamcop.net wrote:
Conal is definitely on to something here. I've noticed that the best
designers have this weird personality quirk that allows them to put
all
of their effort into pushing an idea, and then instantly back down and
revise the moment that
Hello,
Are there any libraries for bidirectional [1] programming
in Haskell? Any related work?
All I've found is a paper There and back again: arrows for
invertible programming, which I couldn't find the full text of.
Cheers,
Artyom Shalkhakov.
[1] something along the lines of Boomerang
which does shell command line expansion. This might be more than you
want however as it also expands *.hs wildcards, arithmetic, quote
removal, ~user paths, $env vars and (optionally) $(command)
substitution.
I don't think I'll have to deal with very complicated cases, just more
or less static
32 matches
Mail list logo
