On Thu, Dec 24, 2009 at 11:38 PM, Roman Cheplyaka r...@ro-che.info wrote:
So, let's think what we can do at runtime. Suppose RTS takes the parameter --
upper limit of consumed memory. When it sees that memory consumption is
close to upper bound, it can:
1. force garbage collection
This is
i tried to install editline (because i wanted to install djinn, which depends
on it):
with cabal install and with downloading and runghc Setup.lhs configure
i got the same error:
checking for completion_matches... no
configure: error: editline not found, so this package cannot be built
See
Stephen Tetley wrote:
Hello Gregory
I've never used HXT, but looking at the source there are many
functions with types like this one:
getElemNodeSet:: ArrowXml a = a XmlTree XmlTree - a XmlTree
XmlNodeSet
They are functions where the arrow is 'a XmlTree _something_.
Perhaps you can ask on the Ocaml mailing list too.
Done.
I know Standard ML,
never wrote any big software in it due to the lack of libraries.
Yes, same problem here.
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Fri, Dec 25, 2009 at 5:14 AM, Svein Ove Aas svein@aas.no wrote:
On Thu, Dec 24, 2009 at 11:38 PM, Roman Cheplyaka r...@ro-che.info wrote:
So, let's think what we can do at runtime. Suppose RTS takes the parameter --
upper limit of consumed memory. When it sees that memory consumption is
Am Freitag 25 Dezember 2009 15:45:29 schrieb Gwern Branwen:
On Fri, Dec 25, 2009 at 5:14 AM, Svein Ove Aas svein@aas.no wrote:
On Thu, Dec 24, 2009 at 11:38 PM, Roman Cheplyaka r...@ro-che.info wrote:
So, let's think what we can do at runtime. Suppose RTS takes the
parameter -- upper
Dear All,
Recently, I've been playing with self-application and fixed-point
combinators definition in Haskell.
It is possible to type them in Haskell using recursive types.
I took Y U combinators:
newtype Rec a = In { out :: Rec a - a }
u :: Rec a - a
u x = out x x
y :: (a - a) - a
y f
Dear All,
Recently, I've been playing with self-application and fixed-point
combinators definition in Haskell.
It is possible to type them in Haskell using recursive types.
I took Y U combinators:
newtype Rec a = In { out :: Rec a - a }
u :: Rec a - a
u x = out x x
y :: (a - a) - a
y f
On Friday 25 December 2009 06:09:55 Matt Morrow wrote:
On 12/23/09, Jon Harrop j...@ffconsultancy.com wrote:
And your results above indicate that the fastest imperative heap is over
3x faster than the fastest functional heap?
It's saying that
(1) Using an imprecise an
On Fri, Dec 25, 2009 at 2:17 AM, Andrew U. Frank
fr...@geoinfo.tuwien.ac.at wrote:
i tried to install editline (because i wanted to install djinn, which depends
on it):
with cabal install and with downloading and runghc Setup.lhs configure
i got the same error:
checking for
On Mon, Jun 15, 2009 at 4:18 AM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
There's a current thread in the Erlang mailing list about
priority queues. I'm aware of, for example, the Brodal/Okasaki
paper and the David King paper. I'm also aware of James Cook's
priority queue package in
2009/12/25 Svein Ove Aas svein@aas.no:
On Mon, Jun 15, 2009 at 4:18 AM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
There's a current thread in the Erlang mailing list about
priority queues. I'm aware of, for example, the Brodal/Okasaki
paper and the David King paper. I'm also aware of
On Friday 25 December 2009 11:35:38 am Vladimir Ivanov wrote:
Dear All,
Recently, I've been playing with self-application and fixed-point
combinators definition in Haskell.
It is possible to type them in Haskell using recursive types.
I took Y U combinators:
newtype Rec a = In { out
One of the correspondents in that thread claims that it is
provably impossible to have an efficient priority queue implementation
without mutability. I think he's cuckoo. But I'd like to have some
numbers to back me up.
He is cuckoo, and here's proof:
Andrew U. Frank fr...@geoinfo.tuwien.ac.at writes:
checking for completion_matches... no
configure: error: editline not found, so this package cannot be built
See `config.log' for more details.
Do you have the editline (sometimes also called libedit) C library installed?
--
Ivan Lazar
On Fri, 25 Dec 2009, Heinrich Apfelmus wrote:
Which begets the question of whether HXT actually uses a way of taking
input other than as function parameter. It appears to me that it doesn't.
Put differently, I suspect that all of HXT can be rewritten to
mkCmt :: String - M XmlTree
Mark Lentczner wrote:
[*] The Apple guidelines for the /Library and ~/Library files are
here:http://developer.apple.com/mac/library/documentation/MacOSX/Conceptual/BPFileSystem/Articles/LibraryDirectory.html#//apple_ref/doc/uid/20002282-BAJHCHJI
Thanks for the link. I followed through to a
Serguey Zefirov sergu...@gmail.com wrote:
1) How to write a parser that could be restarted? Like, it will be
represented by a function that returns something along the lines
data ParseStepResult input result =
Success (Maybe (input - ParseStepResult input result)) (Maybe result)
|
2009/12/25 Valery V. Vorotyntsev valery...@gmail.com:
1) How to write a parser that could be restarted? Like, it will be
represented by a function that returns something along the lines
data ParseStepResult input result =
Success (Maybe (input - ParseStepResult input result)) (Maybe
On Fri, Dec 25, 2009 at 11:25:41PM +0200, Serguey Zefirov wrote:
I am looking more for the way to serialize intermediate parser
computations. The first problem is, actually, easy one. ;)
Probably you'll have to create a data constructor for each step
of your parser.
AFAIK, one of HAppS modules
On Fri, Dec 25, 2009 at 4:55 PM, Felipe Lessa felipe.le...@gmail.com wrote:
On Fri, Dec 25, 2009 at 11:25:41PM +0200, Serguey Zefirov wrote:
I am looking more for the way to serialize intermediate parser
computations. The first problem is, actually, easy one. ;)
Probably you'll have to create
2009/12/25 Felipe Lessa felipe.le...@gmail.com:
I am looking more for the way to serialize intermediate parser
computations. The first problem is, actually, easy one. ;)
Probably you'll have to create a data constructor for each step
of your parser.
AFAIK, one of HAppS modules does a
AFAIK, one of HAppS modules does a similar transformation via
Template Haskell. The functions specify transactions, and each
transaction is converted to a serializable data type. Then it's
possible to create a transaction log by serializing them before
their execution.
The happstack
On Fri, Dec 25, 2009 at 5:06 PM, Serguey Zefirov sergu...@gmail.com wrote:
AFAIK, one of HAppS modules does a similar transformation via
Template Haskell. The functions specify transactions, and each
transaction is converted to a serializable data type. Then it's
possible to create a
On Friday 25 December 2009 19:59:39 Louis Wasserman wrote:
One of the correspondents in that thread claims that it is
provably impossible to have an efficient priority queue implementation
without mutability. I think he's cuckoo. But I'd like to have some
numbers to back me up.
He is
On Fri, Dec 25, 2009 at 05:12:22PM -0500, Antoine Latter wrote:
In that case, You'll be able to serialize that as long as you can
serialize (m a).
I meant higher-order as in function-types. So you wouldn't be able to
serialize:
string :: String - Parser String
Unless you had some way to
Graham Klyne wrote:
Mark Lentczner wrote:
[*] The Apple guidelines for the /Library and ~/Library files are
here:http://developer.apple.com/mac/library/documentation/MacOSX/Conceptual/BPFileSystem/Articles/LibraryDirectory.html#//apple_ref/doc/uid/20002282-BAJHCHJI
Thanks for the link. I
27 matches
Mail list logo
