Pierre-Etienne Meunier wrote:
Does it still work with :
writeFile output $! process inp
You're right, that changes things. Then the program prints:
loop
That would have given it away, of course. :)
Regards,
Yitz
___
Haskell-Cafe mailing list
Sebastian Fischer wrote:
process = process
Nice!
What about the other part of the solution:
What is the cause of the error?
Of course, the cause is the black hole. But why is it not reported?
Hmm. On second thought, perhaps it was a good idea after all
that I did not exclude GHC team
Lennart Augustsson wrote:
So it's a bug in the garbage collector. It's closing a handle that
clearly is still reachable, otherwise this would not have happened.
Simon Marlow wrote:
The handle is in fact not reachable from the roots, because the thread that
points to it is also not
Sean Leather wrote:
Which one do you use for strings in HTML or XML in which UTF-8 has become
the commonly accepted standard encoding?
UTF-8 is only becoming the standard for non-CJK languages.
We are told by members of our community in CJK countries
that UTF-8 is not widely adopted there, and
Sean Leather wrote:
So then, what is the standard?
...I also noticeably don't see UTF-16.
Right there are a handful of language-specific 16-bit encodings
that are popular, from what I understand.
So, if this is the case, then a similar question still arises for CJK text:
What format/library
Bryan O'Sullivan wrote:
In general, Unicode uptake is increasing rapidly:
http://googleblog.blogspot.com/2010/01/unicode-nearing-50-of-web.html
These Google graphs are the oft-quoted source of
Unicode's growing dominance. But the data for those graphs
is taken from Google's own web indexing.
Ketil Malde wrote:
I haven't benchmarked it, but I'm fairly sure that, if you try to fit a
3Gbyte file (the Human genome, say¹), into a computer with 4Gbytes of
RAM, UTF-16 will be slower than UTF-8...
I don't think the genome is typical text. And
I doubt that is true if that text is in a CJK
Michael Snoyman wrote:
Regarding the data: you haven't actually quoted any
statistics about the prevalence of CJK data
True, I haven't seen any - except for Google, which
I don't believe is accurate. I would like to see some
good unbiased data.
Right now we just have our intuitions based on
Ketil Malde wrote:
I'd point out that it seems at least as unfair to optimize for CJK at
the cost of Western languages.
Quite true.
[...speculative calculation from which we conclude that]
a given document translated
between Chinese and English should occupy roughly the same space in
Version 0.1.1 of the timezone-olson package is now
available on Hackage.
http://hackage.haskell.org/package/timezone-olson
The timezone-olson package provides a parser and renderer
for binary Olson timezone files whose format is specified
by the tzfile(5) man page on Unix-like systems. These
Michael Snoyman wrote:
[1] http://hackage.haskell.org/package/mime-mail
Great news! This is an important package.
It's obviously very preliminary, though. This is not
trivial to get right - look at the long and colorful
history of the Python email library, detailed on the
first page of the
Anatoly Yakovenko wrote:
I am trying to figure out how to use this library, seems like this should work
Data.Time.ZoneInfo...
Have you looked at my timezone-olson package?
I wrote it as an alternative to Data.Time.ZoneInfo.
I think it is more flexible, and better integrated with
Data.Time.
I wrote:
2. mailHeaders should have an Ord instance that
compares case-insensitively, though the underlying
Strings should remain Strings.
I really meant Eq instance - which then affects the Ord
instance, too. Sorry.
wren ng thornton wrote:
What is the intended use case? Since many uses of
I'm using Safari on Snow Leopard.
On the Browse Users page on Haskellers,
there are little buttons that look like number spinners
on the two numerical fields, like Using Haskell since...
When I press one of those, the number
-1.7976931348623157e+308 appears in the field.
That must be Lennart.
Jon Fairbairn wrote:
I'm probably terribly out of date with this, so I wonder if
anyone can save me the bother of working out what the
/preferred/ libraries are for (a) determining the
last-modified-time of a file or directory and (b) manipulating
the resulting time datum.
I can find
Michael Snoyman wrote:
* Move System.Locale into the time package, bumping version number to 1.3.
* Bump old-locale to 1.1 and have it simply re-export System.Locale
from time. (Maybe we don't actually need to make that bump, 1.0.1 may
be sufficient.)
* Bump old-time to 2.0 (make it clear
José Romildo Malaquias wrote:
Web browsers like Firefox and Opera does not seem to have the same
problem with this web page.
I would like to be able to download this page from Haskell.
Hi Romildo,
This web page serves the head, including a lot of JavaScript,
and the first few hundred bytes of
Albert Y. C. Lai wrote:
...truncates when the web server chooses the identity encoding
The server chooses identity when
your request's Accept-Encoding field specifies identity or simply your
request has no Accept-Encoding field
Excellent work!
My methodology of discovering and confirming
Eugene Kirpichov wrote:
I looked at a couple pages of mine...
and looks
like the vast majority of images are not displaying.
This probably has to do with moving the wiki to the
new server during the past few days. I forwarded your
email to the admin team there for them to have a look.
On Sat, Nov 20, 2010 at 4:55 PM, Marcelo Sousa wrote:
I'm having currently a problem with System.Directory in my mac os.
System Version: Mac OS X 10.6.5
Kernel Version: Darwin 10.5.0
Prelude System.Directory let dirTest = do {dir - getCurrentDirectory;
doesDirectoryExist dir}
Prelude
Marcelo Sousa wrote:
I'm having currently a problem with System.Directory in my mac os.
Prelude System.Directory let dirTest = do {dir - getCurrentDirectory;
doesDirectoryExist dir}
Prelude System.Directory dirTest
False
I.e., System.Directory.doesDirectoryExist always
returns False.
I
This is a belated announcement of a package I uploaded to
hackage last week.
When processing a large input stream, one of the most important
techniques is to split the input into smaller pieces and process
each piece separately.
If that large input stream happens to be a lazy bytestring,
the
Hi,
Sorry, I haven't been reading the cafe for a few days,
so I just saw this thread.
Erik de Castro Lopo wrote:
I tried sending mail to the haskell-llvm mailing list ( AT
projects.haskell.org) several days ago and today I received a bounce
message. Looking into the issue a little
Michael Rice wrote:
-- comb is a combinator for sequencing operations that return Maybe
comb :: Maybe a - (a - Maybe b) - Maybe b
comb Nothing _ = Nothing
comb (Just x) f = f x
comb is essentially the same as something in the Prelude:
it is just (=) specialized to Maybe.
(=) :: Monad m = m
I hereby propose that XNoMonomorphismRestriction be
the default in GHCi. I submitted a ticket:
http://hackage.haskell.org/trac/ghc/ticket/3202
Note that I am NOT expressing any opinion about
MR in general - just about what the default should
be in interactive GHCi sessions only.
Please read my
Simon Marlow wrote:
Care to submit a patch to put this in System.Directory, or better still
put the relevant functionality in System.Win32 and use it in
System.Directory?
Bulat Ziganshin wrote:
now getDirectoryContents return ACP (ansi code page) names so openFile
works for files 1) and 2).
Thomas Davie wrote:
Not at all, as discussed, there are legitimate uses for a
lazy sum, and haskell is a lazy language by default.
Haskell is lazy by default, and we have found that to be
a big win in most cases. So we don't need to be
embarrassed to use strictness when that is the
right thing
Henk-Jan van Tuyl wrote:
reverse
maximum
minimum
Oh yes, please fix those also!
scanl
scanr
scanr1
iterate
take
drop
splitAt
inits
Hmm, I use those all the time with large lists. They are lazy as expected,
and seem to work fine. Do you have examples of problems with them?
foldM
I wrote:
I think the most important use cases that should not break are:
o open/read/write a FilePath from getArgs
o open/read/write a FilePath from getDirectoryContents
Simon Marlow wrote:
The following cases are currently broken:
* Calling openFile on a literal Unicode FilePath (note,
Simon Marlow wrote:
The following cases are currently broken...
I propose to fix these (on Windows). It will mean that your second case
above will be broken, until someone fixes getDirectoryContents...
...it's a lot easier on Windows...
on Unix I don't have a clear idea of how to proceed...
Ketil Malde wrote:
If we want to incorporate a translation layer, I think it's fair to
only support UTF-8 (ignoring locales), but provide a workaround for
invalid characters.
I disagree. Shells and GUI dialogs use the current locale.
I think most other modern programming languages do too, but
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 issues?
Simon Marlow wrote:
One for each issue is usually
Günther Schmidt wrote:
...*I*
have managed to write code that ghc is not even able to compile due to
exhausting virtual memory!
Top that!
Good work Günther!
Joe Fredette wrote:
Code or it didn't happen. :)
Yes, how did you do it?
Did it involve very large literals? GHC is known to have
Don Stewart wrote:
Newbies:
http://haskell.org
Everything regular users need at fingertips
http://dashboard.haskell.org/
That's fine. But please, no matter how minimalist
the newbie page, make sure that there is a clear
and prominent link there to the advanced page.
Otherwise, if I
Thomas Hartman wrote:
on haskell reddit today
powerSet = filterM (const [True, False])
is said to be beautiful / mind blowing.
Is this a uniquely haskell obfu, or is there a way of reading this
definition that makes sense?
To me, these are more obvious:
powerSet = map catMaybes . mapM
Hi Phil,
I'm trying to work out how to handle a choice at runtime
which determines what instance of a State monad should
be used.
First of all, you should realize that you'll almost never want
to do something like that in Haskell.
In my opinion, if you're coming from an OO language, you
Hi Gwern,
gwern0 wrote:
...efficiency is an issue.
Here are a few efficiency issues that I noticed in your algorithm
after a quick look (none of these have to do with Haskell really):
o ranks sorts the entire set, then discards all but the maximum.
It would be better to use maximum or
I agree with most of Alexander's many thoughtful comments
about Don's list of potential additions to HP. But I
disagree about pandoc.
Alexander Dunlap wrote:
No. Pandoc is too actively developed to go into the HP.
It depends on the nature of the development. If the
API is currently very
Dmitry Olshansky wrote:
My measurements show that...
(-O2 gives approx 2 time impovements).
...using RandomGen and State monad to generate a list gives at least 4 times
improvements (on 1 000 000 items).
You earlier said:
this takes over twice as long as a naively implemented
Python program
Tom Tobin wrote:
As I understand it, Pandoc is entirely under the GPL (not LGPL).
Oh. That would be an issue, yes. Too bad.
Thanks,
Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Peter Verswyvelen wrote:
Several libraries define their own codes for they keyboard (GLFW, GTK, GLUT,
etc)
Maybe it would be nice to agree on a standard datatype for keys? This might
also include digital buttons on a joystick, etc...
The Windows API has virtual key codes for this.
X windows
Peter Verswyvelen wrote:
Several libraries define their own codes for they keyboard
(GLFW, GTK, GLUT, etc)
Maybe it would be nice to agree on a standard datatype
for keys?
...The Windows API has virtual key codes for this.
I wrote:
X windows key symbols...
are found in the X11 package
Moving from libraries to haskell-cafe...
I wrote:
...there must be some
way to control the import and export of instances, just as we can
now control the import and export of every other kind of symbol
binding.
Henning Thielemann wrote:
For me it's most often the case that an instance is
John D. Ramsdell [EMAIL PROTECTED] wrote:
I tried to replace a permutation generator with one that generates
each permutation from the previous one, in a stream-like fashion. I
had hoped the stream-based algorithm would be more efficient because I
use only one permutation at a time, so only
Alfonso Acosta wrote:
I haven't tried to run the code, but my first bet is that, due to the
rank-2 polymorphism of ST, you should use parenthesis instead of $ in
the case of runST.
Perhaps if Andrew is using an old compiler.
That is no longer a problem in recent versions of GHC.
A more basic
I wrote:
A more basic issue is that fn is in the IO monad,
but its use inside the mapM will need it to be in the ST
monad.
Daniel Fischer wrote:
No,
return (fn particle) :: ST s (IO ())
, so that's fine.
Ah, true. But I doubt that Andrew really meant to
do the calculation in ST s (IO ()).
Maurício wrote:
Is it allowed to write two
different modules in a single
file?
That would be a really nice feature, especially
since modules are Haskell's only encapsulation
tool. You want it to be a lightweight as possible.
Malcolm Wallace wrote:
Some compilers permit it (e.g. Freja), most
I have submitted this as Feature Request #2550
http://hackage.haskell.org/trac/ghc/ticket/2550
Please add any comments as appropriate.
Thanks,
Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Lennart Augustsson wrote:
I don't think anyone has claimed that any interface can be implemented
without globals.
Of course some can't (just pick an interface that is the specification
of a global variable).
What I (and others) claims is that such interfaces are bad. Using a
global variable
Lennart Augustsson wrote:
As I said earlier, global variables may be necessary when interfacing
with legacy things (software or hardware).
By prior context I didn't mean legacy languages. I meant
logically prior - enclosing contexts.
It will always be necessary on occasion to refactor code
Marc Weber wrote:
(3) Third idea:
xmlWithInnerIO - execXmlT $ do
xmlns http://www.w3.org/1999/xhtml; lang en-US xml:lang en-US
head $ title $ text minimal
body $ do
args - lift $ getArgs
h1 $ text minimal
div $ text $ args passed to this program: ++ (show args)
Oops, needed to convert one more into a comma:
(rootElt ! [xmlns http://www.w3.org/1999/xhtml;
,lang en-US
,xml_lang en-US
]) $ concatXml
etc.
-Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Henry Laxen wrote:
Have I, like Monsier Jourdain, been running in the IO monad all my
life, and didn't even know it?
Marc Weber wrote:
Sure...
But the ghci error message is another one:
Try this:
:set -XNoMonomorphismRestriction
And I highly recommend putting that line in your .ghci file.
Ramin wrote:
...no matter how many tutorials I read, I find the only
kind of monad I can write is the monad that I copied
and pasted from the tutorial...
I am writing a mini-database...
The query itself is stateful...
The query may also make updates to the records.
I also
thought of trying
Ashley Yakeley wrote:
Currently Data.Unique uses the NOINLINE unsafePerformIO
hack to create its MVar. If hs-plugins duplicates that MVar,
that's a bug in hs-plugins.
Sittampalam, Ganesh wrote:
Also, the definition of NOINLINE in the report doesn't
preclude copying both the MVar *and* its
I wrote:
For the short term - can we *please* get an ONLYONCE
pragma that has the correct semantics?
Sittampalam, Ganesh wrote:
So the purpose of this pragma would solely be so that
you can declare hs-plugins buggy for not respecting it?
No, the hs-plugins problem - whether hypothetical or
For the short term - can we *please* get an ONLYONCE pragma that has
the correct semantics?
Sittampalam, Ganesh wrote:
How do you propose that this pragma would be implemented?
As far as I know now, in GHC it could currently just be
an alias for NOINLINE, but the GHC gurus could say for sure.
I wrote
Other applications and libraries that support the pragma -
such as other compilers, and hs-plugins - would be
required to respect the guarantee, and bugs could be
filed against them if they don't.
Sittampalam, Ganesh wrote:
If hs-plugins were loading object code, how would it even
Chris Kuklewicz wrote:
Who can suggest a way to cast from Float to Word32 and Double to Word64
using ghc? The actual task is that I need to write out the Float as a
little endian sequence of four bytes and also be able to read it back in.
The writing and reading are done in Put and Get
Derek Elkins wrote:
In general, to encode OO...
turns out all you needed was recursive bounded
existential quantification.
Do you have a reference for that?
Thanks,
Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Derek Elkins wrote:
As far as I can tell, no one actually uses parallel list comprehensions.
With any luck, the same will be true for generalized list
comprehensions.
I second this.
-Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
\begin{code}
kmin :: Ord a = Int - [a] - [Int]
kmin k x = map snd $ Set.toList $ foldl' insertIfSmall (Set.fromList h) t
where
(h, t) = splitAt k $ zip x [0..]
insertIfSmall :: Ord a = Set.Set a - a - Set.Set a
insertIfSmall s e
| e mx= Set.insert e s'
| otherwise = s
where
(mx, s')
\begin{code}
kmin :: Ord a = Int - [a] - [Int]
kmin k x = map snd $ Set.toList $ foldl' insertIfSmall (Set.fromList h) t
where
(h, t) = splitAt k $ zip x [0..]
insertIfSmall :: Ord a = Set.Set a - a - Set.Set a
insertIfSmall s e
| e mx= Set.insert e s'
| otherwise = s
where
(mx, s')
Back to the original problem for a moment.
\begin{code}
import qualified Data.Sequence as Seq
import Data.Sequence ((|), ViewL((:)))
weave :: [[a]] - [a]
weave = weaveSeqL . Seq.viewl . Seq.fromList
where
weaveSeqL ((x:xs) : s) = x : weaveSeqL (Seq.viewl $ s | xs)
weaveSeqL _
Ruben Zilibowitz wrote:
What does it mean if I'm trying to check out a darcs repository and I
get the following error?
darcs: ./.DS_Store: openBinaryFile: does not exist (No such file or
directory)
If you are doing darcs get from a partial repo and you
did not use --partial, then this sounds
DavidA wrote:
What I mean is, it seems like good design would mean that you could write and
test the game logic totally independently of any IO. Game functions such
as makeMove ought to have type signatures that don't involve any IO. Can this
be achieved in option 2?
Here is one way:
For
Border conditions in the Haskell Library
have finally made the mainstream media:
http://www.cnn.com/2007/US/05/26/border.quirk.ap/index.html
-Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Andrew Coppin wrote:
Does it suggest unfoldr too?
I think Neil's idea to have this customizable is a good one.
It's often a matter of taste.
I would rarely want to use unfoldr, and I wouldn't want HList
to bother me about it. Instead, I prefer to use iterate for both
of Andrew's examples:
Sigbjorn Finne wrote:
the first public release of hs-dotnet is now available
Fantastic accomplishment! I can only repeat dons' comment
- this could be game-changing.
Some obvious questions that come to mind:
We see that it is already possible to expose a Haskell function
to .NET as a callback.
Sukit Tretriluxana:
I was looking around Stroustrup's website and found
a simple program... I wondered how a Haskell
program equivalent to it looks like...
main = E.catch (interact reverseDouble) (\_ - print format error)
toDoubles = map (read::String-Double)
For a safe program in
Duncan Coutts wrote:
We want to let random users on random
platforms submit simple anonymous build reports (no logs)...
The only downside compared to a more centralised system is that we do
not get to centrally monitor the status of the dedicated build clients.
And that we open ourselves up
Duncan Coutts wrote:
let random users... submit... build reports...
I wrote:
...we open ourselves up to... hostile build reports and DOS.
Manlio Perillo wrote:
DOS is always a problem, for every application open to the Internet.
Yes. But I didn't mean just generic flooding. I meant
abusing
Duncan Coutts wrote:
Detailed build reports with logs are not anonymous, clients will need an
account on hackage (ie username and password).
Right. If we experience problems with that in the future,
we just have to make sure that it won't be too hard
to set up captcha.
they'll either be
Jeff,
I'm not sure if this is causing the problem you're referring to,
but MacPorts is at GHC 6.10 while Gtk2Hs doesn't support
that yet.
Regards,
Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Both of the points raised by Malcolm are a matter of
personal preference, in my opinion. In fact, my own
preference is the opposite of Malcolm's in both cases.
Both of Malcolm's suggestions would rob me of filtering
capability.
Malcolm Wallace wrote:
I would suggest that posting announcements
Duncan Coutts wrote:
This was uploaded to hackage yesterday:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HDBC-mysql-0.1
This is wonderful news! Whatever we might say about MySQL,
it is so ubiquitous that this driver is really important for Haskell.
Chris, please keep us
Chris Waterson wrote:
You probably already know this, but... you can
mix tables from different storage engines in a
single *statement*.
Oh, no, I thought it was per database. Horrors!
...when a ROLLBACK has been issued
against a non-transactional table... I could raise an
error... perhaps
Duncan Coutts wrote:
So in the next cabal-install release (which should be pretty soon now)
configure will do the same thing and pick base 3 unless you specify
build-depends base = 4.
Niklas Broberg wrote:
I really really think this is the wrong way to go. Occasional
destruction is
Thomas Davie wrote:
This is caused by OS X's libiconv being entirely CPP
macros, the FFI has nothing to get hold of.
IIRC there's a ghc bug report open for it.
Judah Jacobson wrote:
The OS X system libiconv is actually OK; it's the MacPorts libiconv
that has the CPP macros...
Thanks for the
Manlio Perillo wrote:
The first difference is about a `mod` b, when a and b are Float types.
Python use the fmod function, and it also implement divmod; Haskell seems to
lack support for this operation.
Yes, Haskell does not implement the full IEEE. There are
differing opinions about that:
Manlio Perillo wrote:
The first difference is about a `mod` b, when a and b are Float types.
Python use the fmod function, and it also implement divmod; Haskell seems to
lack support for this operation.
I wrote:
Yes, Haskell does not implement the full IEEE.
I spoke too soon. Data.Fixed.mod'
Manlio Perillo wrote:
fac(777) / fac(777)
1.0
Here CPython does not convert the two integers to float before to divide
them, but make use of a special algorithm.
GHC, instead, returns NaN
I wrote:
No, actually here Haskell shines. Perhaps this GHCi session
will illuminate the issue for
Manlio Perillo wrote:
No.
I'm looking for...
Manlio - can you describe exactly what you want?
Do you know exactly what you want?
You have said that you want division like in Python -
but that even that is not well defined:
Python 2.6.1
3/5
0
Python 3.1
3/5
0.59998
Please tell
Manlio Perillo wrote:
However there is still a *big* problem: it is inefficient.
Here is a Python version of the Chudnovsky algorithm [1] for computing Pi:
http://paste.pocoo.org/show/102800/
On my system it takes 10 seconds.
Here is an Haskell version:
http://paste.pocoo.org/show/102801/
Manlio Perillo wrote:
I'm looking for an exact integer division that avoids overflows, if
possible.
Richard O'Keefe wrote:
What this sounds like to me is a request that the Prelude
function 'fromRational' should work well...
If you cannot divide two Integers n, d accurately using
Manlio Perillo wrote:
By the way, in GHC.Float there is a (private):
integerLogBase :: Integer - Integer - Int
Yes, I have needed this function many times.
Too bad it is not exposed.
In this case, though, we only need base 2.
For that, it would be nice if we could just read
it directly from
Peter Verswyvelen wrote:
I do have asked myself the question whether a really random generating
function could be regarded as pure somehow
Not really. Somewhere in your program you are likely to make
the assumption that a value you obtained, however indirectly,
from this function will be the
Peter Verswyvelen wrote:
I do have asked myself the question whether
a really random generating
function could be regarded as pure somehow
I wrote:
Not really...
Alberto G. Corona wrote:
What is pure randomness? .When the algorithmic complexity of the list of
random number is equal to the
Hi Manlio,
Manlio Perillo wrote:
For my Netflix Prize project I have implemented two reusable modules.
The first module implements a random shuffle on immutable lists...
The second module implements a function used to partition a list into n
sublists of random length.
Very nice!
If someone
I spoke to a faculty member in a decent Computer Science
department in which no one has ever done anything
related to FP. (You may say that is an inherent contradiction,
but what can I do, the department does have a good
reputation. I am withholding names to protect the
innocent.)
This faculty
Melanie_Green writes:
I want to use listcomprehension to output the pattern below...
Jón Fairbairn wrote:
Why do you want to use list comprehensions?
What if they aren't the best way of getting the
result you want?
unlines . tail . inits . repeat $ 'a'
concat [replicate n 'a' ++ \n | n -
I wrote:
I would like some links that would give such a person
a nice overview of the various active areas of
FP-related research these days...
Bernie Pope wrote:
Some ideas off the top of my head...
Thanks, that's exactly what I was looking for.
Also, thanks to Sean for suggesting the
Manlio Perillo complained about:
buildPartitions xs ns = zipWith take ns . init . scanl (flip drop) xs $ ns
Miguel Mitrofanov wrote:
takeList = evalState . mapM (State . splitAt)
Ha! Bravo!
As the author of the offending zipWith/scanl version,
I can say that love those State monad one-liners.
Miguel Mitrofanov wrote:
takeList = evalState . mapM (State . splitAt)
I wrote:
However, ironically, I stopped using them for pretty
much the same reason that Manlio is saying.
Dan Piponi wrote:
Are you saying there's a problem with this implementation? It's the
only one I could just read
After a reboot, community.haskell.org is now responding again
on port 25. Please check to see if the mailing lists are
working again.
Thanks,
Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Erik de Castro Lopo wrote:
...my mail server is rejecting the message coming back
to me...
Nun.haskell.org really should have a reverse DNS entry
Ah, that is probably a casualty of the recent upgrade of
the haskell.org server. As part of that process, control
of the domain was moved from Yale
Hi Felipe,
Thanks so much for implementing the attoparsec-text package.
Could you please add an IsString instance for Parser Text,
parallel to the one in attoparsec? You may have missed this because
of it being an orphan instance in attoparsec.
It should be something like:
instance IsString
Using the IsString instance for Parser in attoparsec is really nice,
but unfortunately, you can't use it out of the box for the most common
case.
One would like to be able to write parsers in this style:
( * stuff * )
But the types of * and * are too general - there is no way for
the type
Christian Maeder wrote:
Let's notify the maintainer to use an ordinary minus sign
I actually did that two days ago. Other people probably
did too. But I haven't seen any response yet.
-Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
The community server, on which resides the domains:
community.haskell.org
projects.haskell.org
code.haskell.org
trac.haskell.org
planet.haskell.org
is down, due to a hacker attack.
Rather than trying to repair the old machine it was on,
this is the time to migrate this server (finally) to the
301 - 400 of 500 matches
Mail list logo
