On 12/01/2012 12:48 PM, Johan Brinch wrote:
I'm not using any unsafe IO
OK, good...
(only for debug printing)
...ah. It seems we have reached a contradiction.
Where is a transaction being nested?
My guess is that your debug printing is causing something to be
evaluated when it
Every time I hear oh, I don't think Windows can
handle that, I sigh with resignation.
Sorry to say, but it seems you yourself are unaware of the extensive
and highly flexible locking facilities on Linux :) The defaults on
Linux are advisory locking, not mandatory, but claiming Linux doesn't
I
gather that Linux does now support real locking though. (And file
update notifications, and ACLs, and lots of other things that
Windows has had for far longer.)
Hrmm: Mandatory File Locking For The Linux Operating System, 15 April
1996 :)
Have a reference for when it was actually
On 29/12/2011 04:29 AM, Antoine Latter wrote:
On Wed, Dec 28, 2011 at 3:52 PM, Michael Snoymanmich...@snoyman.com wrote:
Hi all,
I just received a bug report from a client that, when an input file is
open in FrameMaker, my program gives a permission denied error. This
bug is reproducible with
On 19/12/2011 07:20 PM, Robert Clausecker wrote:
Image you would create your own language with a paradigm similar to
Haskell or have to chance to change Haskell without the need to keep any
compatibility. What stuff would you add to your language, what stuff
would you remove and what problems
On 21/12/2011 10:09 AM, Jesse Schalken wrote:
IIRC, Scite's default configuration is with non-monospace font. I
actually found it quite appealing, and in fact forgot about it entirely
after some usage. It is much easier on the eyes to read. The difference
is really whether you care about
On 16/12/2011 07:05 PM, Bardur Arantsson wrote:
Michael Litchard wrote:
[--snip--]
If getting hit by a bus is a significant factor in the overall outcome of
the project then I think those are pretty good odds, aren't they?
(I do realize that traffic accidents are a lot more frequent than we
Hi guys.
I've got a folder with about 80 XML files in it. I want to take each
file and make specific modifications to it. (Mostly just finding
specific attributes and changing their values to make then all consistent.)
Now I guess it wouldn't take me /that/ long to code something from
On 23/11/2011 10:14 AM, Jon Fairbairn wrote:
Andrew Coppinandrewcop...@btinternet.com writes:
I've got a folder with about 80 XML files in it. I want to
take each file and make specific modifications to it.
HaXml
Mmm. That looks very promising...
which gives some idea of the flavour.
On 23/11/2011 12:58 PM, Andrew Coppin wrote:
On 23/11/2011 10:14 AM, Jon Fairbairn wrote:
HaXml
Mmm. That looks very promising...
which gives some idea of the flavour.
OK. So it looks like processXmlWith is the function I want, if I'm going
to read one file and create another from it. So
On 16/11/2011 04:50 AM, heathmatlock wrote:
On Tue, Nov 15, 2011 at 10:18 PM, John Meacham j...@repetae.net
mailto:j...@repetae.net wrote:
People tend to concentrate on the lambda which cooresponds to the
functional aspect of haskell when designing logos. Not nearly enough
On 04/10/2011 07:08 AM, Dominique Devriese wrote:
All,
In case anyone is interested, I just want to point out an interesting
article about the relation between Haskell type classes and C++
(overloading + concepts):
http://sms.cs.chalmers.se/publications/papers/2008-WGP.pdf
Dominique
Thanks
On 02/10/2011 02:04 PM, Du Xi wrote:
--It still didn't compile. I think the reason is that the following is
disallowed:
f::a-b
f x = x
The type a - b doesn't mean what you think it does.
It does /not/ mean that f is allowed to return any type it wants to. It
means that f must be prepaired
On 02/10/2011 07:15 PM, Du Xi wrote:
I guess this is what I want, thank you all. Although I still wonder why
something so simple in C++ is actually more verbose and requires less
known features in Haskell...What was the design intent to disallow
simple overloading?
In C++, the code is
It's rather that some considered the IArray API to be
inadequate most of the time. Really, H98 arrays aren't very
good at anything they do. For collective operations, you are
supposed to convert the array to a list, work on the list and
then convert it back to an array which just seems wrong.
I
On 30/08/2011 09:49 PM, Jerzy Karczmarczuk wrote:
Knuth admitted that he had learnt a lot while teaching things he already
knew. So did Feynman. And Landau.
As counter-intuitive as it may seem, explaining something to somebody
else forces you to order your thoughts and think through the
On 30/08/2011 07:58 PM, Jerzy Karczmarczuk wrote:
I think I know several mathematicians who learning that a person asking
for help begins with trying to distinguish between knowledgeable, and
those who just think they are, will simply - to say it politely - refuse
to engage.
I didn't intend
On 29/08/2011 01:13 PM, Christopher Done wrote:
There's also #math on freenode, but it's a scary wilderness.
On 29 August 2011 13:34, Benedict Eastaughionf...@gmail.com wrote:
On 29 August 2011 09:34, Andrew Coppinandrewcop...@btinternet.com wrote:
This is fairly wildly off-topic but...
I meant if you're trying to *implement* serialisation. The Bits
class allows you to access bits one by one, but surely you'd want
some way to know how many bits you need to keep?
I think that falls into the realm of protocol design; if you're doing it
in your program at runtime,
On 29/08/2011 09:00 AM, Brandon Allbery wrote:
On Mon, Aug 29, 2011 at 03:40, Andrew Coppin
andrewcop...@btinternet.com mailto:andrewcop...@btinternet.com wrote:
I meant if you're trying to *implement* serialisation. The Bits
class allows you to access bits one by one
This is fairly wildly off-topic but... does anybody know of a good forum
where I can ask questions about mathematics and get authoritative
answers? (Apart from go visit the nearest university, that is.)
___
Haskell-Cafe mailing list
On 26/08/2011 10:51 PM, Steve Schafer wrote:
On Fri, 26 Aug 2011 20:30:02 +0100, you wrote:
You wouldn't want to know how many bits you need to store on disk to
reliably recreate the value?
I can't say that I have cared about that sort of thing in a very long
time. Bits are rather cheap
On 26/08/2011 02:40 AM, Daniel Peebles wrote:
And as Daniel mentioned earlier, it's not at all obvious what we mean by
bits used when it comes to negative numbers.
I guess part of the problem is that the documentation asserts that
bitSize will never depend on its argument. (So would will
On 26/08/2011 07:36 PM, Steve Schafer wrote:
On Fri, 26 Aug 2011 18:24:37 +0100, you wrote:
I would usually want #3 or #4.
Out of curiosity, what for? While I do occasionally need to get a
logarithmic size estimate of a number (which is basically what #3 and
#4 are), the specific
On 25/08/2011 02:59 AM, Albert Y. C. Lai wrote:
do, a block, a monad block
rec, a knot tied in the block
mu, a name that calls itself (mu is pronounced as me in modern Greek)
forM_, a long long list to run
SO, a state aborting threads (SO is stack overflow)
la, a state to follow SO
T's,
Quoting the Haddock documentation for Data.Bits.bitSize:
Return the number of bits in the type of the argument. The actual value
of the argument is ignored. The function bitSize is undefined for types
that do not have a fixed bitsize, like Integer.
Does anybody else think it would be *far*
On 23/08/2011 09:04 PM, Andreas Voellmy wrote:
I compiled this with ghc --make -rtsopts -threaded -fforce-recomp -O2
DirectTableTest.hs.
Running time ./DirectTableTest 1 +RTS -N1 takes about 1.4 seconds and
running time ./DirectTableTest 2 +RTS -N2 take about 2.0 seconds!
I found that
I think I have found a problem with the union function:
If you look here: http://hpaste.org/49889
You will see that line 4 gives a different result to lines 6, 8, 10;
this shouldn't be the case because union is commutative.
AC-Vector-Fancy is merely a fancy facard over AC-Vector. So the bug is
On 10/08/2011 11:04 PM, Dave Tapley wrote:
Is anyone maintaining the AC-Vector-Fancy package?
I haven't had a reply from the latest maintainer (Andrew Coppin) on
Hackage, so I thought I'd open it up to cafe:
Oh, right. I haven't checked my mailbox recently...
I think I have found a problem
On 23/06/2011 11:30 PM, Jack Henahan wrote:
My solution for the '[0] with a link far down the page' issue is just to search
for '[0]'.
My solution is to never read the text version and only ever read the
HTML version. Works great for me. :-)
___
On 14/06/2011 01:41 PM, Dmitri O.Kondratiev wrote:
Yes, thanks. I just wonder why documentation for this particular module
(Data.Time) is missing from GHC, 7.0.3 Haskell Hierarchical Libraries
documentation generated for Win32. Really strange ...
There are several packages that come with GHC,
How do you make Cabal fail?
Let me clarify. I built a package that uses a post-configure hook to do
some settings detection. Under certain circumstances, it can fail. When
this happens, the hook prints fatal error and quits. Unfortunately, I
didn't actually /test/ whether it works. On further
OK, so suppose you sit down and write a complicated string parser. Now
how do you test that it works correctly?
One way is to run the parser over a large corpus of real world
samples. This has a number of problems:
* If the parser is for a grammar you just invented yourself, presumably
no
On 10/06/2011 01:44 AM, Jason Dagit wrote:
On Thu, Jun 9, 2011 at 2:06 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Too bad GHC doesn't support inline assembly yet... (Or does it? I know it
supports inline Core now.)
Really? I found this in the manual so I think either the docs
On 09/06/2011 06:54 AM, Scott Lawrence wrote:
On 06/09/2011 01:47 AM, Jason Dagit wrote:
Have you checked this by looking at the generated assembly? I
generated some assembly from GHC on windows. Here is what it looks
ilke:
http://hpaste.org/47610
My assembly-fu is not strong enough to tell
On the other hand, I still think it would be worth actually
benchmarking this stuff to see how much difference it makes. Wouldn't
surprise me if the CPU designers did some clever trickery with
pipelining and superscalar execution to make two adjacent 32-bit
instructions execute the same way as a
On 09/06/2011 08:44 PM, austin seipp wrote:
On Thu, Jun 9, 2011 at 1:53 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
I'm still left wondering if using 32-bit instructions to manipulate 64-bit
values is actually that much slower.
The problem is you're probably going to need to spill
On 06/06/2011 09:34 PM, Nicu Ionita wrote:
Hi,
Just to double check: that means, today it's not possible to generate 64
bit operations under Windows, including bit level .., .|. a.s.o. (from
Data.Bits), and this situation will stay like this for a while.
I'm asking this because I'm currently
On 05/06/2011 06:55 AM, Evan Laforge wrote:
I don't think a hierarchy would have helped in this case, but tags
would be appropriate. Actually, I wound up using the categories like
tags. I think we just need better search, e.g. +tag +tag or
something.
+1 to all of the above.
Also, I don't
On 04/06/2011 08:25 PM, Tom Hawkins wrote:
What is the easiest way to generate polygon meshes from constructive
solid geometry? Marching cubes [4] seems pretty involved.
As I understand it, this is a Very Hard Problem. This is (one of the
reasons) why there are so few converters from
As I understand it, this is a Very Hard Problem. This is (one of the
reasons) why there are so few converters from POV-Ray to mesh-based formats;
it's highly non-trivial to tesselate CSG.
POV-Ray is pretty fast. I had contemplated just rendering a bunch of
POV-Ray images to emulate a realtime
On 03/06/2011 05:02 PM, Albert Y. C. Lai wrote:
I propose that only {- -} is comment; that is, -- is an operator token
and not a marker of comments.
I'm curious to know why anybody thought that -- was a good comment
marker in the first place. (I'm curious because Haskell isn't the only
On 28/05/2011 08:06 PM, michael rice wrote:
/tmp/glib-0.11.22906/glib-0.11.2/Gtk2HsSetup.hs:190:70:
Couldn't match expected type `[PackageDB]'
with actual type `PackageDB'
Expected type: PackageDBStack
Actual type: PackageDB
In the sixth argument of `registerPackage', namely `packageDb'
In the
On 29/05/2011 02:52 PM, michael rice wrote:
Is this worth chasing down? I loaded the Haskell Platform, which I
assume has some graphics capability (Cairo?). Maybe my time would be
better spent getting familiar with that?
As far as I'm aware, the Haskell Platform doesn't come with any
On 29/05/2011 06:23 PM, Daniel Fischer wrote:
On Sunday 29 May 2011 19:14:57, Andrew Coppin wrote:
As far as I'm aware, the Haskell Platform doesn't come with any
graphics-related packages
I thought OpenGL was in the platform.
Uh... yes, you might be right about that. However, AFAIK you
On 18/05/2011 10:39 PM, Andrew Coppin wrote:
On 18/05/2011 05:28 AM, Don Stewart wrote:
I'm intrigued by the idea of Hackage docs that don't use Haddock.
This is basically the reason I asked. Currently Cabal assumes that
Haddock is the only tool of its kind. If somebody built a better
Haddock
On 26/05/2011 10:59 AM, Jacek Generowicz wrote:
Any comments on the relative efficiency of the above as compared to
A == B in the context of
data Foo = A | B | C | D | ... lots more ...
?
(I imagine that a Sufficiently Smart Compiler could reduce (==) ::
Person Person to just integer
On 26/05/2011 07:56 PM, Andrew Coppin wrote:
On 26/05/2011 10:59 AM, Jacek Generowicz wrote:
Any comments on the relative efficiency of the above as compared to
A == B in the context of
data Foo = A | B | C | D | ... lots more ...
?
(I imagine that a Sufficiently Smart Compiler could
On 19/05/2011 10:43 PM, Ketil Malde wrote:
Andrew Coppinandrewcop...@btinternet.com writes:
I'm trying to voice the opinion that there is such a thing as too many
libraries. The article I linked to explains part of why this is the
case, in a better way than I've been able to phrase it myself.
On 19/05/2011 11:00 PM, Daniel Peebles wrote:
I agree that from an end-user's perspective it isn't always a clear win,
but I do think that having a bunch of libraries (even ones that do the
same thing) an indicator of a healthy, active, and enthusiastic
community.
I won't argue with that. ;-)
On 19/05/2011 08:39 PM, Felipe Almeida Lessa wrote:
Regarding the Unicode problem, there is a standard solution today: use
the text package. Yes, you may use other libraries, but text is the
recommended one.
Is that true? Last I heard, there was still some debate about the
relative
This is basically the reason I asked. Currently Cabal assumes that
Haddock is the only tool of its kind. If somebody built a better
Haddock, you wouldn't be able to use it. (Unless you named the
executable haddock and made it accept the same command options.)
Or maybe support for that tool
On 18/05/2011 11:25 PM, Ivan Lazar Miljenovic wrote:
On 19 May 2011 08:09, Daniel Fischerdaniel.is.fisc...@googlemail.com wrote:
On Wednesday 18 May 2011 23:39:47, Andrew Coppin wrote:
(It also requires you to have somewhere to host, which not
everybody has.
Haskellwiki, bitbucket, github
http://www.winestockwebdesign.com/Essays/Lisp_Curse.html
Some of you might have seen this. Here's the short version:
Lisp is so powerful that it discourages reuse. Why search for and
reuse an existing implementation, when it's so trivially easy to
reimplement exactly what you want yourself?
On 19/05/2011 07:56 PM, Gilberto Garcia wrote:
I think what Andrew meant is that it's not a good idea to have big
pile of different implementations of the same library, and all trying
to solve the very same problem.
I'm glad somebody understood what I was trying to get at.
I'm not saying that
On 19/05/2011 08:39 PM, Stephen Tetley wrote:
Och Mr Coppin
Lisp is a fine language, but all Lisp essays you'll find on the
internet except Richard Gabriel's Worse is Better are absolute tosh.
This wasn't an attempt to bash Lisp.
This is about all those people who think having multiple
On 19/05/2011 08:58 PM, Don Stewart wrote:
This is classic community trolling behavior, Andrew.
And publicly calling somebody a troll isn't trolling behaviour?
I'm going to answer the rest of this off-list. I'm sure nobody else
wants to hear it.
On 19/05/2011 09:34 PM, vagif.ve...@gmail.com wrote:
Andrew, you are being non constructive.
It seems I'm being misunderstood.
Some people seem to hold the opinion that more libraries = better. I'm
trying to voice the opinion that there is such a thing as too many
libraries. The article I
Cannot deduce (Show x) from context (Show (x, y)).
Cannot deduce (Show y) from context (Show (x, y)).
Um... seriously?
From Prelude, we have
Show x, Show y = Show (x, y)
So clearly it works in the forward direction. But apparently not in the
reverse direction.
Is this a bug or a
On 19/05/2011 10:11 PM, Artyom Kazak wrote:
And I can declare an instance for (x, y) which does NOT implies (Show x):
instance Show (x, y) where
show _ = I'm tuple! Hooray!
Ah. So it's a feature.
Fortunately I refactored the program where this came up, so it's no
longer an issue. I just
On 18/05/2011 05:28 AM, Don Stewart wrote:
I'm intrigued by the idea of Hackage docs that don't use Haddock.
This is basically the reason I asked. Currently Cabal assumes that
Haddock is the only tool of its kind. If somebody built a better
Haddock, you wouldn't be able to use it. (Unless
On 16/05/2011 10:07 AM, Michael Vanier wrote:
Usually in monad tutorials, the = operator for the list monad is
defined as:
m = k = concat (map k m) -- or concatMap k m
but in the GHC sources it's defined as:
m = k = foldr ((++) . k) [] m
As far as I can tell, this definition is equivalent to
Both Hackage and Cabal seem to assume as a matter of course that I want
to use Haddock to generate all my documentation. Suppose I decide to
violate this assumption. Then what?
1. Is there some way I can include my own HTML documentation in the
package tarball and have Hackage/Cabal use it?
On 12/05/2011 06:14 PM, Grigory Sarnitskiy wrote:
How do I make my program stop whenever it gets somewhere NaN as a result during
a calculation? If there is no appropriate flag for ghc maybe there exist flags
for C to use in optc.
I don't want NaN to propagate, it is merely stupid, it should
On 10/05/2011 08:30 AM, Yitzchak Gale wrote:
I think the clearest way to write it is:
f = putStrLn . (++ - message received) . show . Main.id
You're serious??
If I were to describe to someone in words what this
function does, I would say something like: Apply Main.id,
turn it into a
On 08/05/2011 06:14 AM, Nicholas Tung wrote:
Dear all,
I'd like to write a function maybeShow :: a - Maybe String,
which runs show if its argument is of class Show.
This is surely an FAQ. Is the answer listed somewhere?
___
Haskell-Cafe
On 07/05/2011 09:10 AM, Gregory Collins wrote:
Linode. Can't recommend them highly enough.
If Linode is really the cheapest that the Internet has to offer, I'm
going to need to find a job that pays /significantly/ more money...
(I'm also not sure whether being billed in USD is possibly a
On 06/05/2011 07:16 PM, JP Moresmau wrote:
I use Amazon EC2 Free Tier. You can install Yesod/Warp easily enough
and it's fine for small traffic.
My understanding is that EC2 is only free for 1 year, after which you
pay full price. ($0.02/hour = $15/month if it's running full-time.)
On 05/05/2011 09:50 PM, Andrew Coppin wrote:
On 05/05/2011 01:32 AM, Albert Y. C. Lai wrote:
Just 5 weeks ago,
http://thread.gmane.org/gmane.comp.lang.haskell.cafe/86738/focus=87456
Did anyone see it?
Right. So the problem might be GTK+ v3?
Wrong.
Apparently the bundle I downloaded
OK, so strictly this is unrelated to Haskell as such. However, there's
enough people doing webby stuff with Haskell that some of you must have
wanted to run your code on a real, Internet-accessible web server. So
does anybody have any suggestions on which companies offer the most
favourable
On 05/05/2011 01:32 AM, Albert Y. C. Lai wrote:
Just 5 weeks ago,
http://thread.gmane.org/gmane.comp.lang.haskell.cafe/86738/focus=87456
Did anyone see it?
Right. So the problem might be GTK+ v3?
___
Haskell-Cafe mailing list
One of the benefits of a site like SO as a forum is the ability to
record and link to prior work, edit for technical errors, and easily
search and categorize past answers. It is also less prone to noise,
for those suffering from cafe overload.
I would also recommend SO.
My
Today I tried to install Gtk2hs. Big mistake!
Last time I tried it, it was quite easy. Now that it uses Cabal, even on
Windows you can compile this stuff from source fairly easily. It's just
that you have to fiddle with environment variables to make it find stuff.
However...
1. Since the
On 28/04/2011 03:21 PM, Chris Smith wrote:
On Thu, 2011-04-28 at 08:04 +0200, Bardur Arantsson wrote:
There's also the fact that using in-repo branches means that all the
tooling doesn't have to rely on any (fs-specific) conventions for
finding branches.
As someone who has admin'd a reasonably
This is because of a deliberate choice that was made by David Roundy.
In darcs, you never have multiple branches within a single darcs
repository directory tree.
Yes, this seems clear. I'm just wondering whether or not it's the best design
choice.
It seems to me to be a considerable insight.
On 24/04/2011 06:33 PM, Jason Dagit wrote:
On Sun, Apr 24, 2011 at 2:05 AM, Andrew Coppin
andrewcop...@btinternet.com mailto:andrewcop...@btinternet.com wrote:
So I was a little surprised to discover that... Darcs doesn't
actually support doing this. Darcs is only really interested
On 21/04/2011 02:36 AM, Conrad Parker wrote:
I thought the purpose of filing a bug report was to get things fixed?
The purpose of filing bug reports is to ensure that problems are not
forgotten. It allows the community (people like you) to have a useful
understanding of the problems that exist
I've discovered something interesting.
Darcs stores history as a partially-ordered set of changes. This is a
beautiful and elegant idea. In theory, this lets me apply any
combination of changes, possibly generating file versions which have
never actually existed before. (E.g., the new type
On 21/04/2011 11:16 PM, John Millikin wrote:
My chief complaint is that it's built on patch theory, which is
ill-defined and doesn't seem particularly useful. The
Bazaar/Git/Mercurial DAG model is much easier to understand and work with.
Possibly as a consequence of its shaky foundation, Darcs
I'm sure this must be a VFAQ, but... There seems to be universal
agreement that Darcs is a nice idea, but is unsuitable for real
projects. Even GHC keeps talking about getting rid of Darcs. Can anybody
tell me what the problems with Darcs actually are?
I notice that there's duplicate reports of the HTML documentation in the
Haskell Platform having chunks missing
Which ticket numbers are these? Trac allows one of them to be closed
as a duplicate. Perhaps you can do that, or at least provide those
details in email here.
When I get a minute
On 17/04/2011 11:29 AM, Erik de Castro Lopo wrote:
Hi all,
Trac pages aren't rendering correctly. It seems the HTTP server
can't find the CSS files. See below.
Cheers,
Erik
I'm glad it's not just me. Any danger of this being fixed someday?
I notice that there's duplicate reports of the HTML
A couple of questions:
1. Why is the existence of polymorphic seq bad?
2. Why would the existence of polymorphic rnf be worse?
3. How is pseq different from seq?
That is all...
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 11/04/2011 12:52 AM, Don Stewart wrote:
I'd like a proper FFI binding for getting at Stats.c dynamically. So I
can write programs that determine their own stats about the GC and so
on.
I have often wished that there was a much bigger API for interacting
with the RTS. Currently, you can
On 30/03/2011 08:18 PM, Bas van Dijk wrote:
It would also be great to have a package which combines the proper
encoding/decoding of filepaths of the system-filepath package with the
type-safety of the pathtype package:
http://hackage.haskell.org/package/pathtype
Oh sweet! I was just about to
*** Build multiple Cabal packages in parallel ***
http://hackage.haskell.org/trac/summer-of-code/ticket/1594
Many developers have multi-core machines but Cabal runs the build
process in a single thread, only making use of one core. If the build
process could be parallelized build times could be
I think we should have a wiki page somewhere which explains what all
the various Haskell-related terms mean. Terms like typing the knot
and finally tagless. (Not to mention Oleg rating...)
I have created such a page:
http://www.haskell.org/haskellwiki/Terms
Defining unlifted type without
On 17/03/2011 12:11 PM, Gábor Lehel wrote:
Necroing this thread because I just noticed there's a (rather old!)
bug report which covers much of the same ground and doesn't seem to
have been mentioned by anyone:
http://hackage.haskell.org/trac/ghc/ticket/1349
Right. So somebody else came up
Right. So somebody else came up with an idea similar to mine, but since
nobody could agree on anything more than a rough idea, nothing actually got
done...(?)
Well, I also got the sense that it would be more than a little
nontrivial to implement. Or at least, someone was talking about how it
The well-known ST monad uses an ingenious hack to make it impossible for
distinct ST computations to interact with each other.
Is there a way to do something similar so that I can create cursors
that reference a (mutable) container, and then write a function that
takes two cursor arguments
You could define a function:
withContainer ∷ (∀ s. Container s → α) → α
which creates a container, parameterizes it with an 's' that is only
scoped over the continuation and applies the continuation to the
created container.
Hmm, yes. That will work, but I wonder if there's some way of doing
On 15/03/2011 11:35 PM, Brent Yorgey wrote:
I am pleased to announce that the special Poetry and Fiction Edition
of The Monad.Reader is now available [1]. Enjoy!
I love exercise 8, write a complete computer game using this idea (!)
___
Haskell-Cafe
The other day I saw the green field Haskell discussion on Reddit. Of
course, I could give you a very long list (ha!) of things that I would
change about Haskell. (This would probably begin with expunging
Monad.fail with extreme prejudice...) But there's one particular feature
which is
Hmm, yes. That will work, but I wonder if there's some way of doing this
that doesn't limit the scope of the container to one single span of
code...
You can write helper functions which take containers as argument by
parameterizing these helper functions over s:
takesTwoContainers :: Container
On 16/03/2011 03:05 PM, Brent Yorgey wrote:
This kind of knot-tying approach is nice for static graphs.
I think we should have a wiki page somewhere which explains what all the
various Haskell-related terms mean. Terms like typing the knot and
finally tagless. (Not to mention Oleg
On 07/03/2011 04:39 PM, Daniel Fischer wrote:
That sounds nice, so I thought I'd try out leksah again.
Unfortunately, the dependencies rule out GHC-7
Maybe someone could try relaxing the bounds and build it with GHC-7, and -
if it works - upload a new version?
(I could try if I get a go-ahead
On 06/03/2011 11:46 AM, Andrew Coppin wrote:
On 06/03/2011 01:22 AM, Don Stewart wrote:
P.S. you can help by testing the installers, and reporting issues on
the HP trac and mailing list. The candidate installers are here:
http://code.galois.com/darcs/haskell-platform/download-website
On 08/03/2011 08:57 PM, Don Stewart wrote:
We have plenty of testers on the haskell-platform@ list. If you're
interested, you can join there to discuss results.
By definition the test installers are not yet ready for haskell-cafe@
consumption.
Oh, right. There's a mailing list? I wasn't aware
On 06/03/2011 01:22 AM, Don Stewart wrote:
P.S. you can help by testing the installers, and reporting issues on
the HP trac and mailing list. The candidate installers are here:
http://code.galois.com/darcs/haskell-platform/download-website/
Is there some way to navigate to this page from
On 03/03/2011 07:12 AM, Eugene Kirpichov wrote:
However, now I actually use vim - but that's because I'm scared of
trying to install Leksah on Windows (maybe it isn't hard, I haven't
tried) and because I'm only doing rather tiny things with Haskell at
the moment.
FWIW, last time I tried,
1 - 100 of 1631 matches
Mail list logo
