While ghc 6.12 finally has proper locale support, core packages (such as
unix) still use withCString and therefore work incorrectly when argument
(e.g. file path) is not ASCII.
Is someone already working on this? If it's just a matter of time and
manpower I can help but I need some guidance from
I would expand your definition of monadic to:
able to syntactically transformed so as to be put in a sequence where an
operation can be altered by the results of the operations preceeding it.
IMO your definition matches more applicative.
2010/6/18 Alexander Solla a...@2piix.com
On Jun 17,
???
What does exactly swing do ?
2010/6/18 Bulat Ziganshin bulat.zigans...@gmail.com
Hello Martin,
Thursday, June 17, 2010, 11:02:31 PM, you wrote:
But what if I want to apply a list of functions to a single argument. I
can
one more answer is swing map:
Hello,
I saw on the haskell wikibook that coroutines could be implemented by using
continuations :
http://en.wikibooks.org/wiki/Haskell/Continuation_passing_style#Example:_coroutines(unhappily,
the section is empty)
Since I'm actually learning the wonders of continuations, I just wonder :
how ?
On 19/06/10 10:36, Yves Parès wrote:
Hello,
I saw on the haskell wikibook that coroutines could be implemented by
using continuations :
http://en.wikibooks.org/wiki/Haskell/Continuation_passing_style#Example:_coroutines
(unhappily, the section is empty)
Since I'm actually learning the
Hello all,
In light of Google Summer of Code, we are proud to release the first
version of BlazeHtml today. It's a 0.1 release, so beware of bugs!
Nevertheless, we encourage you to try it out. You can find more
information:
- On the website: http://jaspervdj.be/blaze
- On hackage:
Hi Claus,
On 06/15/2010 05:57 PM, Claus Reinke wrote:
If you go this route, I will shamelessly promote hothasktags instead
of ghci. It generates proper tags for qualified imports.
What do you mean by proper here?
I think Luke means that if you use qualified names then hothasktags can
give
Sebastian Fischer wrote:
Consider the given Definitions of `CMaybe r a` with
`fromCMaybe`, `mzero`, `mplus`, `orElse`, and additionally:
toCMaybe :: Maybe a - CMaybe r a
toCMaybe a = CMaybe (\k - a = k)
getCMaybe :: CMaybe r a - (a - Maybe r) - Maybe r
getCMaybe (CMaybe
On 19 June 2010 12:50, Jasper Van der Jeugt jasper...@gmail.com wrote:
Hello all,
In light of Google Summer of Code, we are proud to release the first
version of BlazeHtml today. It's a 0.1 release, so beware of bugs!
Nevertheless, we encourage you to try it out. You can find more
Hey Chris,
Here's an start [1]. However, I'm quite sure the type signature of
`blazeTemplate` is not really what you want, since you have no access
to the snap environment that way. Hence, I'm looking forward to see
your solution :-)
[1]:
Hi all,
I'm working my way through the lecture notes to the Finally Tagless
course, available from:
http://okmij.org/ftp/tagless-final/course/index.html
As usual at every round of doing so, I think it's my 4th, I discover
something new, something that hadn't occurred to me
Hi Günther
The code in the two serialize modules looks very close to Konstantin
Laufer's functional variation of the visitor pattern:
http://webpages.math.luc.edu/~laufer/papers/mixins03.pdf
This open recursion style - is used to get inheritance /
extensibility - there is a more recent paper by
On Sat, 2010-06-19 at 03:12 +0200, Henning Thielemann wrote:
Maciej Piechotka schrieb:
1. Glueing a few highier level, object-oriented libraries if it is just
glueing.
2. (Currently) AFAIK real-time applications although it is rather
property of GHC GC then the language itself
In
On 19 June 2010 16:06, Maciej Piechotka uzytkown...@gmail.com wrote:
The problem is that:
- GHC GC can run at any moment
- It is stop-the-world GC
- There is no upper limit on how long GHC GC will run
I have no experience with real-time applications however.
Curt Sampson had an
It helps me understand better, but would you have some simple code that
would do that ?
2010/6/19 Paul Johnson p...@cogito.org.uk
On 19/06/10 10:36, Yves Parčs wrote:
Hello,
I saw on the haskell wikibook that coroutines could be implemented by
using continuations :
Hi Stephen,
I'm glad I asked. This sure sounds more interesting than I had
anticipated. Is this an old hat for your off-the-shelf haskeller or
something only found in the more seasoned haskellers tool box?
I think it's pretty much the first time I encounter it.
Günther
Am 19.06.10 17:01,
Hello, in case someone else hits this problem I was able to fix it by
installing the latest haskell platform via macports.
- I uninstalled ghc sudo /Library/Frameworks/GHC.framework/Tools/Uninstaller
- deleted ~/.ghc and ~/.cabal
- did a sudo port install haskell-platform (be prepared for this to
Actually, it looks like MediaWiki:Newarticletext probably needs to be
edited as well since that's what you see when you click through a red
link. The others are for the top text after a search using Go and
Search respectively.
Unfortunately, this MediaWiki install doesn't appear to have interwiki
Hi Christian,
Is there a specific library you're having trouble with?
One reason library authors can prefer explicit export lists is that they can
hide implementation details, which can then make it easier to change in the
future without breaking the users of the library.
Antoine
Cc'ing the
On Sat, Jun 19, 2010 at 2:45 PM, Mike Dillon m...@embody.org wrote:
Actually, it looks like MediaWiki:Newarticletext probably needs to be
edited as well since that's what you see when you click through a red
link. The others are for the top text after a search using Go and
Search respectively.
Hi Günther
I haven't seen open recursion used in any libraries I'm familiar with,
though as its not a technique I've used myself I'm not really
trained to spot it.
There's another paper by William Cook (and Daniel Brown) were the use
is explicit (at least initially - Sections 2.2 2.3):
On Fri, Jun 18, 2010 at 5:57 PM, Ryan Ingram ryani.s...@gmail.com wrote:
Related to this, I really would like to be able to use arrow notation
without arr; I was looking into writing a circuit optimizer that
modified my arrow-like circuit structure, but since it's impossible to
look inside
Antoine Latter aslat...@gmail.com writes:
One reason library authors can prefer explicit export lists is that they can
hide implementation details, which can then make it easier to change in the
future without breaking the users of the library.
Also, with respect to cross-module optimisation,
Günther Schmidt wrote:
Hi Stephen,
I'm glad I asked. This sure sounds more interesting than I had
anticipated. Is this an old hat for your off-the-shelf haskeller or
something only found in the more seasoned haskellers tool box?
I think it's pretty much the first time I encounter it.
It
24 matches
Mail list logo