#3300: System.IO and System.Directory functions not Unicode-aware under Windows
+---
Reporter: shu |Owner: simonmar
Type: bug | Status: new
Priority:
#3307: System.IO and System.Directory functions not Unicode-aware under Unix
---+
Reporter: YitzGale | Owner:
Type: bug| Status: new
Priority:
#3307: System.IO and System.Directory functions not Unicode-aware under Unix
---+
Reporter: YitzGale | Owner:
Type: bug| Status: new
Priority:
#3310: `show BlockedIndefinitely` should not equal `show BlockedOnDeadMVar`
-+--
Reporter: enolan| Owner:
Type: feature request | Status: new
Priority:
#3311: web page direct me to a tarball that can't build
-+--
Reporter: zooko | Owner:
Type: bug | Status: new
Priority: normal|
#3312: no darcs and no VERSION file
-+--
Reporter: zooko | Owner:
Type: bug | Status: new
Priority: normal| Component:
Duncan Coutts wrote:
Niklas's and my point is
that the list of language extensions in Language.Haskell.Exceptions
are differences from H98 so it should be MonoPatBinds to get the
difference not NoMonoPatBinds to restore H98.
In practise, since ghc uses MonoPatBinds by default it'd
On 17/06/2009 10:14, Peter Hercek wrote:
Hi GHC and VI users,
I got frustrated with vi tags not working after some unrelated code is
edited in a source file. Moreover non-exported top level declarations
were not available in vi tags file. Here is an attempt to fix it:
Hello,
I was experimenting with compiler flags trying to tune some
performance and got something unexpected with the -fno-pre-inlining
flag. I was hoping somebody here might be able to clarify an issue
for me.
When compiled with -fno-pre-inlining, my test program gives a
different result than
John
| When compiled with -fno-pre-inlining, my test program gives a
| different result than compiled without (0.988... :: Double, compared
| to 1.0). It's numerical code, and was originally compiled with
That's entirely unexpected. I am very surprised that turning off pre-inlining
a) affects
Simon Marlow wrote:
I'm an infrequent etags user, and I never use ctags.
The problem is I do not know whether I should try to improve etags too.
So far I tried to keep them the same they were. The only difference I
know about is that if more tags happen to exist on the same source line
then
Simon,
Thanks for the quick reply, and also the link. I'll be sure to read
it. I don't know what pre-inlining is; I was testing different
compiler options with acovea, which indicated the performance boost.
When I tried it myself, I noticed the differing value.
I'm pretty sure the affected
In general I think there is a reasonable case for special treatment for
exceptions to H98 that have been accepted for haskell-prime.
I'm not sure I agree with this. I'm not involved in the H' process,
but it was my impression that the general state of affairs was a move
towards a modularization
Duncan Coutts wrote:
In practise, since ghc uses MonoPatBinds by default it'd mean that
people who want to get back to H98 would need to use:
ghc-options: -XNoMonoPatBinds
Because the extensions field is additive, not subtractive. Using the
name MonoPatBinds allows other compilers to
hmm, that's annoying. Is it feasible for the extensions field to allow both
addition and subtraction that override compiler defaults? (How does it work
in LANGUAGE pragmas -- would NoMonoPatBinds still work in one of them?)
It would only work during the period of deprecation, and would
Hi all,
I've had a curious bug report [1] for haskell-src-exts, pointing to a
difference in behavior between haskell-src-exts and GHC. Digging
further, it seems to me like GHC is behaving quite strange in this
instance, but since we don't have formal documentation for the
extensions I can't be
2009/6/18 Niklas Broberg niklas.brob...@gmail.com:
GHC:
ctypedoc :: { LHsType RdrName }
: 'forall' tv_bndrs '.' ctypedoc
| context '=' ctypedoc
| gentypedoc
Notice GHC's recursive call to ctypedoc after the =. I have no idea
what the doc suffix on the production is
You're not looking at the latest version of the code. I'm guessing
you're looking at the stable version instead of the HEAD.
Indeed, I'm looking at the source distribution for 6.10.3, since
that's the reference version I use to test the files.
ctypedoc :: { LHsType RdrName }
: 'forall'
On Jun 16, 2009, at 05:19 , Simon Peyton-Jones wrote:
(B) data RecTest a where
B :: { arg :: a } - RecTest a
For what it's worth (considering that I have yet to actually use
GADTs), (A) looks wrong to me because there is type information before
the actual type. (B) looks kinda
Am Mittwoch, 17. Juni 2009 11:05 schrieb Malcolm Wallace:
The problem with a top-level namespace like FRP is that it is a cryptic
acronym: it means nothing to a novice, and may be easily confused with
other acronyms by an expert. I believe top-level names should _at_the_
_very_least_ be
Am Mittwoch, 17. Juni 2009 11:29 schrieb Anton van Straaten:
Malcolm Wallace wrote:
The problem with a top-level namespace like FRP is that it is a cryptic
acronym: it means nothing to a novice, and may be easily confused with
other acronyms by an expert. I believe top-level names should
I have just uploaded haskell-src-exts-0.5.4 to hackage, which is 1.0.0
rc2. Thanks a lot to those who tested the previous version, and please
continue to test and report!
Another day, another release candidate. Please see
haskell-src-exts-0.5.5, 1.0.0 rc3. Thanks a lot to all reports, and
On Thu, Jun 18, 2009 at 12:26 AM, Jason Dagit da...@codersbase.com wrote:
On Wed, Jun 17, 2009 at 9:53 PM, Vasili I. Galchin vigalc...@gmail.comwrote:
Hello,
Let me change the subject ... I think everybody understood my
thrust but let me make more provocative. Don, please let me
I am pleased to announce the first release of hyena, a library for building
web servers, based on the work on iteratee style I/O by Oleg Kiselyov.
The library allows you to create web servers that consume their input
incrementally, without resorting to lazy I/O. This should lead to more
Jason Dusek jason.du...@gmail.com writes:
Why don't we have a picture of a cool dinosaur instead?
Something cool because the last heat of life went out of it
65 million years ago?
--
Jón Fairbairn jon.fairba...@cl.cam.ac.uk
2009/6/18 Jon Fairbairn jon.fairba...@cl.cam.ac.uk:
Jason Dusek jason.du...@gmail.com writes:
Why don't we have a picture of a cool dinosaur instead?
Something cool because the last heat of life went out of it
65 million years ago?
made with secret dinosaur technology
Thu
I am pleased to announce the first release of Data.FMList, lists
represented by their foldMap function:
newtype FMList a = FM { unFM :: forall b . Monoid b = (a - b) -
b }
It has O(1) cons, snoc and append, just like difference lists.
Fusion is more or less built-in, for f.e. fmap and (=),
Hello minh,
Thursday, June 18, 2009, 11:17:07 AM, you wrote:
Why don't we have a picture of a cool dinosaur instead?
Something cool because the last heat of life went out of it
65 million years ago?
made with secret dinosaur technology
made with dinosaur technology :)))
--
Best
I wrote:
Rules for usernames are the same as rules for particle titles,
erm, article titles
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 16/06/2009 21:19, Bulat Ziganshin wrote:
Hello Simon,
Tuesday, June 16, 2009, 5:02:43 PM, you wrote:
I don't know how getArgs fits in here - should we be decoding argv using
the ACP?
myGetArgs = do
alloca $ \p_argc - do
p_argv_w- commandLineToArgvW getCommandLineW p_argc
On Jun 18, 2009, at 9:57 AM, Sjoerd Visscher wrote:
I am pleased to announce the first release of Data.FMList, lists
represented by their foldMap function: [...]
http://hackage.haskell.org/package/fmlist-0.1
cool!
Just for fun: a derivation translating between different formulations
of
Hello Simon,
Thursday, June 18, 2009, 1:22:30 PM, you wrote:
myGetArgs = do
Presumably we'd also have to remove the +RTS ... -RTS in Haskell if we
did this, correct?
yes, it's long-standing in my own to-do list :)
--
Best regards,
Bulat
Johan Tibell wrote:
I am pleased to announce the first release of hyena, a library for building
web servers, based on the work on iteratee style I/O by Oleg Kiselyov.
The library allows you to create web servers that consume their input
incrementally, without resorting to lazy I/O. This
Hi there,
I mailed to this list in May
(http://www.haskell.org/pipermail/haskell-cafe/2009-May/062126.html)
with no answer at all. So I wrote a smaller program to demonstrate my
problem/question. Maybe now someone can help me now.
I wrote a small program that does nothing but listening
On Wed, 2009-06-17 at 21:26 -0500, Jake McArthur wrote:
Jon Strait wrote:
I'm reading the third (bind associativity) law for monads in this form:
m = (\x - k x = h) = (m = k) = h
Arguably, that law would be better stated as:
(h = k) = m = h = (k = m)
This wouldn't be so
OK, I think I went off on a tangent that isn't very useful anyway
thanks
-Keith
On Wed, Jun 17, 2009 at 6:32 PM, Lennart
Augustssonlenn...@augustsson.net wrote:
The creators of Haskell didn't pick any particular representation for numbers.
(Well, literals are kind of In..tegers.) You can pick
Paul,
Did you mean to say that const is strict in its first param and
lazy in its second (since const _|_ y = _|_)? Also, can you explain
your notation, how does a - {S} - b -{L} a indicate the
strictness? Why not just {S} a - {L} b - a?
I'm sorry for the confusion. Indeed, const, as the
No, I think it's extremely useful. It highlights that numbers can
both be lazy and strict, and that the so called useless lazy sum, is
in fact, useful.
Bob
On 18 Jun 2009, at 13:29, Keith Sheppard wrote:
OK, I think I went off on a tangent that isn't very useful anyway
thanks
-Keith
On
Dear reader,
I wonder whether there is a 'general' working solution to include files
within a parsec parser. Without the need of unsafePerformIO.
Appending an example program, using unsafePerformIO.
Thanx for reading.
Greetings,
Leonard Siebeneicher
--- Begin: experiment.hs ---
import
Leonard Siebeneicher wrote:
Dear reader,
I wonder whether there is a 'general' working solution to include files
within a parsec parser. Without the need of unsafePerformIO.
At least in parsec 2, I don't think so. Our solution was to read in the
main file, tokenise it (using Alex),
Thomas Davie wrote:
No, I think it's extremely useful. It highlights that numbers can both
be lazy and strict, and that the so called useless lazy sum, is in
fact, useful.
But lazy sum should have beed defined in terms of foldr, not foldl. And
foldl is not strict enough for strict sum.
I don't think anyone is calling it useless at this point. I could not
see a use for it initially and it was quickly pointed out that there
are in fact some infrequent use cases where a lazy sum is the best
option. I think this is more a discussion about principle of least
surprise or which use
Hans van Thiel wrote:
The only place I've ever seen Kleisli composition, or its flip, used is
in demonstrating the monad laws. Yet it is so elegant and, even having
its own name, it must have some practical use. Do you, or anybody else,
have some pointers?
I only just started finding places to
I had seen it before, and a bit of Googling turned up this:
The monad laws can be written as
return = g == g
g = return == g
(g = h) = k == g= (h = k)
So, functions of type a - m b are the arrows of a category with
(=) as composition,
and return as identity.
Jake McArthur wrote:
Generally, you can transform anything of the form:
baz x1 = a = b = ... = z x1
into:
baz = a = b = ... = z
I was just looking through the source for the recently announced Hyena
library and decided to give a more concrete example from a real-world
project.
What is enum2 doing in all of this - it appears to be ignored.
2009/6/18 Jake McArthur jake.mcart...@gmail.com:
Jake McArthur wrote:
Generally, you can transform anything of the form:
baz x1 = a = b = ... = z x1
into:
baz = a = b = ... = z
I was just looking through the source
Clicking on the source code link reveals that enum2 is used in the where
clause. It's not important to the transformation that Jake was performing.
In essence, = is the monadic version of . (function composition) and
as explained, it can be used to do some pointfree-like programming in
the
On Thu, 2009-06-18 at 04:47 +0300, Yitzchak Gale wrote:
I wrote:
OK, would you like me to reflect this discussion in tickets?
Let's see, so far we have #3300, I don't see anything else.
Do you want two tickets, one each for WIndows/Unix? Or
four, separating the FilePath and getArgs
On Thu, Jun 18, 2009 at 9:14 AM, Gleb Alexeyev gleb.alex...@gmail.comwrote:
Thomas Davie wrote:
No, I think it's extremely useful. It highlights that numbers can both be
lazy and strict, and that the so called useless lazy sum, is in fact,
useful.
But lazy sum should have beed defined in
Ryan Trinkle schrieb:
Hi all,
I'm interested in starting a mailing list on haskell.org
http://haskell.org. Who should I talk to about such things?
Is it a mailing list related to a project? Then you may request a
project on community.haskell.org, then you can start a mailing list at
I have been exploring a weak form of runtime strictness analysis in a
tracing JIT project of my own in the spirit of TraceMonkey. Basically a
tracing JIT doesn't compile blocks of code but instead once a tracing point
has been passed often enough, it starts a trace from that point logging the
Hi,
ParsecT with m=IO? Your 'do' block would become:
do
i - getInput
included - liftIO readI -- import Control.Monad.Trans for liftIO
setInput included
a - my_str
setInput i
b - my_str
return $ a ++ //\n\n ++ b
where
readI =
On Thu, 2009-06-18 at 08:34 -0500, Jake McArthur wrote:
[snip]
So, `(=)` is just like `($)` except for the information carried along
by the monad.
Anyway, the obvious thing to do is to drop the `x` from both sides of
the definition for `bar`. To do that with `foo` earlier, we had to
On Wed, Jun 17, 2009 at 7:30 PM, GüŸnther Schmidtgue.schm...@web.de wrote:
Hi all,
you have come up with so many solutions it's embarrassing to admit that I
didn't come up with even one.
I have the similarly difficulties, but I found to understand some of
these answers,
equational reasoning
2009/6/18 Edward Kmett ekm...@gmail.com:
What is interesting is in a lazy setting, if you are tracing a bytecode
representation that knows about allocation and thunks, you can do some
additional optimizations in here. If on every path to a side exit or the end
of the loop you find that the
However it does not work as I expected. I ´m interested in memory
management.
I though that
ghci let l= [1..100]
ghci foldl' (+) 0 l
would produce a stack overflow, since the list can not be freed, because l
points to the beginning of the list
however it succeed
My conclussion is that, in
On Thu, Jun 18, 2009 at 6:38 PM, Alberto G. Coronaagocor...@gmail.com wrote:
My question is: Why the process does not grow also in the lazy case and
instead produces a stack overflow inmediately?
This question is answered in detail on the Wiki
Very informative. The list is in the heap but the lazy sum of foldl is in
the stack. ok.I suppose that all tail recursive functions are detected by
the strictness analysis.
2009/6/18 Chaddaï Fouché chaddai.fou...@gmail.com
On Thu, Jun 18, 2009 at 6:38 PM, Alberto G. Coronaagocor...@gmail.com
Hans van Thiel wrote:
Just to show I'm paying attention, there's an arrow missing, right?
(.) ::(b - c) - (a - b) - (a - c)
Correct. I noticed that after I sent it but I figured that it would be
noticed.
I also used () where I meant (=) at the bottom. They are
Hi
I couldn't come up with a better subject than this one, so anyways...
I have a small program which spawns a subprocess. However, when I hit
C-c, the subprocess won't die, instead it will just keep running until
it's done or until I kill it. I've looked around in System.Process for
something
Hello,
I'm trying to use MySQL from Haskell but it seems impossible for me to
install one of the MySQL packages on my Windows XP machine.
First I tired to install hsql-mysql-1.7.1 on GHC 6.10.3 but installing
haskelldb-hsql failed with a hidden package error. So I added the
old-time package
Quoth Deniz Dogan deniz.a.m.do...@gmail.com,
I have a small program which spawns a subprocess. However, when I hit
C-c, the subprocess won't die, instead it will just keep running until
it's done or until I kill it. I've looked around in System.Process for
something suitable for my needs, but
Daniel Peebles pumpkingod at gmail.com writes:
My solution attempted to exploit this using Numeric.showIntAtBase but
failed because of the lack of 0 prefixes in the numbers. If you can
find a simple way to fix it without duplicating the showIntAtBase
code, I'd be interested!
Another
Marciej,
I went the HDBC route and got the same problem. Although it does not seem to
be officially blessed, try installing the time-1.1.3 package. It's working
for me at least, which I know is a dubious recommendation.
Also, I am currently using the hdbc-odbc package for accessing MySQL. I
On Thu, 2009-06-18 at 23:57 +0800, Lee Duhem wrote:
[...] I have prepared a blog post for how
I worked out some of these answers, here is the draft of it, I hope it
can help you too.
Nice post! Certainly, pen-and-paper reasoning like this is a very good
way to develop deeper intuitions.
I have just uploaded haskell-src-exts-0.5.4 to hackage, which is 1.0.0
rc2. Thanks a lot to those who tested the previous version, and please
continue to test and report!
Another day, another release candidate. Please see
haskell-src-exts-0.5.5, 1.0.0 rc3. Thanks a lot to all reports, and
On Fri, Jun 19, 2009 at 6:17 AM, Matthew Brecknellhask...@brecknell.org wrote:
On Thu, 2009-06-18 at 23:57 +0800, Lee Duhem wrote:
[...] I have prepared a blog post for how
I worked out some of these answers, here is the draft of it, I hope it
can help you too.
Nice post! Certainly,
Hi all,
I'd like to call Haskell functions from C and receive its output as a
string. Is compiling a Haskell program to C using ghc -C HaskellSource.hs
the preferred method of doing this?
Regards,
Greg
___
Haskell-Cafe mailing list
On Jun 17, 2009, at 11:54 , .shawn wrote:
mapTreeM action (Leaf a) = do
lift (putStrLn (Leaf ++ show a))
b - action a
return (Leaf b)
mapTreeM :: (MonadTrans t, Monad (t IO), Show a) = (a - t IO a1) -
Tree a - t IO (Tree a1)
Why does the type signature of mapTreeM look like
Never mind, I Found The Manual. (FTFM)
http://www.haskell.org/ghc/docs/latest/html/users_guide/win32-dlls.html
On Fri, Jun 19, 2009 at 12:51 PM, Greg Santucci thecodewi...@gmail.comwrote:
Hi all,
I'd like to call Haskell functions from C and receive its output as a
string. Is compiling a
I'm having some trouble with excessive memory use in a program that uses
a lot of IORefs. I was able to write a much simpler program which
exhibits the same sort of behavior. It appears that modifyIORef and
writeIORef leak memory; perhaps they keep a reference to the old
value. I tried
It looks offhand like you're not being strict enough when you put
things back in the IORef, and so it's building up thunks of (+1)...
With two slight mods:
go 0 = return ()
go n = do modifyIORef ior (+1)
go (n-1)
--
go 0 = return ()
go n = do modifyIORef ior (\ x -
I'm having some trouble with excessive memory use in a program that uses
a lot of IORefs. I was able to write a much simpler program which
exhibits the same sort of behavior. It appears that modifyIORef and
writeIORef leak memory; perhaps they keep a reference to the old
value. I tried
Hello,
Haskell packages on Hackage can be hosted anywhere, yes?
If a Haskell package is hosted on Hackage, how often is it backed up?
Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Thu, Jun 18, 2009 at 9:55 PM, Ross Mellgren rmm-hask...@z.odi.ac wrote:
It looks offhand like you're not being strict enough when you put things
back in the IORef, and so it's building up thunks of (+1)...
With two slight mods:
go 0 = return ()
go n = do modifyIORef ior (+1)
D'oh, yeah that is better. You know, I actually had that and had
expanded it because I was going to seq both the input and the result
of the (+1), but punted on it and didn't switch back to the more
compact format.
-Ross
On Jun 19, 2009, at 12:45 AM, Luke Palmer wrote:
On Thu, Jun 18,
Luke Palmer wrote:
On Thu, Jun 18, 2009 at 9:55 PM, Ross Mellgren rmm-hask...@z.odi.ac
mailto:rmm-hask...@z.odi.ac wrote:
It looks offhand like you're not being strict enough when you put
things back in the IORef, and so it's building up thunks of (+1)...
With two slight mods:
Hi,
I am learning it following the very few documents on its site. Well,
I failed, with the import modules, I still cannot compile it. The
error is on T.*.
6 import Database.HaskellDB.HDBC.SQLite3
7 import Database.HaskellDB
8 import Database.HaskellDB.DBSpec
9 import
78 matches
Mail list logo
