Brandon S. Allbery KF8NH wrote:
On Feb 5, 2010, at 02:56 , Bardur Arantsson wrote:
[--snip--]
"Broken pipe" is normally handled as a signal, and is only mapped to an
error if SIGPIPE is set to SIG_IGN. I can well imagine that the SIGPIPE
signal handler isn't closing resources properly; a wo
Hello Aran
Changing to an explicit sum type rather than using Either might
subsequent functions that process a Binding cleaner:
data Binding = BoundVar Var Value
| PossiblyBound Var [Value]
Naturally you might want to consider a better constructor name than
'PossiblyBound'.
--
On 6 February 2010 03:33, Ivan Miljenovic wrote:
> If you upgrade a library, it will break all other libraries that
> depend upon it. "ghc-pkg list" will tell you which libraries are
> broken and need to be rebuilt.
I think you mean "ghc-pkg check".
Peter
_
On 6 February 2010 19:23, Peter Robinson wrote:
> I think you mean "ghc-pkg check".
Yes, I do. Whoops :s
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com
Charles de Gaulle - "The better I get to know men, the more I find
myself loving dogs." -
http://www.brain
2010/2/5 Roger King :
> I am building a simulator for an interconnect network for a multiprocessor
> computer. I would like to develop it in Haskell as an opportunity to learn
> Haskell.
>
> The network will have a number of routers with input ports and output ports
> and crossbars between them
I've put my benchmarking code online at:
http://inmachina.net/~jwlato/haskell/research-iteratee.tar.bz2
unpack it so you have this directory structure:
./iteratee
./research-iteratee/
Also download my criterionProcessor programs. The darcs repo is at
http://inmachina.net/~jwlato/haskell/crite
On Sat, Feb 06, 2010 at 09:16:35AM +0100, Bardur Arantsson wrote:
> Brandon S. Allbery KF8NH wrote:
> >On Feb 5, 2010, at 02:56 , Bardur Arantsson wrote:
> [--snip--]
> >
> >"Broken pipe" is normally handled as a signal, and is only mapped
> >to an error if SIGPIPE is set to SIG_IGN. I can well im
Hi,
Just wondering whether I can use ShowS or tupling or Difference Lists to speed
up the following code?
It's basic text processing. It takes in a list of Lines where each Line is a
list of Words and intersperses " " between them then concatenates them into a
longer String. Note that there i
> From: Aran Donohue
>
> Hi Haskell-Cafe,
>
> Consider a data type such as
>
> data Binding = Binding Var (Either Value [Value])
>
> representing a variable bound either to a fixed value or that has a list of
> possible values.
>
> I'd like to perform an operation on say, the fixed-value members o
Am Samstag, den 06.02.2010, 23:12 +1030 schrieb Mark Spezzano:
> Hi,
>
> Just wondering whether I can use ShowS or tupling or Difference Lists to
> speed up the following code?
>
> It's basic text processing. It takes in a list of Lines where each Line
> is a list of Words and intersperses " "
On Sat, Feb 06, 2010 at 11:12:40PM +1030, Mark Spezzano wrote:
> -- Function: joinLines
> -- Joins the Words within Lines together with whitespace and newline
> characters
> -- Argument: Lines to pad with whitespace and newlines
> -- Evaluate: The processed and concatenated String
> joinLines :: [
Hi John
I'm not sure about making Binding polymorphic to get Functor,
Traversable, Foldable...
While I think you're correct that partitionEithers might not be a
useful example to draw from in this case, I'd assume that Binding
would be part of a larger syntax-tree, thus there might not be a
appro
Am Samstag 06 Februar 2010 13:42:40 schrieb Mark Spezzano:
> Hi,
>
> Just wondering whether I can use ShowS or tupling or Difference Lists to
> speed up the following code?
>
> It's basic text processing. It takes in a list of Lines where each Line
> is a list of Words and intersperses " " between
On Feb 6, 3:33 am, Ivan Miljenovic wrote:
> On 6 February 2010 01:05, Johannes Waldmann
>
> wrote:
> > so please please please have "cabal install" fail with some error
> > message if (that is, before) the install would break anything. - J.
>
> If you upgrade a library, it will break all other
Felipe Lessa wrote:
On Sat, Feb 06, 2010 at 09:16:35AM +0100, Bardur Arantsson wrote:
Brandon S. Allbery KF8NH wrote:
On Feb 5, 2010, at 02:56 , Bardur Arantsson wrote:
[--snip--]
"Broken pipe" is normally handled as a signal, and is only mapped
to an error if SIGPIPE is set to SIG_IGN. I ca
On Tue, 02 Feb 2010 09:16:03 -0800, Creighton Hogg wrote:
> 2010/2/2 Álvaro García Pérez
>
>> You may try Pierce's "Basic Category Theory for Computer Scientists" or
>> Awodey's "Category Theory", whose style is rather introductory. Both of them
>> (I think) have a chapter about functors where t
Bardur Arantsson wrote:
(sorry about replying-to-self)
During yet another bout of debugging, I've added even more "I am here"
instrumentation code to the SendFile code, and the culprit seems to be
> threadWaitWrite.
I think I've pretty much confirmed this.
I've changed the code again. This t
On Sun, 07 Feb 2010 01:38:08 +0900
"Benjamin L. Russell" wrote:
> On Tue, 02 Feb 2010 09:16:03 -0800, Creighton Hogg wrote:
>
> > 2010/2/2 Álvaro García Pérez
> >
> >> You may try Pierce's "Basic Category Theory for Computer
> >> Scientists" or Awodey's "Category Theory", whose style is rather
After convincing myself the hard way that you can't be lazy across
strict monadic results (by writing myself a "foldrM" -- yeah, I'm
still a beginner), I noticed the recent discussion of safe-lazy-io vs.
iteratee with interest. The safe-lazy-io package seems much easier to
understand than iteratee
On Sat, 6 Feb 2010 11:38:25 -0600, Tom Tobin wrote:
> After convincing myself the hard way that you can't be lazy across
> strict monadic results (by writing myself a "foldrM" -- yeah, I'm
> still a beginner), I noticed the recent discussion of safe-lazy-io vs.
> iteratee with interest. The safe-
As other people have mentioned, you are duplicating library
functionality. But nobody has actually talked about the performance
characteristics of your code.
Fortunately for you, the calls to (++) in your recursion are
right-associative, so you don't have an asymptotic problem where your
program
One way or the other, this has been a very productive question for getting
good pointers on what to read about next...
Thanks again.
Aran
On Sat, Feb 6, 2010 at 8:18 AM, Stephen Tetley wrote:
> Hi John
>
> I'm not sure about making Binding polymorphic to get Functor,
> Traversable, Foldable...
>
me too.
2010/2/5 MightyByte :
> I've been seeing a steady stream of similar resource vanished messages
> for as long as I've been running my happstack app. This message I get
> is this:
>
> : hClose: resource vanished (Broken pipe)
>
> I run my app from a shell script inside a "while true" loop,
Hi,
all my posts to the haskellmode-emacs list (using the address in the
subject) are being rejected with the error:
451 451 Temporary local problem - please try later (state 18)
(after several retries by the Google smtp server, which i use as a
smarthost).
Any idea of what could be causing
On 7 February 2010 07:39, Jose A. Ortega Ruiz wrote:
> all my posts to the haskellmode-emacs list (using the address in the
> subject) are being rejected with the error:
> 451 451 Temporary local problem - please try later (state 18)
> (after several retries by the Google smtp server, which i use
I have released data-ordlist 0.2, with a number of changes:
1. The module name is now Data.List.Ordered, instead of Data.OrdList
2. Three bugfixes: (ack!) insertSet and insertBag assumed reverse-ordered
lists, nub failed to remove duplicates. Thanks to Topi Karvonen for
reporting the fir
26 matches
Mail list logo
